• Publications
  • Influence
Choosing a Spanning Tree for the Integer Lattice Uniformly
Consider the nearest neighbor graph for the integer lattice Zd in d dimensions. For a large finite piece of it, consider choosing a spanning tree for that piece uniformly among all possible subgraphsExpand
  • 240
  • 57
  • PDF
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
  • 385
  • 42
  • PDF
Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-Impedances
Let G be a finite graph or an infinite graph on which Z^d acts with finite fundamental domain. If G is finite, let T be a random spanning tree chosen uniformly from all spanning trees of G; if G isExpand
  • 225
  • 28
  • PDF
Nonconvergence to Unstable Points in Urn Models and Stochastic Approximations
A particle in Rd moves in discrete time. The size of the nth step is of order 1/n and when the particle is at a position v the expectation of the next step is in the direction F(v) for some fixedExpand
  • 230
  • 24
A survey of random processes with reinforcement
The models surveyed include generalized Polya urns, reinforced random walks, interacting urn models, and continuous reinforced processes. Emphasis is on methods and results, with sketches providedExpand
  • 423
  • 23
  • PDF
Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure
We consider simple random walk on the family tree T of a nondegenerate supercritical Galton—Watson branching process and show that the resulting harmonic measure has a.s. strictly smaller HausdorffExpand
  • 172
  • 23
  • PDF
Random walk in a random environment and rst-passage percolation on trees
TLDR
A delay line refresh memory stores the bits to be displayed on a visual display means such as a television receiver. Expand
  • 79
  • 23
Towards a theory of negative dependence
The FKG theorem says that the positive lattice condition, an easily checkable hypothesis which holds for many natural families of events, implies positive association, a very useful property. ThusExpand
  • 161
  • 22
  • PDF
Biased random walks on Galton–Watson trees
Summary. We consider random walks with a bias toward the root on the family tree T of a supercritical Galton–Watson branching process and show that the speed is positive whenever the walk isExpand
  • 113
  • 20
  • PDF
First passage percolation and a model for competing spatial growth
An interacting particle system modelling competing growth on the ℤ 2 lattice is defined as follows. Each x ∈ ℤ 2 is in one of the states {0,1,2}. 1's and 2's remain in their states for ever, while aExpand
  • 91
  • 19
  • PDF