Related papers: The contact process on Scale-Free Percolation
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…
The voter model is a classical interacting particle system, modelling how global consensus is formed by local imitation. We analyse the time to consensus for a particular family of voter models when the underlying structure is a scale-free…
We study the locality of critical percolation on finite graphs: let $G_n$ be a sequence of finite graphs, converging locally weakly to a (random, rooted) infinite graph $G$. Consider Bernoulli edge percolation: does the critical probability…
In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs $(G_n)$. Let $\lambda_n$ be the largest eigenvalue of the adjacency matrix of $G_n$, and let $G_n(p_n)$ be the random subgraph of $G_n$ obtained…
If we consider the contact process with infection rate $\lambda$ on a random graph on $n$ vertices with power law degree distributions, mean field calculations suggest that the critical value $\lambda_c$ of the infection rate is positive if…
We are interested in the spread of an epidemic between two communities that have higher connectivity within than between them. We model the two communities as independent Erdos-Renyi random graphs, each with n vertices and edge probability…
We study the long range percolation model on $\mathbb{Z}$ where sites $i$ and $j$ are connected with probability $\beta |i-j|^{-s}$. Graph distances are now well understood for all exponents $s$ except in the case $s=2$ where the model…
We consider the contact process on a dynamic graph defined as a random $d$-regular graph with a stationary edge-switching dynamics. In this graph dynamics, independently of the contact process state, each pair $\{e_1,e_2\}$ of edges of the…
Recent progress in the study of the contact process [2] has verified that the extinction-survival threshold $\lambda_1$ on a Galton-Watson tree is strictly positive if and only if the offspring distribution $\xi$ has an exponential tail. In…
A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the…
One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the classical iid transmission time $L_{xy}$ is…
We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…
We study the contact process in the regime of small infection rates on finite scale-free networks with stationary dynamics based on simultaneous updating of all connections of a vertex. We allow the update rates of individual vertices to…
Many real-world networks exhibit the so-called small-world phenomenon: their typical distances are much smaller than their sizes. One mathematical model for this phenomenon is a long-range percolation graph on a $d$-dimensional box $\{0, 1,…
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent $\tau \in (2,3)$. It is well known…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
Percolation has two mean-field theories, the Gaussian fixed point (GFP) and the Landau mean-field theory or the complete graph (CG) asymptotics. By large-scale Monte Carlo simulations, we systematically study the interplay of the GFP and CG…
Consider the process where the $n$ vertices of a square $2$-dimensional torus appear consecutively in a random order. We show that typically the size of the $3$-core of the corresponding induced unit-distance graph transitions from $0$ to…
The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^\psi$ and the mean number of clusters with size $s$ per node follows a power function $n_s…
In this paper we study weighted distances in scale-free spatial network models: hyperbolic random graphs (HRG), geometric inhomogeneous random graphs (GIRG) and scale-free percolation (SFP). In HRGs, $n=\Theta(\mathrm{e}^{R/2})$ vertices…