Recursive tree processes and the mean-field limit of stochastic flows

  title={Recursive tree processes and the mean-field limit of stochastic flows},
  author={Tibor Mach and Anja Sturm and Jan M. Swart},
  journal={Electronic Journal of Probability},
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We consider interacting particle systems on the complete graph in the mean-field limit, i.e., as the number of vertices tends to infinity. We are not only interested in the mean-field limit of a single process, but mainly in how several coupled processes behave… 

Figures from this paper

Frozen percolation on the binary tree is nonendogenous
In frozen percolation, i.i.d. uniformly distributed activation times are assigned to the edges of a graph. At its assigned time, an edge opens provided neither of its endvertices is part of an
A phase transition between endogeny and nonendogeny
The Marked Binary Branching Tree (MBBT) is the family tree of a rate one binary branching process, on which points have been generated according to a rate one Poisson point process, with i.i.d.
Lines of descent in the deterministic mutation-selection model with pairwise interaction
With the help of the stratified ancestral selection graph, the mutation-selection differential equation with pairwise interaction is considered and results about the ancestral type distribution in the case of unidirectional mutation are obtained.
Peierls bounds from Toom contours
We review and extend Toom’s classical result about stability of trajectories of cellular automata, with the aim of deriving explicit bounds for monotone Markov processes, both in discrete and
To fixate or not to fixate in two-type annihilating branching random walks
We study a model of competition between two types evolving as branching random walks on $\mathbb{Z}^d$. The two types are represented by red and blue balls respectively, with the rule that balls of
Lines of descent in a Moran model with frequency-dependent selection and mutation
We consider the two-type Moran model with frequency-dependent selection and two-way mutation, where selection follows either the nonlinear dominance or the fittest-type-wins scheme, which will turn


A particle system with cooperative branching and coalescence
In this paper, we introduce a one-dimensional model of particles performing independent random walks, where only pairs of particles can produce offspring ("cooperative branching"), and particles that
The percolation process on a tree where infinite clusters are frozen
  • D. Aldous
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 2000
Modify the usual percolation process on the infinite binary tree by forbidding infinite clusters to grow further. The ultimate configuration will consist of both infinite and finite clusters. We give
Dualities and genealogies in stochastic population models
In the thesis, population processes are studied in two different settings. In Part I, which arose in collaboration with Dr. Jan Swart, a so-called cooperative branching process is considered. We
  • H. McKean
  • Mathematics
    Proceedings of the National Academy of Sciences of the United States of America
  • 1966
Introduction.-The familiar connection between the Brownian motion and the differential operator f -> f"/2, based upon the fact that the Brownian transition function (27rt)-1' exp[-(b a)2/2t] is also
McKean–Vlasov limit for interacting systems with simultaneous jumps
Abstract Motivated by several applications, including neuronal models, we consider the McKean–Vlasov limit for a general class of mean-field systems of interacting diffusions characterized by an
Pathwise Duals of Monotone and Additive Markov Processes
This paper develops a systematic treatment of monotonicity-based pathwise dualities for Markov processes taking values in partially ordered sets. We show that every Markov process that takes values
Reaction-diffusion equations for interacting particle systems
We study interacting spin (particle) systems on a lattice under the combined influence of spin flip (Glauber) and simple exchange (Kawasaki) dynamics. We prove that when the particle-conserving
A Course in Interacting Particle Systems
These lecture notes give an introduction to the theory of interacting particle systems. The main subjects are the construction using generators and graphical representations, the mean field limit,
Minimax functions on Galton–Watson trees
The behaviour of minimax recursions defined on random trees, where the tree is given by a Galton–Watson branching process, truncated at some depth 2n, and the terminal values of the level 2n nodes are drawn independently from some common distribution is examined.
A survey of max-type recursive distributional equations
In certain problems in a variety of applied probability settings (from probabilistic analysis of algorithms to statistical physics), the central requirement is to solve a recursive distributional