14 citations · 29 across the 35 of their papers we have counts for
35 papers · 1 filter
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…
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…
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…
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…
Cycles in random k-ary maps and the poor performance of random random number generation
Robin Pemantle
Knuth shows that iterations of a random function perform poorly on average as a random number generator. He proposes a generalization in which the next value depends on two or more…
A Dynamic Model of Social Network Formation
Brian Skyrms, Robin Pemantle
We consider a dynamic social network model in which agents play repeated games in pairings determined by a stochastically evolving social network. Individual agents begin to intera…