arXiv subjects

Christopher Hoffman

Publications and source records attributed to Christopher Hoffman.

44 records · Page 3Linked to original sources

arXiv2006

A stable marriage of Poisson and Lebesgue

Let $Ξ$ be a discrete set in ${\mathbb{R}}^d$. Call the elements of $Ξ$ centers. The well-known Voronoi tessellation partitions ${\mathbb{R}}^d$ into polyhedral regions (of varying sizes) by allocating each site of ${\mathbb{R}}^d$ to the closest center. Here we study ``fair'' allocations of ${\mathbb{R}}^d$ to $Ξ$ in which the regions allocated to different centers have equal volumes. We prove that if $Ξ$ is obtained from a translation-invariant point process, then there is a unique fair allocation which is stable in the sense of the Gale--Shapley marriage problem. (I.e., sites and centers both prefer to be allocated as close as possible, and an allocation is said to be unstable if some site and center both prefer each other over their current allocations.) We show that the region allocated to each center $ξ$ is a union of finitely many bounded connected sets. However, in the case of a Poisson process, an infinite volume of sites are allocated to centers further away than $ξ$. We prove power law lower bounds on the allocation distance of a typical site. It is an open problem to prove any upper bound in $d>1$.

math.PR↗

arXiv2006

A special set of exceptional times for dynamical random walk on $\Z^2$

Benjamini,Haggstrom, Peres and Steif introduced the model of dynamical random walk on Z^d. This is a continuum of random walks indexed by a parameter t. They proved that for d=3,4 there almost surely exist t such that the random walk at time t visits the origin infinitely often, but for d > 4 there almost surely do not exist such t. Hoffman showed that for d=2 there almost surely exists t such that the random walk at time t visits the origin only finitely many times. We refine the results of Hoffman for dynamical random walk on Z^2, showing that with probability one there are times when the origin is visited only a finite number of times while other points are visited infinitely often.

math.PR↗

arXiv2005

Tail Bounds for the Stable Marriage of Poisson and Lebesgue

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 site of R^d to the closest center. Here we study allocations of R^d to Ξin which each center attempts to claim a region of equal volume α. We focus on the case where Ξarises from a Poisson process of unit intensity. It was proved in math.PR/0505668 that there is a unique allocation which is stable in the sense of the Gale-Shapley marriage problem. We study the distance X from a typical site to its allocated center in the stable allocation. The model exhibits a phase transition in the appetite α. In the critical case α=1 we prove a power law upper bound on X in dimension d=1. It is an open problem to prove any upper bound in d\geq 2. (Power law lower bounds were proved in math.PR/0505668 for all d). In the non-critical cases α<1 and α>1 we prove exponential upper bounds on X.

math.PR↗

arXiv2005

Recurrence of Simple Random Walk on $Z^2$ is Dynamically Sensitive

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 or d=4 then there is an exceptional set of t such that {S_n(t)} returns to the origin infinitely often. In this paper we consider a dynamical random walk on Z^2. We show that with probability one there exists t such that {S_n(t)} never returns to the origin. This exceptional set of times has dimension one. This proves a conjecture of Benjamini et. al.

math.PR↗

arXiv2005

Nonuniqueness for specifications in $\ell^{2+ε}$

For every $p>2$, we construct a regular and continuous specification ($g$-function), which has a variation sequence that is in $l^p$ and which admits multiple Gibbs measures. Combined with a recent result of Johansson and Oberg, this determines the optimal modulus of continuity for a specification which admits multiple Gibbs measures.

math.PR↗

arXiv2004

Uniform endomorphisms which are isomorphic to a Bernoulli shift

A {\it uniformly $p$-to-one endomorphism} is a measure-preserving map with entropy log $p$ which is almost everywhere $p$-to-one and for which the conditional expectation of each preimage is precisely $1/p$. The {\it standard} example of this is a one-sided $p$-shift with uniform i.i.d. Bernoulli measure. We give a characterization of those uniformly finite-to-one endomorphisms conjugate to this standard example by a condition on the past tree of names which is analogous to {\it very weakly Bernoulli} or {\it loosely Bernoulli.} As a consequence we show that a large class of isometric extensions of the standard example are conjugate to it.

math.DS↗

arXiv2004

Coexistence for Richardson type competing spatial growth models

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 states forever, while vertices in state 0 which are adjacent to a vertex in state 1 (or state 2) can switch to state 1 (or state 2). We think of the vertices in states 1 and 2 as infected with one of two infections while the vertices in state 0 are considered uninfected. In this way these models are variants of the Richardson model. We start the models with a single vertex in state 1 and a single vertex is in state 2. We show that with positive probability state 1 reaches an infinite number of vertices and state 2 also reaches an infinite number of vertices. This extends results and proves a conjecture of Haggstrom and Pemantle. The key tool is applying the ergodic theorem to stationary first passage percolation.

math.PR↗

arXiv2002

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

Consider the following method of card shuffling. Start with a deck of $N$ cards numbered 1 through N. Fix a parameter $p$ between 0 and 1. In this model a ``shuffle'' consists of uniformly selecting a pair of adjacent cards and then flipping a coin that is heads with probability p. If the coin comes up heads then we arrange the two cards so that the lower numbered card comes before the higher numbered card. If the coin comes up tails then we arrange the cards with the higher numbered card first. In this paper we prove that for all p not equal to 1/2, the mixing time of this card shuffling is O(N^2), as conjectured by Diaconis and Ram [DR]. A novel feature of our proof is that the analysis of an infinite (asymmetric exclusion) process plays an essential role in bounding the mixing time of a finite process.

math.PR↗