210 citations · 786 across the 46 of their papers we have counts for
Showing 2004Show all
3 papers · 1 filter
math.PR2004★ 60 cited
Minimal spanning forests
Russell Lyons, Yuval Peres, Oded Schramm
Minimal spanning forests on infinite graphs are weak limits of minimal spanning trees from finite subgraphs. These limits can be taken with free or wired boundary conditions and ar…
math.PR2004★ 1 cited
Conceptual Proofs of L log L Criteria
Russell Lyons, Robin Pemantle, Yuval Peres
The Kesten-Stigum Theorem is a fundamental criterion for the rate of growth of a supercritical branching process, showing that an L log L condition is decisive. In critical and sub…
math.PR2004★ 2 cited
Random Walk in a Random Environment and First-Passage Percolation on Trees
Robin Pemantle, Russell Lyons
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the…