arXiv math/04050452004-05math.PR

The Critical Value of the Contact Process with Added and Removed Edges

Paul Jung

备注：: 6 pages

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Stochastic epidemic models featuring contact tracing with delays

This paper is concerned with a stochastic model for the spread of an SEIR (susceptible -> exposed (=latent) -> infective -> removed) epidemic with a contact tracing scheme, in which removed individuals may name some of their infectious contacts, who are then removed if they have not been already after some tracing delay. The epidemic is analysed via an approximating, modified birth-death process, for which a type-reproduction number is derived in terms of unnamed individuals, that is shown to be infinite when the contact rate is sufficiently large. We obtain explicit results under the assumpti…

2015-12-04math.PR

From survival to extinction of the contact process by the removal of a single edge

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.

2016-01-25math.PR

Dynamic Erdös- Rényi random graph with forbidden degree

As suggested by Itai Benjamini, we introduced a variant of the Erdös- Rényi random graph process with a forbidden degree $k$, in which every edge adjacent to a vertex $v$ is removed when the degree of $v$ reaches $k$ (but the removed edges may very well be added again later). We study the existence of a giant component, depending on the forbidden degree $k$ and the time parameter $t$. We prove that for $k\textgreater{}4$ a giant component appears at some point, while for $k\textless{}4$, a giant component never occurs. The main tool of our study is the local limit of the random graph process: …

2016-02-26math.PR

Asymptotic for critical value of the large-dimensional SIR epidemic on clusters

In this paper we are concerned with the SIR (Susceptible-Infective-Removed) epidemic on open clusters of bond percolation on the squared lattice. For the SIR model, a susceptible vertex is infected at rate proportional to the number of infective neighbors while an infective vertex becomes removed at a constant rate. A removed vertex will never be infected again. We assume that there is only one infective vertex at $t=0$ and define the critical value of the model as the maximum of the infection rates with which infective vertices die out with probability one, then we show that the critical valu…

2016-10-30math.PR

A growth-fragmentation-isolation process on random recursive trees and contact tracing

We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate proportional to their sizes (isolation of connected component). A phase transition occurs when the isolation is able to stop the growth fragmentation process and cause extinction. When the process survives, the number of clusters increases exponentially and we prove that the normalized empirical measure of clusters a.s. converges to a limit law on recursive …

2022-09-04math.PR