Hypergroups derived from random walks on some infinite graphs
Probability
2017-06-01 v3
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.
Cite
@article{arxiv.1705.07566,
title = {Hypergroups derived from random walks on some infinite graphs},
author = {Tomohiro Ikkai and Yusuke Sawada},
journal= {arXiv preprint arXiv:1705.07566},
year = {2017}
}
Comments
40 pages, 8 figures