The full spectrum of random walks on complete finite d-ary trees
Author(s): Nestoridi, Evita; Nguyen, Oanh
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1xw47v8w| Abstract: | In the present paper, we determine the full spectrum of the simple random walk on finite, complete d-ary trees. We also find an eigenbasis for the transition matrix. As an application, we apply our results to get a lower bound for the interchange process on complete, finite d-ary trees, which we conjecture to be sharp. |
| Publication Date: | 2021 |
| Citation: | Nestoridi, Evita, Nguyen, Oanh. (2021). The full spectrum of random walks on complete finite d-ary trees. ELECTRONIC JOURNAL OF PROBABILITY, 26 (10.1214/21-EJP608 |
| DOI: | doi:10.1214/21-EJP608 |
| ISSN: | 1083-6489 |
| Language: | English |
| Type of Material: | Journal Article |
| Journal/Proceeding Title: | ELECTRONIC JOURNAL OF PROBABILITY |
| Version: | Final published version. This is an open access article. |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.