Random Walks and the Meeting Time for Trees
Andrew Beveridge, Ben Bridenbaugh, Ari Holcombe Pomerance

TL;DR
This paper analyzes the meeting time of random walks on trees, characterizing extremal structures that maximize or minimize the expected meeting time based on tree shape, order, and diameter.
Contribution
It provides a characterization of extremal tree structures for the meeting time of random walks, identifying the broom and double broom graphs as extremal cases.
Findings
Broom graph maximizes meeting time for fixed order and diameter.
Balanced double broom minimizes meeting time under certain conditions.
Explicit extremal structures depend on tree parameters.
Abstract
Consider a random walk on a tree . For , let the hitting time denote the expected number of steps required for the random walk started at to reach , and let denote the stationary distribution for the random walk. We characterize the extremal tree structures for the meeting time . For fixed order and diameter , the meeting time is maximized by the broom graph. The meeting time is minimized by the balanced double broom graph, or a slight variant, depending on the relative parities of and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
