Related papers: Phase transition of the contact process on random …
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…
We study the frog model with death on the biregular tree $\mathbb{T}_{d_1,d_2}$. Initially, there is a random number of awake and sleeping particles located on the vertices of the tree. Each awake particle moves as a discrete-time…
We study the contact process on layered networks in which each layer is unidirectionally coupled to the next layer. Each layer has elements sitting on i) Erd{\"o}s-R{\'e}yni network, ii) a $d$-dimensional lattice. The layer at the top which…
We determine the phase diagrams of conservative diffusive contact processes by means of numerical simulations. These models are versions of the ordinary diffusive single-creation, pair-creation and triplet-creation contact processes in…
We study the SIRS process, a continuous-time Markov chain modeling the spread of infections on graphs. In this model, vertices are either susceptible, infected, or recovered. Each infected vertex becomes recovered at rate 1 and infects each…
The classical result of Erdos and Renyi shows that the random graph G(n,p) experiences sharp phase transition around p=1/n - for any \epsilon>0 and p=(1-\epsilon)/n, all connected components of G(n,p) are typically of size O(log n), while…
Suppose we are given finitely generated groups $\Gamma_1,...,\Gamma_m$ equipped with irreducible random walks. Thereby we assume that the expansions of the corresponding Green functions at their radii of convergence contain only logarithmic…
In the standard SIR model, infected vertices infect their neighbors at rate $\lambda$ independently across each edge. They also recover at rate $\gamma$. In this work we consider the SIR-$\omega$ model where the graph structure itself…
In this article, we introduce a contact process with aging: in this generalization of the classical contact process, each particle has an integer age that influences its ability to give birth. We prove here a shape theorem for this process…
The extinction transition in the presence of a localized quenched defect is studied numerically. When the bulk is at criticality, the correlation length diverges and even an infinite system cannot "decouple" from the defect. The results…
In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…
In a recent work, a new numerical method (the lifespan method) has been introduced to study the critical properties of epidemic processes on complex networks [Phys. Rev. Lett. \textbf{111}, 068701 (2013)]. Here, we present a detailed…
In the present paper, we study the relation between criticality and information transmission in the one-dimensional contact process with infection parameter $\lambda .$ To do this we define the {\it sensitivity} of the process to its…
We study a system of simple random walks on $\mathcal{T}_{d,n} = \mathcal{V}_{d,n}, \mathcal{E}_{d,n})$, the $d$-ary tree of depth $n$, known as the frog model. Initially there are Pois($\lambda$) particles at each site, independently, with…
The spread of infectious disease in a human community or the proliferation of fake news on social media can be modeled as a randomly growing tree-shaped graph. The history of the random growth process is often unobserved but contains…
In the Gaussian sequence model $Y= \theta_0 + \varepsilon$ in $\mathbb{R}^n$, we study the fundamental limit of approximating the signal $\theta_0$ by a class $\Theta(d,d_0,k)$ of (generalized) splines with free knots. Here $d$ is the…
The long-time dynamics of the 1D contact process suddenly brought out of an uncorrelated initial state is studied through a light-cone transfer-matrix renormalisation group approach. At criticality, the system undergoes ageing which is…
We study a stochastic model of infection spreading on a network. At each time step a node is chosen at random, along with one of its neighbors. If the node is infected and the neighbor is susceptible, the neighbor becomes infected. How many…
The $\lambda$-biased random walk on a binary tree of depth $n$ is the continuous-time Markov chain that has unit mean holding times and, when at a vertex other than the root or a leaf of the tree in question, has a probability of jumping to…
We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…