The critical value of the contact process with added and removed edges
In this short well-written paper the author studies the influence of edding/removing finitely many edges of a vertex-transitive graph \(\mathcal{G}\) on the global survival critical value of the contact process on \(\mathcal{G}\). The answer got in the paper is that the mentioned transformation of the graph does not change the critical value. A number of topics connected with this result and/or with its proof have also been discussed. For the recent development on this subject see \textit{R. Pemantle} and \textit{A. M. Stacey} [Ann. Probab. 29, No.~4, 1563--1590 (2001; Zbl 1013.60078)].
- Graph constructions for the contact process with a prescribed critical rate
- Markov chains in a Dirichlet environment and hypergeometric integrals
- Critical value for the contact process with random recovery rates and edge weights on regular tree
- Contact processes with random connection weights on regular graphs
- Contact processes with random recovery rates and edge weights on complete graphs
- Contact interactions on a lattice
- Exponential decay for subcritical contact and percolation processes
- scientific article; zbMATH DE number 2166041 (Why is no real title available?)
- On the critical behavior of the contact process in deterministic inhomogeneous environments
- Sharpness of the phase transition in percolation models
- Shocks in the asymmetric exclusion process
- Spatial perturbations of one-dimensional spin systems
- The branching random walk and contact process on Galton-Watson and nonhomogeneous trees
This page was built for publication: The critical value of the contact process with added and removed edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576808)