The full spectrum of random walks on complete finite d-ary trees

Evita Nestoridi, Oanh Nguyen

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Article number43
JournalElectronic Journal of Probability
Volume26
DOIs
StatePublished - 2021
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Keywords

  • Random walk
  • Regular trees
  • Spectrum

Fingerprint Dive into the research topics of 'The full spectrum of random walks on complete finite d-ary trees'. Together they form a unique fingerprint.

Cite this