Skip to main content

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

Author(s): Nestoridi, Evita; Nguyen, Oanh

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1xw47v8w
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNestoridi, Evita-
dc.contributor.authorNguyen, Oanh-
dc.date.accessioned2022-01-25T14:53:07Z-
dc.date.available2022-01-25T14:53:07Z-
dc.date.issued2021en_US
dc.identifier.citationNestoridi, Evita, Nguyen, Oanh. (2021). The full spectrum of random walks on complete finite d-ary trees. ELECTRONIC JOURNAL OF PROBABILITY, 26 (10.1214/21-EJP608en_US
dc.identifier.issn1083-6489-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1xw47v8w-
dc.description.abstractIn 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.en_US
dc.languageEnglishen_US
dc.language.isoen_USen_US
dc.relation.ispartofELECTRONIC JOURNAL OF PROBABILITYen_US
dc.rightsFinal published version. This is an open access article.en_US
dc.titleThe full spectrum of random walks on complete finite d-ary treesen_US
dc.typeJournal Articleen_US
dc.identifier.doidoi:10.1214/21-EJP608-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
21-EJP608.pdf254.44 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.