English
Related papers

Related papers: Exponential rate for the contact process extinctio…

200 papers

The key to our investigation is an improved (and in a sense sharp) understanding of the survival time of the contact process on star graphs. Using these results, we show that for the contact process on Galton-Watson trees, when the…

Probability · Mathematics 2019-07-31 Xiangying Huang , Rick Durrett

We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…

Probability · Mathematics 2023-05-17 Daniel Contreras , Sébastien Martineau , Vincent Tassion

In this paper we are concerned with contact process with random recovery rates on open clusters of bond percolation on $\mathbb{Z}^d$. Let $\xi$ be a positive random variable, then we assigned i. i. d. copies of $\xi$ on the vertices as the…

Probability · Mathematics 2016-04-26 Xiaofeng Xue

We study the extinction of epidemics in a generalized susceptible-infected-susceptible model, where a susceptible individual becomes infected with the rate $\lambda$ when contacting $m$ infective individual(s) simultaneously, and an…

Populations and Evolution · Quantitative Biology 2019-08-08 Hanshuang Chen , Feng Huang , Haifeng Zhang , Guofeng Li

We investigate the contact process on four different types of scale-free inhomogeneous random graphs evolving according to a stationary dynamics, where each potential edge is updated with a rate depending on the strength of the adjacent…

Probability · Mathematics 2022-06-03 Emmanuel Jacob , Amitai Linker , Peter Mörters

We analyze variants of the contact process that are built by modifying the percolative structure given by the graphical construction and develop a robust renormalization argument for proving extinction in such models. With this method, we…

Probability · Mathematics 2026-02-02 Marcelo Hilário , Daniel Ungaretti , Daniel Valesin , Maria Eulália Vares

In this paper we are concerned with contact processes with random edge weights on rooted regular trees. We assign i.i.d weights on each edge on the tree and assume that an infected vertex infects its healthy neighbor at rate proportional to…

Probability · Mathematics 2016-08-03 Xiaofeng Xue

In this paper we are concerned with the contact process on the squared lattice. The contact process intuitively describes the spread of the infectious disease on a graph, where an infectious vertex becomes healthy at a constant rate while a…

Probability · Mathematics 2017-01-04 Xiaofeng Xue

This paper gives a new, simple proof of the known fact that for contact processes on general lattices, in the subcritical regime the expected number of infected sites decays exponentially fast as time tends to infinity. The proof also…

Probability · Mathematics 2016-09-08 Jan M. Swart

We model an epidemic where the per-person infectiousness in a network of geographic localities changes with the total number of active cases. This would happen as people adopt more stringent non-pharmaceutical precautions when the…

Social and Information Networks · Computer Science 2021-12-07 Akhil Bhimaraju , Avhishek Chatterjee , Lav R. Varshney

One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…

Probability · Mathematics 2018-12-05 Alexey Medvedev , Gábor Pete

In the Susceptible-Infectious-Recovered (SIR) model of disease spreading, the time to extinction of the epidemics happens at an intermediate value of the per-contact transmission probability. Too contagious infections burn out fast in the…

Populations and Evolution · Quantitative Biology 2014-03-05 Petter Holme

We consider the contact process on a random graph with fixed degree distribution given by a power law. We follow the work of Chatterjee and Durrett, who showed that for arbitrarily small infection parameter $\lambda$, the survival time of…

Probability · Mathematics 2012-12-10 Thomas Mountford , Daniel Valesin , Qiang Yao

We consider a dynamical process on a graph $G$, in which vertices are infected (randomly) at a rate which depends on the number of their neighbours that are already infected. This model includes bootstrap percolation and first-passage…

Probability · Mathematics 2018-05-18 Béla Bollobás , Simon Griffiths , Robert Morris , Leonardo Rolla , Paul Smith

We give a construction of a tree in which the contact process with any positive infection rate survives but, if a certain privileged edge $e^*$ is removed, one obtains two subtrees in which the contact process with infection rate smaller…

Probability · Mathematics 2016-01-26 Réka Szabó , Daniel Valesin

We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…

Statistical Mechanics · Physics 2015-05-13 R. Juhász , G. Ódor

We extend previous work of max-linear models on finite directed acyclic graphs to infinite graphs as well as random graphs, and investigate their relations to classical percolation theory, more particularly the impact of Bernoulli bond…

Probability · Mathematics 2022-06-27 Claudia Klüppelberg , Ercan Sönmez

In this paper we study threshold-one contact processes on lattices and regular trees. The asymptotic behavior of the critical infection rates as the degrees of the graphs growing to infinity are obtained. Defining \lambda_c as the supremum…

Probability · Mathematics 2013-12-02 Xiaofeng Xue

We consider a random walk on top of the contact process on $\mathbb{Z}^d$ with $d\geq 1$. In particular, we focus on the "contact process as seen from the random walk". Under the assumption that the infection rate of the contact process is…

Probability · Mathematics 2016-07-13 Stein Andreas Bethuelsen

We study the contact process on a class of evolving scale-free networks, where each node updates its connections at independent random times. We give a rigorous mathematical proof that there is a transition between a phase where for all…

Probability · Mathematics 2015-12-03 Emmanuel Jacob , Peter Mörters