Hypergroups and distance distributions of random walks on graphs

Authors

  • Kenta Endo
  • Ippei Mimura
  • Yusuke Sawada

DOI:

https://doi.org/10.7146/math.scand.a-122932

Abstract

Wildberger's construction enables us to obtain a hypergroup from a random walk on a special graph. We will give a probability theoretic interpretation to products on the hypergroup. The hypergroup can be identified with a commutative algebra whose basis is transition matrices. We will estimate the operator norm of such a transition matrix and clarify a relationship between their matrix products and random walks.

Downloads

Published

2021-02-17

Issue

Section

Articles

How to Cite

[1]
K. Endo, I. Mimura, and Y. Sawada, “Hypergroups and distance distributions of random walks on graphs”, Math. Scand., vol. 127, no. 1, pp. 43–62, Feb. 2021, doi: 10.7146/math.scand.a-122932.