SearcharxivSearch

arXiv · 2302.05396

Existence of subcritical percolation phases for generalised weight-dependent random connection models

Abstract

We derive a sufficient condition for the existence of a subcritical percolation phase for a wide range of continuum percolation models where each vertex is embedded into Euclidean space according to an iid-marked stationary Poisson point process. In contrast to many established models, the probability of existence of an edge may not only depend on the distance and the weights of its end vertices but also on a surrounding vertex set. Our results can be applied in particular to models combining heavy-tailed degree distributions and long-range effects, which are typically well connected. More precisely, we study the critical annulus-crossing intensity $\widehat{\lambda}_c$ which is smaller or equal to the classical critical percolation intensity $\lambda_c$ and derive sharp conditions for $\widehat{\lambda}_c>0$ by controlling the occurrence of long edges. We further present tail bounds for the Euclidean diameter and number of points of the typical cluster in the subcritical phase and apply our results to several examples including some in which $\widehat{\lambda}_c<\lambda_c$.

Explore related subjects

Keep this discovery

BibTeXRIS

Benedikt Jahnel, Lukas Lüchtrath. 2023-02-10. Existence of subcritical percolation phases for generalised weight-dependent random connection models. https://arxiv.org/abs/2302.05396

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