SearcharxivSearch

arXiv · 2501.16858

Phase transitions for contact processes on one-dimensional networks

Abstract

We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts and augments the nearest-neighbour lattice by additional long-range edges. We provide sufficient conditions that imply the existence of a subcritical phase and therefore the non-triviality of the phase transition. Our results apply to instances of scale-free random geometric graphs with any integrable degree distribution. The present work complements previously developed techniques to establish the existence of a subcritical phase on Poisson--Gilbert graphs and Poisson--Delaunay triangulations (M\'enard et al., Ann. Sci. \'Ec. Norm. Sup\'er., 2016), on Galton--Watson trees (Bhamidi et al., Ann. Probab., 2021) and on locally tree-like random graphs (Nam et al., Trans. Am. Math. Soc., 2022), all of which require exponential decay of the degree distribution. Two applications of our approach are particularly noteworthy: Firstly, for Gilbert graphs derived from stationary point processes on $\mathbb{R}$ marked with i.i.d. random radii, our results are sharp. We show that there is a non-trivial phase transition if and only if the graph is locally finite. Secondly, for independent Bernoulli long-range percolation on $\mathbb{Z}$, with coupling constants $J_{x,y}\asymp |x-y|^{-\delta}$, we verify a conjecture of Can (Electron. Commun. Probab., 2015) stating the non-triviality of the phase transition whenever $\delta>2$. We believe that the results are indicative of the behaviour of contact processes on spatial random graphs also in dimensions $d > 1$ as long as the degree distribution of the underlying network has at least finite $d$-th moment. We support this by proving that no phase transition exists if the $d$-th moment is infinite.

Explore related subjects

Keep this discovery

BibTeXRIS

Benedikt Jahnel, Lukas Lüchtrath, Christian Mönch. 2025-01-28. Phase transitions for contact processes on one-dimensional networks. https://arxiv.org/abs/2501.16858

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