Dominating occupancy processes by the independent site approximation

Abstract

Occupancy processes are a broad class of discrete time Markov chains on $\{0,1{\}}^n$ encompassing models from diverse areas. This model is compared to a collection of $n$ independent Markov chains on $\{0,1\}$, which we call the independent site model. We establish conditions under which an occupancy process is smaller in the lower orthant order than the independent site model. An analogous result for spin systems follows by a limiting argument.}

arXiv commentCorrection to proof for spin systems

References in corpus (5)

• Discrete-time Markov chain approach to contact-based disease spreading in complex networks
• The relationships between message passing, pairwise, Kermack-McKendrick and stochastic SIR epidemic models
• Household epidemic models and McKean-Vlasov Poisson driven stochastic differential equations
• Connecting deterministic and stochastic metapopulation models
• Fast approximate simulation of finite long-range spin systems