Hypergroups derived from random walks on some infinite graphs

DOI10.1007/S00605-018-1255-YMaRDI QIDQ2416345zbMATH OpenOpenAlexWikidataFDO

Authors Tomohiro Ikkai, Yusuke Sawada

Publication date 23 May 2019

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.07566

zbMATH Keywords

association schemesCayley graphsdistance-regular graphsHermitian discrete hypergroupsinfinite graphs

Mathematics Subject Classification ID

Random walks on graphs (05C81) Harmonic analysis on hypergroups (43A62)

Abstract: Wildberger gave a method to construct a finite hermitian discrete hypergroup from a random walk on a certain kind of graphs. In this article, we reveal that his method is applicable to a random walk on a certain kind of infinite graphs. Moreover, we make some observations of finite or infinite graphs on which a random walk produces a hermitian discrete hypergroup.

Review text

The classification of finite groups of small order is one of the classical topics of finite group theory. On the other hand, it is very hard to classify finite hypergroups, although structures of finite hypergroups of order two and three are completely determined. \textit{N. J. Wildberger} [in: Applications of hypergroups and related measure algebras. A joint summer research conference on applications of hypergroups and related measure algebras. Providence: American Mathematical Society. 413--434 (1995; Zbl 0826.43003)] gave a systematic way to construct a finite hypergroup (commutative) from a random walk on certain finite graphs. Further, Wildberger, in his paper, has also mentioned that a random walk on any strong regular graph and any distance transitive graph produces a hypergroup of order three. He has also suggested that a random walk on any distance-regular graph produces a finite hypergroup. \par In this paper under review, the authors extend Wildberger's contruction on some infinite graphs. In fact, a random walk on some infinite graph is used to produce a discrete countable hypergroup. Section 3 deals with infinite distance-regular graphs. Here they show that these graphs produce a hermitian discrete hypergroup. Section 4 deals with non-distance-regular graphs. Some examples of this kind of graphs, which gives rise to discrete hypergroups, are discussed.

Recommendations

• Adjacency and transition matrices related to random walks on graphs
• Hypergroups and distance distributions of random walks on graphs
• scientific article; zbMATH DE number 4096473
• scientific article; zbMATH DE number 757827
• Markov chains with stable drift and law of large numbers on hypergroups
• A survey of results on random random walks on finite groups
• Random groups arising as graph products.
• Random walks in random Dirichlet environment are transient in dimension \(d \geq 3\)
• On the finite hypergroup associated with a strongly regular graph
• The non-commuting graph of a non-central hypergroup

Cites work

• Harmonic analysis of probability measures on hypergroups
• scientific article; zbMATH DE number 6700667 (Why is no real title available?)
• scientific article; zbMATH DE number 3855507 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1022519 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 2117211 (Why is no real title available?)
• scientific article; zbMATH DE number 757843 (Why is no real title available?)
• Mesures Invariantes Sur Les Hypergroupes
• Non-commutative hypergroup of order five
• Spaces with an abstract convolution of measures
• Strong hypergroups of order three
• The Measure Algebra of a Locally Compact Hypergroup

Cited in

(6)

• Lagrange's theorem and integrality for finite commutative hypergroups with applications to strongly regular graphs
• Adjacency and transition matrices related to random walks on graphs
• On the finite hypergroup associated with a strongly regular graph
• Hypergroups and distance distributions of random walks on graphs
• Geometric hypergroups
• Hypergroup structures of open quantum random walks on distance sets

This page was built for publication: Hypergroups derived from random walks on some infinite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2416345)