SearcharxivSearch

arXiv · 1901.08578

Entropic repulsion for the occupation-time field of random interlacements conditioned on disconnection

Abstract

We investigate percolation of the vacant set of random interlacements on $\mathbb{Z}^d$, $d\geq 3$, in the strongly percolative regime. We consider the event that the interlacement set at level $u$ disconnects the discrete blow-up of a compact set $A\subseteq \mathbb{R}^d$ from the boundary of an enclosing box. We derive asymptotic large deviation upper bounds on the probability that the local averages of the occupation times deviate from a specific function depending on the harmonic potential of $A$, when disconnection occurs. If certain critical levels coincide, which is plausible but open at the moment, these bounds imply that conditionally on disconnection, the occupation-time profile undergoes an entropic push governed by a specific function depending on $A$. Similar entropic repulsion phenomena conditioned on disconnection by level-sets of the discrete Gaussian free field on $\mathbb{Z}^d$, $d \geq 3$, have been obtained by the authors in arxiv:1808.09947. Our proofs rely crucially on the `solidification estimates' developed in arXiv:1706.07229 by A.-S. Sznitman and the second author.

Explore related subjects

Keep this discovery

BibTeXRIS

Alberto Chiarini, Maximilian Nitzschner. 2019-01-24. Entropic repulsion for the occupation-time field of random interlacements conditioned on disconnection. https://doi.org/10.1214/19-aop1393

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