Search arXivSearch

arXiv · 2009.00601

Excess deviations for points disconnected by random interlacements

Abstract

We consider random interlacements on $ \mathbb{Z}^d$, $d \ge 3$, when their vacant set is in a strongly percolative regime. Given a large box centered at the origin, we establish an asymptotic upper bound on the exponential rate of decay of the probability that the box contains an excessive fraction $ν$ of points that are disconnected by random interlacements from the boundary of a concentric box of double size. As an application we show that when $ν$ is not too large, this asymptotic upper bound matches the asymptotic lower bound derived in a previous work of the author, and the exponential rate of decay is governed by a certain variational problem in the continuum which involves the percolation function of the vacant set of random interlacements.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alain-Sol Sznitman. 2021-06-08. Excess deviations for points disconnected by random interlacements. https://doi.org/10.2140/pmp.2021.2.563

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

KEEP EXPLORING

Related papers

Hermite trace polynomials and chaos decompositions for the Hermitian Brownian motion

For a non-zero parameter $q$, we define Hermite trace polynomials, which are multivariate polynomials indexed by permutations. We prove several combinatorial properties for them, such as expansions and product formulas. The linear functional determined by these trace polynomials is a state for $q = \frac{1}{N}$ for $N$ a non-zero integer. For such $q$, Hermite trace polynomials of different degrees are orthogonal. The product formulas extend to the closure with respect to the state. The state can be identified with the expectation induced by the $N \times N$ Hermitian Brownian motion. Hermite trace polynomials are martingales for this Brownian motion, while the elements in the closure can be interpreted as stochastic integrals with respect to it. Using the grading on the algebra, we prove several chaos decompositions for such integrals, as well as analyze corresponding creation and annihilation operators. In the univariate, pure trace polynomial case, trace Hermite polynomials can be identified with the Hermite polynomials of matrix argument.

math.PR

Coupling and Maximal Inequalities for Graph-Dependent Empirical Processes

We develop maximal inequalities for empirical processes indexed by graph-dependent observations. Our bounds separate the complexity of the indexing class from two features specific to graph dependence: the geometry of the underlying graph and the cost of coupling graph-separated blocks to independent copies. The coupling construction combines a novel graph-adapted dependence coefficient with a coloring of a block partition. As an application, we derive Glivenko--Cantelli results and characterize the associated effective sample size. A central implication is that graph-dependent empirical processes need not exhibit a generic root-$n$ rate: convergence is jointly determined by function-class complexity, graph geometry, and the decay of dependence with graph distance. We specialize the results to graphs with polynomial and exponential growth and to directed dyadic graphs. Finally, we apply the results to network autoregressive models, nonlinear local-propagation models, and treatment-interference settings.

math.PR