English
Related papers

Related papers: The Contact Process on Trees

200 papers

In this paper we study the metastability of the contact process on a random regular graph. We show that the extinction time of the contact process, when initialized so that all vertices are infected at time 0, grows exponentially with the…

Probability · Mathematics 2015-03-18 Wei Su

In this paper we are concerned with the two-stage contact process introduced in \cite{Krone1999} on a high-dimensional lattice. By comparing this process with an auxiliary model which is a linear system, we obtain two limit theorems for…

Probability · Mathematics 2018-10-02 Xiaofeng Xue

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$,…

Probability · Mathematics 2022-09-30 Ercan Sönmez , Arnaud Rousselle

We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{\'e}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a…

Probability · Mathematics 2017-09-20 Van Hao Can

The Contact Process has been studied on complex networks exhibiting different kinds of quenched disorder. Numerical evidence is found for Griffiths phases and other rare region effects, in Erd\H os R\'enyi networks, leading rather…

Statistical Mechanics · Physics 2013-03-27 Géza Ódor

Consider the following interacting particle system on the $d$-ary tree, known as the frog model: Initially, one particle is awake at the root and i.i.d. Poisson many particles are sleeping at every other vertex. Particles that are awake…

Probability · Mathematics 2016-06-23 Christopher Hoffman , Tobias Johnson , Matthew Junge

Motivated by recent findings of enhanced species survival when fragmented habitats are reconnected through narrow strips of land [S. Pimm, and C. N. Jenkins, Am. Sci. {\bf 107}(3), 162 (2019).], we study the effect of a corridor connecting…

Statistical Mechanics · Physics 2022-01-03 I. Ibagon , A. P. Furlan , Ronald Dickman

Contact tracing can be thought of as a race between two processes: an infection process and a tracing process. In this paper, we study a simple model of infection spreading on a tree, and a tracer who stabilizes one node at a time. We focus…

Probability · Mathematics 2022-10-25 Michela Meister , Jon Kleinberg

We study survival properties of inhomogeneous Galton-Watson processes. We determine the so-called branching number (which is the reciprocal of the critical value for percolation) for these random trees (conditioned on being infinite), which…

Probability · Mathematics 2011-12-22 Erik Broman , Ronald Meester

We study competition between two growth models with long-range correlations on the torus $\mathbb T_n^d$ of size $n$ in dimension $d$. We append the edge set of the torus $\mathbb T_n^d$ by including all non-nearest-neighbour edges, and…

Probability · Mathematics 2025-10-20 Bas Lodewijks , Neeladri Maitra

For a two-dimensional lattice $\Lambda$ with $n$ vertices, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present exact integral expression and numerical value for…

Statistical Mechanics · Physics 2013-12-12 Shu-Chiuan Chang

We study a system of simple random walks on graphs, known as frog model. This model can be described as follows: There are active and sleeping particles living on some graph G. Each active particle performs a simple random walk with…

Probability · Mathematics 2019-03-05 O. S. M. Alves , F. P. Machado , S. Yu. Popov

We apply the theory of markov random fields on trees to derive a phase transition in the number of samples needed in order to reconstruct phylogenies. We consider the Cavender-Farris-Neyman model of evolution on trees, where all the inner…

Probability · Mathematics 2007-05-23 Elchanan Mossel

A bootstrap percolation process on a graph G is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round every uninfected node which has at least r infected neighbours…

Probability · Mathematics 2015-06-30 Hamed Amini , Nikolaos Fountoulakis , Konstantinos Panagiotou

Propagation of contagion in networks depends on the graph topology. This paper is concerned with studying the time-asymptotic behavior of the extended contact processes on static, undirected, finite-size networks. This is a contact process…

Physics and Society · Physics 2015-07-03 June Zhang , José M. F. Moura

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,…

Statistical Mechanics · Physics 2013-06-14 Carlos E. Fiore , Mário J. de Oliveira

In this paper, we prove lower and upper bounds for the extinction time of the contact process on random geometric graphs with connecting radius tending to infinity. We obtain that for any infection rate $\lambda >0$, the contact process on…

Probability · Mathematics 2017-07-20 Van Hao Can

We show that a certain model for the spread of an infection has a phase transition in the recuperation rate. The model is as follows: There are particles or individuals of type A and type B, interpreted as healthy and infected,…

Probability · Mathematics 2007-05-23 Harry Kesten , Vladas Sidoravicius

The renewal contact process is a non-Markovian variant of the classical contact process in which recoveries are governed by independent renewal processes with interarrival distribution $\mu$. We establish new sufficient conditions ensuring…

Probability · Mathematics 2026-05-29 Gustavo O. de Carvalho , Lucas R. de Lima

We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…

Probability · Mathematics 2007-05-23 S. Janson , R. Neininger