R. Lyons

Publications149
h-index37
Citations5,860
Highly Influential Citations685
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • Y. Peres
  • 542 Publications • 16,888 Citations
  • O. Schramm
  • 125 Publications • 10,295 Citations
  • I. Benjamini
  • 236 Publications • 5,307 Citations
  • R. Pemantle
  • 181 Publications • 6,137 Citations
  • Publications
  • Influence
Processes on Unimodular Random Networks
We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs.… Expand
Probability on Trees and Networks
Starting around the late 1950s, several research communities began relating the geometry of graphs to stochastic processes on these graphs. This book, twenty years in the making, ties together… Expand
A Simple Path to Biggins’ Martingale Convergence for Branching Random Walk
We give a simple non-analytic proof of Biggins’ theorem on martingale convergence for branching random walks.
Conceptual proofs of L log L criteria for mean behavior of branching processes
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 subcritical cases,… Expand
Random Walks and Percolation on Trees
There is a way to define an average number of branches per vertex for an arbitrary infinite locally finite tree. It equals the exponential of the Hausdorff dimension of the boundary in an appropriate… Expand
Uniform spanning forests
We study uniform spanning forest measures on infinite graphs, which are weak limits of uniform spanning tree measures from finite subgraphs. These limits can be taken with free (FSF) or wired (WSF)… Expand
Determinantal probability measures
Determinantal point processes have arisen in diverse settings in recent years and have been investigated intensively. We study basic combinatorial and probabilistic aspects in the discrete case. Our… Expand
Indistinguishability of Percolation Clusters
We show that when percolation produces infinitely many infinite clusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that… Expand
Group-invariant Percolation on Graphs
Abstract. Let G be a closed group of automorphisms of a graph X. We relate geometric properties of G and X, such as amenability and unimodularity, to properties of G-invariant percolation processes… Expand
Random walk in a random environment and rst-passage percolation on trees
A delay line refresh memory stores the bits to be displayed on a visual display means such as a television receiver. A shift register in the feedback loop applies the stored bits back to the input… Expand
...
1
2
3
4
5
...