Search arXivSearch

arXiv · 1603.05322

Stein's method for positively associated random variables with applications to the Ising and voter models, bond percolation, and contact process

Abstract

We provide non-asymptotic $L^1$ bounds to the normal for four well-known models in statistical physics and particle systems in $\mathbb{Z}^d$; the ferromagnetic nearest-neighbor Ising model, the supercritical bond percolation model, the voter model and the contact process. In the Ising model, we obtain an $L^1$ distance bound between the total magnetization and the normal distribution at any temperature when the magnetic moment parameter is nonzero, and when the inverse temperature is below critical and the magnetic moment parameter is zero. In the percolation model we obtain such a bound for the total number of points in a finite region belonging to an infinite cluster in dimensions $d \ge 2$, in the voter model for the occupation time of the origin in dimensions $d \ge 7$, and for finite time integrals of non-constant increasing cylindrical functions evaluated on the one dimensional supercritical contact process started in its unique invariant distribution. The tool developed for these purposes is a version of Stein's method adapted to positively associated random variables. In one dimension, letting $\boldsymbolξ=(ξ_1,\ldots,ξ_m)$ be a positively associated mean zero random vector with components that obey the bound $|ξ_i| \le B, i=1,\ldots,m$, and whose sum $W = \sum_{i=1}^m ξ_i$ has variance 1, it holds that $$ d_1 \left(\mathcal{L}(W),\mathcal{L}(Z) \right) \leq 5B + \sqrt{\frac{8}π}\sum_{i \neq j} \mathbb{E}[ξ_i ξ_j] $$ where $Z$ has the standard normal distribution and $d_1(\cdot,\cdot)$ is the $L^1$ metric. Our methods apply in the multidimensional case with the $L^1$ metric replaced by a smooth function metric.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Larry Goldstein, Nathakhun Wiroonsri. 2017-09-07. Stein's method for positively associated random variables with applications to the Ising and voter models, bond percolation, and contact process. https://doi.org/10.1214/16-aihp808

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

KEEP EXPLORING

Related papers

Villani's conjecture for Kac's walk

We prove Villani's conjecture on entropy production for Kac's walk with uniform collision angles. For every $N\geq2$, with total collision rate $N$, the optimal entropy production constant is $2/(N-1)$. We show that the known lower bound is sharp by constructing two families of smooth strictly positive probability densities, invariant under coordinate permutations and sign changes. The first consists of normalized products of inverse powers; the second is obtained by conditioning products of Gaussian mixtures on the energy sphere. With $N$ fixed, we compute the leading terms of entropy and entropy production. Successive parameter limits yield two independent proofs of sharpness.

math.PR

Scaling limit and tail bounds for a random walk model of SOS level lines

This paper analyzes a random walk model for the level lines appearing in the entropic repulsion phenomena of three-dimensional discrete random interfaces above a hard wall; we are particularly motivated by the low-temperature (2+1)D solid-on-solid (SOS) model, where the emergence of these level lines has been rigorously established. The model we consider is a line ensemble of non-crossing random walk bridges above a wall with geometrically growing area tilts. Our main result, which in particular resolves a question of Caputo, Ioffe, and Wachtel (2019), is an edge 1:2:3 scaling limit for this ensemble as the domain size diverges, with a growing number of walks (including the number of level lines of the SOS model) and high boundary conditions (covering the maximum upper deviation of the SOS level lines). As a key input, we establish Tracy--Widom-type upper tail bounds for each of the relevant curves in the line ensemble. An ingredient which may be of independent interest is a ballot theorem for random walk bridges under a broader range of boundary values than available in the literature.

math.PR

One-dimensional particle clouds with elastic collisions

We study an interacting particle system of a finite number of labelled particles on the integer lattice, in which particles have intrinsic masses and left/right jump rates. If a particle is the minimal-label particle at its site when it tries to jump left, the jump is executed. If not, 'momentum' is transferred to increase the rate of jumping left of the minimal-label particle. Similarly for jumps to the right. The collision rule is 'elastic' in the sense that the net rate of flow of mass is independent of the present configuration, in contrast to the exclusion process, for example. We show that the particle masses and jump rates determine explicitly, via a concave majorant of a simple `potential' function associated to the masses and jump rates, a unique partition of the system into maximal stable subsystems. The internal configuration of each stable subsystem remains tight, while the location of each stable subsystem obeys a strong law of large numbers with an explicit speed. We indicate connections to adjacent models, including diffusions with rank-based coefficients, where, to the authors' knowledge, the problem of identifying the analogous decomposition into stable sub-systems is yet to be fully solved.

math.PR