SearcharxivSearch

arXiv · 2608.17073

Near-critical percolation with sparse reinforcements

Abstract

We study the effect of sparse random reinforcement on near-critical Bernoulli site percolation on the first quadrant of the square lattice. The reinforcement is generated by randomly selecting horizontal and vertical lines and increasing the opening probability $p$ only at their intersections, so that the reinforcement is supported on a sparse set of points with long-range dependence. We determine how the geometry of this random set influences the phase transition. We first investigate whether the reinforcement lowers the critical threshold. When the spacings between consecutive selected lines are geometric, we prove that, for every $p$ above the critical threshold, percolation occurs even if the opening probability $q$ outside the reinforcement is strictly below criticality. In contrast, if the spacings in one direction decay slower than exponentially while those in the other are geometric, then no threshold shift occurs: percolation is impossible for $q$ below the critical threshold, regardless of $p$. We next study the critical case $q=p_c$. We show that sufficiently high moments of the spacing distributions imply percolation at criticality, whereas the absence of a fractional moment of order $\alpha\in(0,1)$ rules it out. Both regimes remain unchanged after an additional independent thinning of the reinforced vertices. Thus, reinforcement supported on random intersections may either lower the critical threshold or leave it unchanged while fundamentally altering the nature of the phase transition.

Explore related subjects

Keep this discovery

BibTeXRIS

Estevão Borel, Marcos Sá, Rémy Sanchis, Roger W. C. Silva. 2026-08-17. Near-critical percolation with sparse reinforcements. https://arxiv.org/abs/2608.17073

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