most citedUniform random spanning trees

14 citations · 29 across the 36 of their papers we have counts for

collaborators

36 papers

math.PR20051 cited

The Klee-Minty random edge chain moves with linear speed

Jozsef Balogh, Robin Pemantle

An infinite sequence of 0's and 1's evolves by flipping each~1 to a~0 exponentially at rate one. When a~1 flips, all bits to its right also flip. Starting from any configuration wi…

math.CO2004

Asymptotics of multivariate sequences, II: multiple points of the singular variety

Robin Pemantle, Mark Wilson

We consider a multivariate generating function F(z), whose coefficients are indexed by d-tuples of nonnegative integers: F(z) = sum_r a_r z^r where z^r denotes the product of z_j^{…

math.CO200410 cited

Irreducible compositions and the first return to the origin of a random walk

Edward A. Bender, Gregory F. Lawler, Robin Pemantle +1

Let be a pair of compositions of into positive parts. We say this pair is {\em irreducible} if there is no positive for…

math.PR2004

Time to absorption in discounted reinforcement models

Robin Pemantle, Brian Skyrms

Reinforcement schemes are a class of non-Markovian stochastic processes. Their non-Markovian nature allows them to model some kind of memory of the past. One subclass of such model…

math.PR2004

Network formation by reinforcement learning: the long and medium run

Robin Pemantle, Brian Skyrms

We investigate a simple stochastic model of social network formation by the process of reinforcement learning with discounting of the past. In the limit, for any value of the disco…

math.PR2004

A probabilistic model for the degree of the cancellation polynomial in Gosper's Algorithm

Robin Pemantle

Milenkovic and Compton in 2002 gave an analysis of the run time of Gosper's algorithm applied to a random input. The main part of this was an asymptotic analysis of the random degr…