Related papers: A discontinuous phase transition in the threshold-…
We consider the contact process on scale-free percolation, a spatial random graph model where the degree distribution of the vertices follows a power law with exponent $\beta$. We study the extinction time $\tau_{G_n}$ of the contact…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
Bootstrap percolation provides an emblematic instance of phase behavior characterised by an abrupt transition with diverging critical fluctuations. This unusual hybrid situation generally occurs in particle systems in which the occupation…
Following Bradonji\'c and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the $2$-dimensional torus. In this model, the expected number of vertices of the graph is $n$, and the expected degree of a…
It has been proposed (Phys. Rev. E {\bf 71}, 026121 (2005)) that unlike the short range contact process, a long-range counterpart may lead to the existence a discontinuous phase transition in one dimension. Aiming at exploring such link,…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
We study a two dimensional version of Neuhauser's long range sexual reproduction model and prove results that give bounds on the critical values $\lambda_f$ for the process to survive from a finite set and $\lambda_e$ for the existence of a…
We construct graphs (trees of bounded degree) on which the contact process has critical rate (which will be the same for both global and local survival) equal to any prescribed value between zero and $\lambda_c(\mathbb{Z})$, the critical…
We define a general model of stochastically-evolving graphs, namely the \emph{Edge-Uniform Stochastically-Evolving Graphs}. In this model, each possible edge of an underlying general static graph evolves independently being either alive or…
Due to their conceptual and mathematical simplicity, Erd\"os-R\'enyi or classical random graphs remain as a fundamental paradigm to model complex interacting systems in several areas. Although condensation phenomena have been widely…
Random directed graphs $D(n,p)$ undergo a phase transition around the point $p = 1/n$, and the width of the transition window has been known since the works of Luczak and Seierstad. They have established that as $n \to \infty$ when $p = (1…
Discontinuous percolation transitions and the associated tricritical points are manifest in a wide range of both equilibrium and non-equilibrium cooperative phenomena. To demonstrate this, we present and relate the continuous and first…
Realistic modeling of ecological population dynamics requires spatially explicit descriptions that can take into account spatial heterogeneity as well as long-distance dispersal. Here, we present Monte Carlo simulations and numerical…
We study the nonequilibrium phase transition in the two-dimensional contact process on a randomly diluted lattice by means of large-scale Monte-Carlo simulations for times up to $10^{10}$ and system sizes up to $8000 \times 8000$ sites. Our…
We extend a recent model of temporal random hyperbolic graphs by allowing connections and disconnections to persist across network snapshots with different probabilities, $\omega_1$ and $\omega_2$. This extension, while conceptually simple,…
We study a family of random permutation models on the Hamming graph $H(2,n)$ (i.e., the $2$-fold Cartesian product of complete graphs), containing the interchange process and the cycle-weighted interchange process with parameter $\theta >…
Diluted mean-field models are graphical models in which the geometry of interactions is determined by a sparse random graph or hypergraph. Based on a nonrigorous but analytic approach called the "cavity method", physicists have predicted…
We consider a threshold epidemic model on a clustered random graph with overlapping communities. In other words, our epidemic model is such that an individual becomes infected as soon as the proportion of her infected neighbors exceeds the…
We construct and analyze a random graph model for discrete choice with social interaction and several groups of equal size. We concentrate on the case of two groups of equal sizes and we allow the interaction strength within a group to…