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 Field	Value	Language
dc.contributor.author	Nestoridi, Evita	-
dc.contributor.author	Nguyen, Oanh	-
dc.date.accessioned	2022-01-25T14:53:07Z	-
dc.date.available	2022-01-25T14:53:07Z	-
dc.date.issued	2021	en_US
dc.identifier.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	en_US
dc.identifier.issn	1083-6489	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1xw47v8w	-
dc.description.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.	en_US
dc.language	English	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	ELECTRONIC JOURNAL OF PROBABILITY	en_US
dc.rights	Final published version. This is an open access article.	en_US
dc.title	The full spectrum of random walks on complete finite d-ary trees	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1214/21-EJP608	-
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
21-EJP608.pdf		254.44 kB	Adobe PDF	View/Download