arXiv:1808.04261 Abstract | arXiv Analytics

arXiv:1808.04261 [math.CO]Abstract References Reviews Resources

On the Distribution of Range for Tree-Indexed Random Walks

Published 2018-08-13Version 1

We study tree-indexed random walks for spiders, trees with one vertex of degree greater than two. Our main result confirms a conjecture of Benjamini, H\"aggstr\"om, and Mossel for such graphs, namely that the distribution of the range for any such tree is dominated by that of a path on the same number of edges.

Comments: 6 Pages

Categories: math.CO

Subjects: 05C78, 05A16, 05C81, 82B41

Keywords: distribution, study tree-indexed random walks, main result confirms, degree greater, conjecture

Related articles: Most relevant | Search more

arXiv:math/0009230 [math.CO] (Published 2000-09-26)

The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m

Lev Glebsky, Gelasio Salazar

arXiv:math/0508537 [math.CO] (Published 2005-08-26)

On a conjecture of Widom

Alexei Borodin, Alexei Novikov

arXiv:math/0610977 [math.CO] (Published 2006-10-31)