SearcharxivSearch

arXiv · math/0306402

Extra heads and invariant allocations

Abstract

Let Πbe an ergodic simple point process on R^d and let Π^* be its Palm version. Thorisson [Ann. Probab. 24 (1996) 2057-2064] proved that there exists a shift coupling of Πand Π^*; that is, one can select a (random) point Y of Πsuch that translating Πby -Y yields a configuration whose law is that of Π^*. We construct shift couplings in which Y and Π^* are functions of Π, and prove that there is no shift coupling in which Πis a function of Π^*. The key ingredient is a deterministic translation-invariant rule to allocate sets of equal volume (forming a partition of R^d) to the points of Π. The construction is based on the Gale-Shapley stable marriage algorithm [Amer. Math. Monthly 69 (1962) 9-15]. Next, let Γbe an ergodic random element of {0,1}^{Z^d} and let Γ^* be Γconditioned on Γ(0)=1. A shift coupling X of Γand Γ^* is called an extra head scheme. We show that there exists an extra head scheme which is a function of Γif and only if the marginal E[Γ(0)] is the reciprocal of an integer. When the law of Γis product measure and d\geq3, we prove that there exists an extra head scheme X satisfying E\exp c\|X\|^d<\infty; this answers a question of Holroyd and Liggett [Ann. Probab. 29 (2001) 1405-1425].

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander E. Holroyd, Yuval Peres. 2005-05-20. Extra heads and invariant allocations. https://doi.org/10.1214/009117904000000603

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR