Abstract
A pointed graph \((\Gamma ,v_0)\) induces a family of transition matrices in Wildberger’s construction of a hermitian hypergroup using a random walk on \(\Gamma \) starting from \(v_0\). In this study, we propose a necessary condition for producing a hermitian hypergroup considering a weaker condition than the distance-regularity for \((\Gamma ,v_0)\). Furthermore, we show that the condition obtained connects the transition and adjacency matrices associated with \(\Gamma \).
Similar content being viewed by others
Availability of data material
All data generated or analyzed during this study are included in this published article.
References
Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1993)
Bloom, W.R., Heyer, H.: Harmonic Analysis of Probability Measures on Hypergroups. Walter de Gruyter & Co., Berlin (1995)
Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer, New York (1989)
Dunkl, C.F.: The measure algebra of a locally compact hypergroup. Trans. Amer. Math. Soc. 179, 331–348 (1973)
Endo, K., Mimura, I., Sawada, Y.: Hypergroups and distance distributions of random walks on graphs. Math. Scand. 127, 43–62 (2021)
Jewett, R.I.: Spaces with an abstract convolution of measures. Adv. Math. 18, 1–101 (1975)
Ikkai, T., Sawada, Y.: Hypergroups derived from random walks on some infinite graphs. Monatsh. Math. 189, 321–353 (2019)
Lasser, R.: Discrete commutative hypergroups. In: Zu Castell, W., Filbir, F., Forster, B. (eds.) Inzell Lectures on Orthogonal Polynomials, pp. 55–102. Nova Science Publishers, Hauppauge (2005)
Spector, R.: Mesures invariantes sur les hypergroupes. Trans. Amer. Math. Soc. 239, 147–165 (1978)
Wildberger, N.J.: Hypergroups associated to random walks on Platonic solids. University of NSW, Preprint (1994)
Wildberger, N.J.: Finite commutative hypergroups and applications from group theory to conformal field theory. Contemp. Math. 183, 413–434 (1995)
Wildberger, N.J.: Strong hypergroups of order three. J. Pure Appl. Algebra 174, 95–115 (2002)
Acknowledgements
The authors thank Kenta Endo and Ippei Mimura for their helpful comments. This work was supported by JSPS KAKENHI Grant-in-Aid for Research Activity Start-up (No. 19K23403). The authors would also like to thank MARUZEN-YUSHODO Co., Ltd. (https://kw.maruzen.co.jp/kousei-honyaku/) for the English language editing.
Funding
This work was supported by JSPS (Japan Society for the Promotion of Science) KAKENHI Grant-in-Aid for Research Activity Start-up (No. 19K23403).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Ikkai, T., Ohno, H. & Sawada, Y. Adjacency and transition matrices related to random walks on graphs. J Algebr Comb 56, 249–267 (2022). https://doi.org/10.1007/s10801-021-01107-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10801-021-01107-w
Keywords
- Discrete hypergroup
- Random walk on graph
- Distance in graph
- Self-centered graph
- Adjacency matrix
- Transition matrix