Commute times of random walks on trees (Q1949106): Difference between revisions

A random weighted tree is considered in which every vertex at the same distance from the root has the same degree. The commute time is investigated for a random walk from the root to level n in the tree and back. Asymptotic results for large \(n\) are given when the random outdegree of each vertex is either 1 or 2 according to various probability distributions.