Related papers: The contact process on the regular tree with rando…
The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or…
We consider the random wetting transition on the Cayley tree, i.e. the problem of a directed polymer on the Cayley tree in the presence of random energies along the left-most bonds. In the pure case, there exists a first-order transition…
We extend the results of B. Bollobas, O. Riordan, J. Spencer, G. Tusnady, and Mori. We consider a model of random tree growth, where at each time unit a new node is added and attached to an already existing node chosen at random. The…
In this paper, we introduce a type switching mechanism for the Contact Process on the lattice $\mathbb{Z}^d$. That is, we allow the individual particles/sites to switch between two (or more) types independently of one another, and the…
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…
It is known that the limiting behavior of the contact process strongly depends upon the geometry of the graph on which particles evolve: while the contact process on the regular lattice exhibits only two phases, the process on homogeneous…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We study survival and extinction of a long-range infection process on a diluted one-dimensional lattice in discrete time. The infection can spread to distant vertices according to a Pareto distribution, however spreading is also prohibited…
We propose a new perspective on the asymptotic regimes of fast and slow extinction in the contact process on locally converging sequences of sparse finite graphs. We characterise the phase boundary by the existence of a metastable density,…
We present high statistics simulations of weighted lattice bond animals and lattice trees on the square lattice, with fugacities for each non-bonded contact and for each bond between two neighbouring monomers. The simulations are performed…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
We study the asymptotic behavior of the critical density of the activated random walk model as the sleep rate $\lambda$ tends to $0$ and $\infty$. For large $\lambda$, we prove new lower bounds in dimensions 1 and 2, showing that in one…
The frog model is an infection process in which dormant particles begin moving and infecting others once they become infected. We show that on the rooted $d$-ary tree with particle density $\Omega(d^2)$, the set of visited sites contains a…
The challenges presented by the COVID-19 epidemic have created a renewed interest in the development of new methods to combat infectious diseases. A prominent property of the SARS-CoV-2 transmission is the significant fraction of…
Spreading from a seed is studied by Monte Carlo simulation on a square lattice with two types of sites affecting the rates of birth and death. These systems exhibit a critical transition between survival and extinction. For time- dependent…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
We study a continuous-time branching random walk on the lattice $\mathbb{Z}^{d}$, $d\in \mathbb{N}$, with a single source of branching, that is the lattice point where the birth and death of particles can occur. The random walk is assumed…
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…
A bootstrap percolation process on a graph with infection threshold $r\ge 1$ is a dissemination process that evolves in time steps. The process begins with a subset of infected vertices and in each subsequent step every uninfected vertex…
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…