Contact processes with random recovery rates and edge weights on complete graphs

DOI10.1007/S10955-017-1898-4MaRDI QIDQ683319zbMATH OpenOpenAlexFDO

Authors Xiaofeng Xue, Yu Pan

Publication date 6 February 2018

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.07933

zbMATH Keywords

complete graphcontact processedge weightrecovery rate

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Critical phenomena in equilibrium statistical mechanics (82B27)

Abstract: 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(logn)$ with high probability as $nightarrow+infty$. In the supercritical case, the process survives at a moment with order $expO(n)$ with high probability as $nightarrow+infty$. Our proof for the subcritical case is inspired by the graphical method introduced in cite{Har1978}. Our proof for the supercritical case is inspired by approach introduced in cite{Pet2011}, which deal with the case where the contact process is with random vertex weights.

Recommendations

• The contact process on the complete graph with random vertex-dependent infection rates
• Extinction time for the contact process on general graphs
• 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 process on regular tree with random vertex weights

Cites work

• Additive set-valued Markov processes and graphical methods
• Contact and voter processes on the infinite percolation cluster as models of host-symbiont interactions
• Contact interactions on a lattice
• Contact processes with random vertex weights on oriented lattices
• Critical value for contact processes on clusters of oriented bond percolation
• Critical value for the contact process with random recovery rates and edge weights on regular tree
• scientific article; zbMATH DE number 1350307 (Why is no real title available?)
• scientific article; zbMATH DE number 3892344 (Why is no real title available?)
• Phase transition for the large-dimensional contact process with random recovery rates on open clusters
• Probability. Theory and examples.
• Random graphs and complex networks. Volume 1
• The complete convergence theorem holds for contact processes in a random environment on \({\mathbb Z}^d \times {\mathbb Z}^{+}\)
• The complete convergence theorem holds for contact processes on open clusters of \(\mathbb Z^{d }\times \mathbb Z^{+}\)
• The contact process in a random environment
• The contact process on the complete graph with random vertex-dependent infection rates
• The survival of one-dimensional contact processes in random environments

Cited in

(8)

• 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 process under heavy-tailed renewals on finite graphs
• The critical value of the contact process with added and removed edges
• A contact process with a semi-infected state on the complete graph
• Critical value asymptotics for the contact process on random graphs
• Phase transition for the large-dimensional contact process with random recovery rates on open clusters
• The contact process on the complete graph with random vertex-dependent infection rates

This page was built for publication: Contact processes with random recovery rates and edge weights on complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683319)