Unimodular Random Trees

Fundamental domains for lattices in (R-)rank 1 1 semisimple Lie groups

Garland, H · 1970

Earlier work this paper cites.

Discrete Subgroups of Lie Groups

Raghunathan, M.S · 1972

Earlier work this paper cites.

An amenable equivalence relation is generated by a single transformation

Connes, A., Feldman, J., · 1982

Earlier work this paper cites.

Choosing a spanning tree for the integer lattice uniformly

Pemantle, R · 1991

Earlier work this paper cites.

Percolation perturbations in potential theory and random walks

Benjamini, I., Lyons, R., · 1997

Earlier work this paper cites.

Spectral analysis on infinite Sierpiński gaskets

Teplyaev, A · 1998

Earlier work this paper cites.

Group-invariant percolation on graphs

Benjamini, I., Lyons, R., Peres, Y., · 1999

Earlier work this paper cites.

Boundaries of hyperbolic groups

Kapovich, I · 2001

Earlier work this paper cites.

Uniform infinite planar triangulations

Angel, O · 2003

Cited alongside, same era.

Periodicity and circle packings of the hyperbolic plane

Bowen, L · 2003

Cited alongside, same era.

The objective method: probabilistic combinatorial optimization and local weak convergence

Aldous, D.J · 2004

Cited alongside, same era.

A lemma for cost attained

Hjorth, G · 2006

Cited alongside, same era.

The canopy graph and level statistics for random operators on trees

Aizenman, M · 2007

Cited alongside, same era.

Processes on unimodular random networks

Aldous, D.J · 2007

Cited alongside, same era.

A measurable-group-theoretic solution to von Neumann’s problem

Exponential tail bounds for loop-erased random walk in two dimensions

Barlow, M.T · 2010

Later among the works it cites.

On the limit of large girth graph sequences

Elek, G · 2010

Later among the works it cites.

Sofic equivalence relations

Elek, G · 2010

Later among the works it cites.

Sparse graphs: metrics and random models

Bollobás, B · 2011

Later among the works it cites.

Ergodic theory on stationary random graphs

Benjamini, I · 2012

Closest in time.

Large Networks and Graph Limits

Lovász, L · 2012

Closest in time.

Probability on Trees and Networks

Lyons, R · 2013

Closest in time.