Search arXiv⌕ Search

arXiv · 2504.03326

Stochastic ordering, attractiveness and couplings in non-conservative particle systems

Abstract

We analyse the stochastic comparison of interacting particle systems allowing for multiple arrivals, departures and non-conservative jumps of individuals between sites. That is, if $k$ individuals leave site $x$ for site $y$, a possibly different number $l$ arrive at destination. This setting includes new models, when compared to the conservative case, such as metapopulation models with deaths during migrations. It implies a sharp increase of technical complexity, given the numerous changes to consider. Known results are significantly generalised, even in the conservative case, as no particular form of the transition rates is assumed. We obtain necessary and sufficient conditions on the rates for the stochastic comparison of the processes and prove their equivalence with the existence of an order-preserving Markovian coupling. As a corollary, we get necessary and sufficient conditions for the attractiveness of the processes. A salient feature of our approach lies in the presentation of the coupling in terms of solutions to network flow problems. We illustrate the applicability of our results to a flexible family of population models described as interacting particle systems, with a range of parameters controlling births, deaths, catastrophes or migrations. We provide explicit conditions on the parameters for the stochastic comparison and attractiveness of the models, showing their usefulness in studying their limit behaviour. Additionally, we give three examples of constructing the coupling.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raúl Gouet, F. Javier López, Gerardo Sanz. 2025-04-04. Stochastic ordering, attractiveness and couplings in non-conservative particle systems. https://arxiv.org/abs/2504.03326

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

KEEP EXPLORING

Related papers

Additive processes on the real line and Loewner chains

This paper investigates additive processes with respect to several different independences in non-commutative probability in terms of the convolution hemigroups of the distributions of the increments of the processes. In particular, we focus on the relation of monotone convolution hemigroups and Loewner chains, a special kind of family of conformal mappings, on the upper half-plane. Generalizing the celebrated Loewner differential equation, we formulate an integral equation and the concept of ``generator'' for any Loewner chain of reciprocal Cauchy transforms. This generalization enables us to remove the assumption of the absolute continuity of Loewner chains which had been imposed in the literature. The locally uniform convergence of Loewner chains is then equivalent to a suitable convergence of generators. Using generators, we define homeomorphisms between the aforementioned class of Loewner chains, the set of monotone convolution hemigroups, and the set of classical convolution hemigroups on the real line. We also discuss similar homeomorphisms to free, boolean and anti-monotone convolution hemigroups on the real line.

math.PR↗

Shape Theorem for the Contact Process in a Dynamical Random Environment

We study the contact process in a dynamical random environment defined on the vertices and edges of the d-dimensional integer lattice $\mathbb{Z}^d$. For a broad class of processes, we establish an asymptotic shape theorem for the set $\mathbf{H}_t$, which represents the vertices that have been infected up to time $t$. More precisely, we show that, similarly to the basic contact process, this asymptotic shape is characterised by a cone spanned by a convex set $U$, provided certain growth conditions are satisfied. Notably, we find that the asymptotic shape is independent of the initial configuration of the environment. Furthermore, we verify the growth conditions for various types of random environments, such as the contact process on a dynamical graph and a system with switching vertex states, where the monotonicity of the entire process is not guaranteed.

math.PR↗

Random burning of the Euclidean torus

The burning number of a graph is the minimal number of steps that are needed to burn all of its vertices, with the following burning procedure: at each step, one can choose a point to set on fire, and the fire propagates constantly at unit speed along the edges of the graph. In this paper, we consider two natural random burning procedures in the discrete Euclidean torus $\mathbb{T}_n^d$, in which the points that we set on fire at each step are random variables. Our main result deals with the case where at each step, the law of the new point that we set on fire conditionally on the past is the uniform distribution on the complement of the set of vertices burned by the previous points. In this case, we prove that as $n\to\infty$, the corresponding random burning number (i.e, the first step at which the whole torus is burned) is asymptotic to $T\cdot n^{d/(d+1)}$ in probability, where $T=T(d)\in(0,\infty)$ is the explosion time of a so-called generalised Blasius equation.

math.PR↗