Hypergroups derived from random walks on some infinite graphs

From MaRDI portal




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.









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)