Hypergroups and distance distributions of random walks on graphs
Probability
2020-01-23 v1 Combinatorics
Abstract
Wildberger's construction enables us to obtain a hypergroup from a special graph via random walks. 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.
Cite
@article{arxiv.2001.07925,
title = {Hypergroups and distance distributions of random walks on graphs},
author = {Kenta Endo and Ippei Mimura and Yusuke Sawada},
journal= {arXiv preprint arXiv:2001.07925},
year = {2020}
}
Comments
15 pages, 6 figures