Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2205.07275

The Contact Process with Switching

Jochen Blath·Felix Hermann·Michel Reitmeier
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we introduce a type switching mechanism for the Contact Process on the lattice $\mathbb{Z}^d$. That is, we allow the individual particles/sites to switch between two (or more) types independently of one another, and the different types may exhibit specific infection and recovery dynamics. Such type switches can eg.\ be motivated from biology, where 'phenotypic switching' is common among micro-organisms. Our framework includes as special cases systems with switches between 'active' and 'dormant' states (the Contact Process with dormancy, CPD), and the Contact Process in a randomly evolving environment (CPREE) introduced by Broman (2007). The 'standard' multi-type Contact Process (without type-switching) can also be recovered as a limiting case. After constructing the process from a graphical representation, we establish several basic properties that are mostly analogous to the classical Contact Process. We then provide couplings between several variants of the system, which in particular yield the existence of a phase transition. Further, we investigate the effect of the switching parameters on the critical value of the system by providing rigorous bounds obtained from the coupling arguments as well as numerical and heuristic results. Finally, we investigate scaling limits for the process as the switching parameters tend to 0 (slow switching regime) resp.\ $\infty$ (fast switching regime). We conclude with a brief discussion of further model variants and questions for future research.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jochen Blath, Felix Hermann, Michel Reitmeier. 2022-05-15. The Contact Process with Switching. https://doi.org/10.5802/msia.35

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The extremal process of a cascading family of branching Brownian motion

We study the asymptotic behaviour of the extremal process of a cascading family of branching Brownian motions. This is a particle system on the real line such that each particle has a type in addition to his position. Particles of type $1$ move on the real line according to Brownian motions and branch at rate $1$ into two children of type $1$. Furthermore, at rate $α$, they give birth to children too of type $2$. Particles of type $2$ move according to standard Brownian motion and branch at rate $1$, but cannot give birth to descendants of type $1$. We obtain the asymptotic behaviour of the extremal process of particles of type $2$.

math.PR↗
arXiv2026

Breuer-Major Theorems for Hilbert Space-Valued Random Variables

Let $\{X_k\}_{k\in\mathbb Z}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal H_1$, and let $G:\mathcal H_1\to\mathcal H_2$ be a measurable map into another separable Hilbert space $\mathcal H_2$. We derive a central limit theorem for the centered normalized partial sums of the Hilbert space-valued subordinated process $\{G[X_k]\}_{k\in\mathbb Z}$. Our result holds under either of two sets of sufficient conditions, formulated in terms of the transformation $G$ and the temporal and cross-sectional dependence structure of $\{X_k\}_{k\in\mathbb Z}$. These conditions coincide in finite dimensions but lead to genuinely different phenomena in the infinite-dimensional setting. The proof relies on the recently developed Fourth Moment Theorem on Hilbert spaces, leveraging tools from the infinite-dimensional Malliavin-Stein framework. We also provide continuous-time and quantitative versions of the central limit theorem. In a series of examples, we recover and strengthen limit theorems for a wide array of statistics relevant in functional data analysis, and present, as an application of our result, a novel limit theorem in the framework of neural operators.

math.PR↗
arXiv2026

Controlled rough SDEs, pathwise stochastic control and dynamic programming principles

We study stochastic optimal control of rough stochastic differential equations (RSDEs). This is in the spirit of the pathwise control problem (Lions--Souganidis 1998, Buckdahn--Ma 2007; also Davis--Burstein 1992), with renewed interest and recent works drawing motivation from filtering, SPDEs, and reinforcement learning. Results include regularity of rough value functions, validity of a rough dynamic programming principles and new rough stability results for HJB equations, removing excessive regularity demands previously imposed by flow transformation methods. Measurable selection is used to relate RSDEs to "doubly stochastic" SDEs under conditioning. In contrast to previous works, Brownian statistics for the to-be-conditioned-on noise are not required, aligned with the "pathwise" intuition that these should not matter upon conditioning. Depending on the chosen class of admissible controls, the involved processes may also be anticipating. The resulting stochastic value functions coincide in great generality for different classes of controls. RSDE theory offers a powerful and unified perspective on this problem class.

math.PR↗