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

Princeton University
University of Illinois at Urbana-Champaign

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

Keywords

Random walk
Regular trees
Spectrum

Access to Document

10.1214/21-EJP608

Cite this

@article{1cffc9950dba444496e696c6bf50f20d,

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

volume = "26",

journal = "Electronic Journal of Probability",

issn = "1083-6489",

}

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 - https://www.scopus.com/pages/publications/85104769090

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

Keywords

Access to Document

Other files and links

Fingerprint

Cite this