Abstract
Let Tn denote the binary tree of depth n augmented by an extra edge connected to its root. Let Cn denote the cover time of Tn by simple random walk. We prove that the sequence of random variables Cn 2−(n+1)−mn, where mn is an explicit constant, converges in distribution as n→∞, and identify the limit.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
