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

Evita Nestoridi; Oanh Nguyen

doi:10.1214/21-EJP608

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

Evita Nestoridi, Oanh Nguyen

Mathematics

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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 language	English (US)
Article number	43
Journal	Electronic Journal of Probability
Volume	26
DOIs	https://doi.org/10.1214/21-EJP608
State	Published - 2021

All Science Journal Classification (ASJC) codes

Statistics and Probability
Statistics, Probability and Uncertainty

Keywords

Random walk
Regular trees
Spectrum

Access to Document

10.1214/21-EJP608

Cite this

@article{c3e530f6e7624227aa5d267cab62824b,

title = "The full spectrum of random walks on complete finite d-ary trees",

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.",

keywords = "Random walk, Regular trees, Spectrum",

author = "Evita Nestoridi and Oanh Nguyen",

year = "2021",

doi = "10.1214/21-EJP608",

language = "English (US)",

volume = "26",

journal = "Electronic Journal of Probability",

issn = "1083-6489",

publisher = "Institute of Mathematical Statistics",

}

TY - JOUR

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

AU - Nestoridi, Evita

AU - Nguyen, Oanh

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

KW - Random walk

KW - Regular trees

KW - Spectrum

UR - http://www.scopus.com/inward/record.url?scp=85104769090&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85104769090&partnerID=8YFLogxK

U2 - 10.1214/21-EJP608

DO - 10.1214/21-EJP608

M3 - Article

AN - SCOPUS:85104769090

SN - 1083-6489

VL - 26

JO - Electronic Journal of Probability

JF - Electronic Journal of Probability

M1 - 43

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this