Related papers: The contact process on Scale-Free Percolation

Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…

We consider supercritical long-range percolation on transitive graphs of polynomial growth. In this model, any two vertices $x$ and $y$ of the underlying graph $G$ connect by a direct edge with probability $1-\exp(-\beta J(x,y))$, where…

We investigate the weighted scale-free percolation (SFPW) model on $\mathbb Z^d$. In the SFPW model, the vertices of $\mathbb Z^d$ are assigned i.i.d. weights $(W_x)_{x\in \mathbb Z^d}$, following a power-law distribution with tail exponent…

Scale-free networks with topology-dependent interactions are studied. It is shown that the universality classes of critical behavior, which conventionally depend only on topology, can also be explored by tuning the interactions. A mapping,…

We provide a new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model. The proof applies to infinite range models on arbitrary locally finite transitive infinite graphs. For Bernoulli percolation, we…

Series expansion methods are used to study directed bond percolation clusters on the square lattice whose lateral growth is restricted by a wall parallel to the growth direction. The percolation threshold $p_c$ is found to be the same as…

We consider the discrete-time threshold-$\theta \ge 2$ contact process on a random r-regular graph on n vertices. In this process, a vertex with at least \theta occupied neighbors at time t will be occupied at time t+1 with probability p,…

We study the stationary distribution of the (spread-out) $d$-dimensional contact process from the point of view of site percolation. In this process, vertices of $\mathbb{Z}^d$ can be healthy (state 0) or infected (state 1). With rate one…

We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…

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…

We consider the super-critical contact process on $\mathbb{Z}^d$. It is known that measures which dominate the upper invariant measure $\mu$ converge exponentially fast to $\mu$. However, the same is not true for measures which are below…

Let $(G_n) = \left((V_n,E_n)\right)$ be a sequence of finite connected vertex-transitive graphs with uniformly bounded vertex degrees such that $\lvert V_n \rvert \to \infty$ as $n \to \infty$. We say that percolation on $G_n$ has a sharp…

We study independent long-range percolation on $\mathbb{Z}^d$ where the vertices $u$ and $v$ are connected with probability asymptotic to $\frac{\beta}{\|u-v\|^{2d}}$ for $\|u-v\|_\infty\geq 2$ and with probability 1 for $\|u-v\|_\infty=1$,…

Rigidity Percolation with g degrees of freedom per site is analyzed on randomly diluted Erdos-Renyi graphs with average connectivity gamma, in the presence of a field h. In the (gamma,h) plane, the rigid and flexible phases are separated by…

We investigate spatial random graphs defined on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the…

In this Letter, we show that the explosive percolation is a novel continuous phase transition. The order-parameter-distribution histogram at the percolation threshold is studied in Erd\H{o}s-R\'{e}nyi networks, scale-free networks, and…

We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…

Liggett and Steif (2006) proved that, for the supercritical contact process on certain graphs, the upper invariant measure stochastically dominates an i.i.d.\ Bernoulli product measure. In particular, they proved this for $\mathbb{Z}^d$ and…

In this paper we study random graphs with independent and identically distributed degrees of which the tail of the distribution function is regularly varying with exponent $\tau\in (2,3)$. The number of edges between two arbitrary nodes,…

In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one non-trivial length-scale in the model, analogous to the…