activity
20022005
most citedA stable marriage of Poisson and Lebesgue

55 citations · 57 across the 9 of their papers we have counts for

collaborators
Showing math.PRShow all

6 papers · 1 filter

math.PR2005

Tail Bounds for the Stable Marriage of Poisson and Lebesgue

Christopher Hoffman, Alexander E. Holroyd, Yuval Peres

Let Ξbe a discrete set in R^d. Call the elements of Ξcenters. The well-known Voronoi tessellation partitions R^d into polyhedral regions (of varying volumes) by allocating each sit…

math.PR200555 cited

A stable marriage of Poisson and Lebesgue

Christopher Hoffman, Alexander E. Holroyd, Yuval Peres

Let be a discrete set in . Call the elements of centers. The well-known Voronoi tessellation partitions into polyhedral regions (of varying…

math.PR20052 cited

Recurrence of Simple Random Walk on is Dynamically Sensitive

Christopher Hoffman

Benjamini, Haggstrom, Peres and Steif introduced the concept of a dynamical random walk. This is a continuous family of random walks, {S_n(t)}. Benjamini et. al. proved that if d=3…

math.PR2004

Coexistence for Richardson type competing spatial growth models

Christopher Hoffman

We study a large family of competing spatial growth models. In these the vertices in Z^d can take on three possible states {0,1,2}. Vertices in states 1 and 2 remain in their state…

math.PR2003

Nonuniqueness for specifications in

Noam Berger, Christopher Hoffman, Vladas Sidoravicius

For every , we construct a regular and continuous specification (-function), which has a variation sequence that is in and which admits multiple Gibbs measures. Combi…

math.PR2002

Mixing times of the biased card shuffling and the asymmetric exclusion process

Itai Benjamini, Noam Berger, Christopher Hoffman +1

Consider the following method of card shuffling. Start with a deck of cards numbered 1 through N. Fix a parameter between 0 and 1. In this model a ``shuffle'' consists of u…