Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Choosing a Spanning Tree for the Integer Lattice Uniformly

- R. Pemantle
- Mathematics
- 1 October 1991

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 subgraphs… Expand

Conceptual proofs of L log L criteria for mean behavior of branching processes

- R. Lyons, R. Pemantle, Y. Peres
- Mathematics
- 1 July 1995

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

A survey of random processes with reinforcement

- R. Pemantle
- Mathematics
- 2 October 2006

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 provided… Expand

Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-Impedances

- R. Burton, R. Pemantle
- Mathematics
- 1 July 1993

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 is… Expand

Nonconvergence to Unstable Points in Urn Models and Stochastic Approximations

- R. Pemantle
- Mathematics
- 1 April 1990

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 fixed… Expand

Random walk in a random environment and rst-passage percolation on trees

- R. Lyons, R. Pemantle
- Computer Science
- 2 April 2004

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

Towards a theory of negative dependence

- R. Pemantle
- Mathematics
- 3 March 2000

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. Thus… Expand

Vertex-reinforced random walk

- R. Pemantle
- Mathematics
- 1 March 1992

SummaryThis paper considers a class of non-Markovian discrete-time random processes on a finite state space {1,...,d}. The transition probabilities at each time are influenced by the number of times… Expand

Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure

- R. Lyons, R. Pemantle, Y. Peres
- MathematicsErgodic Theory and Dynamical Systems
- 1 June 1995

Abstract 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… Expand

Biased random walks on Galton–Watson trees

- R. Lyons, R. Pemantle, Y. Peres
- Mathematics
- 2 October 1996

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 is… Expand

...

1

2

3

4

5

...