Results on the contact process with dynamic edges or under renewals
Universidade Federal de Minas Gerais（米纳斯吉拉斯联邦大学）；Universidade de São Paulo（圣保罗大学）；University of Groningen（格罗宁根大学）；Universidade Federal do Rio de Janeiro（里约热内卢联邦大学）
Marcelo Hilário, Daniel Ungaretti, Daniel Valesin, Maria Eulália Vares
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 obtain results on the phase diagram of two models: the Contact Process on Dynamic Edges introduced by Linker and Remenik and a generalization of the Renewal Contact Process introduced by Fontes, Marchetti, Mountford and Vares.
Motivated by questions regarding long range percolation, we investigate a non-Markovian analogue of the Harris contact process in $\mathbb{Z}^d$: an individual is attached to each site $x \in \mathbb{Z}^d$, and it can be infected or healthy; the infection propagates to healthy neighbors just as in the usual contact process, according to independent exponential times with a fixed rate $λ$; nevertheless, the possible recovery times for an individual are given by the points of a renewal process with heavy tail; the renewal processes are assumed to be independent for different sites. We show that …
We continue the study of renewal contact processes initiated in a companion paper, where we showed that if the tail of the interarrival distribution $μ$ is heavier than $t^{-α}$ for some $α<1$ (plus auxiliary regularity conditions) then the critical value vanishes. In this paper we show that if $μ$ has decreasing hazard rate and tail bounded by $t^{-α}$ with $α>1$, then the critical value is positive in the one-dimensional case. A more robust and much simpler argument shows that the critical value is positive in any dimension whenever the interarrival distribution has a finite second moment.
We show that the critical value for the contact process on a vertex-transitive graph G with finitely many edges added and/or removed is the same as the critical value for the contact process on G.
We study the contact process with stirring on $\mathbb{Z}^d$. In this process, particles occupy vertices of $\mathbb{Z}^d$; each particle dies with rate 1 and generates a new particle at a randomly chosen neighboring vertex with rate $λ$, provided the chosen vertex is empty. Additionally, particles move according to a symmetric exclusion process with rate $N$. For any $d$ and $N$, there exists $λ_c$ such that, when the system starts from a single particle, particles go extinct when $λ< λ_c$ and have a chance of being present for all times when $λ> λ_c$. Durrett and Neuhauser proved that $λ_c$ …
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 than $1/4$ dies out.
The subcritical contact process seen from the rightmost infected site has no invariant measures. We prove that nevertheless it converges in distribution to a quasi-stationary measure supported on finite configurations.
In this paper we are concerned with the contact process with random recovery rates and edge weights on complete graph with $n$ vertices. We show that the model has a critical value which is inversely proportional to the product of the mean of the edge weight and the mean of the inverse of the recovery rate. In the subcritical case, the process dies out before a moment with order $O(\log n)$ with high probability as $n\rightarrow+\infty$. In the supercritical case, the process survives at a moment with order $\exp\{O(n)\}$ with high probability as $n\rightarrow+\infty$. Our proof for the subcri…
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 the weight on the edge connecting them. Under the annealed measure, we define the critical value λ_c as the maximum of the infection rate with which the process will die out and define λ_e as the maximum of the infection rate with which the process dies out at exponential rate. We show that these two critical values satisfy an identical limit theorem and gi…
The Contact Process Can Survive on a Slightly Subcritical Dynamical Percolation Cluster
Univ Paris Est Creteil, Univ Gustave Eiffel, CNRS, LAMA UMR8050（巴黎东克雷泰伊大学，古斯塔夫·埃菲尔大学，法国国家科学研究中心，拉马实验室）；IRL CNRS IFUMI-2030（法国国家科学研究中心乌拉圭联合研究）；Université de Lorraine, Institut Élie Cartan de Lorraine, UMR 7502（洛林大学，洛林艾利嘉当研究所）；CNRS, Institut Élie Cartan de Lorraine, UMR 7502（法国国家科学研究中心，洛林艾利嘉当研究所）
We study the contact process running in the one-dimensional lattice undergoing dynamical percolation, where edges open at rate $vp$ and close at rate $v(1-p)$. Our goal is to explore how the speed of the environment, $v$, affects the behavior of the process. We show in particular that for small enough $v$ the process dies out, while for large $v$ the process behaves like a contact process on $\mathbb{Z}$ with rate $λp$, so it survives if $λ$ is large. We also show that if $v$ and $p$ are small then the network becomes immune, in the sense that the process dies out for any infection rate $λ$, w…
In this paper we are concerned with contact processes on open clusters of oriented percolation in $Z^d$, where the disease spreads along the direction of open edges. We show that the two critical infection rates in the quenched and annealed cases are equal with probability one and are asymptotically equal to $(dp)^{-1}$ as the dimension $d$ grows to infinity, where $p$ is the probability of edge `open'.
We consider the contact process on a dynamic graph defined as a random $d$-regular graph with a stationary edge-switching dynamics. In this graph dynamics, independently of the contact process state, each pair $\{e_1,e_2\}$ of edges of the graph is replaced by new edges $\{e_1',e_2'\}$ in a crossing fashion: each of $e_1',e_2'$ contains one vertex of $e_1$ and one vertex of $e_2$. As the number of vertices of the graph is taken to infinity, we scale the rate of switching in a way that any fixed edge is involved in a switching with a rate that approaches a limiting value $\mathsf{v}$, so that l…
We are interested in the spread of an epidemic between two communities that have higher connectivity within than between them. We model the two communities as independent Erdos-Renyi random graphs, each with n vertices and edge probability p = n^{a-1} (0<a<1), then add a small set of bridge edges, B, between the communities. We model the epidemic on this network as a contact process (Susceptible-Infected-Susceptible infection) with infection rate λand recovery rate 1. If npλ= b > 1 then the contact process on the Erdos-Renyi random graph is supercritical, and we show that it survives for expon…
