Related papers: Recursive tree processes and the mean-field limit …
This paper deals with the derivation of the mean-field limit for multi-agent systems on a large class of sparse graphs. More specifically, the case of non-exchangeable multi-agent systems consisting of non-identical agents is addressed. The…
Consider the class of Ensemble Square Root filtering algorithms for the numerical approximation of the posterior distribution of nonlinear Markovian signals partially observed with linear observations corrupted with independent measurement…
We propose a particle system of diffusion processes coupled through a chain-like network structure described by an infinite-dimensional, nonlinear stochastic differential equation of McKean-Vlasov type. It has both (i) a local chain…
We consider a gas of independent Brownian particles on a bounded interval in contact with two particle reservoirs at the endpoints. Due to the Brownian nature of the particles, infinitely many particles enter and leave the system in each…
We study a general class of interacting particle systems over a countable state space $V$ where on each site $x \in V$ the particle mass $\eta(x) \geq 0$ follows a stochastic differential equation. We construct the corresponding Markovian…
A family of continuous-state branching processes with immigration are constructed as the solution flow of a stochastic equation system driven by time-space noises. The family can be regarded as an inhomogeneous increasing path-valued…
We study the global fluctuations for a class of determinantal point processes coming from large systems of non-colliding processes and non-intersecting paths. Our main assumption is that the point processes are constructed by biorthogonal…
We study the mean-field limit of the Atlas model and its connection to SDEs with dependence on the distribution of hitting and local times. The Atlas model describes a system of Brownian particles on the real line, where only the lowest…
We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model…
We consider a multilevel continuous time Markov chain $X(s;N) = (X_i^j(s;N): 1 \leq i \leq j \leq N)$, which is defined by means of Jack symmetric functions and forms a certain discretization of the multilevel Dyson Brownian motion. The…
We consider a model system of persistent random walkers that can jam, pass through each other or jump apart (recoil) on contact. In a continuum limit, where particle motion between stochastic changes in direction becomes deterministic, we…
A Poisson line process is a random set of straight lines contained in the plane, as the image of the map $(x,v)\mapsto (x+vt)_{t\in\mathbb{R}}$, for each point $(x,v)$ of a Poisson process in the space-velocity plane. By associating a step…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…
A general expansion scheme based on the concept of linked cluster expansion from the theory of classical spin systems is constructed for models of interacting electrons. It is shown that with a suitable variational formulation of mean-field…
The regular tree corresponds to the random regular graph as its local limit. For this reason the famous double phase transition of the contact process on regular tree has been seen to correspond to a phase transition on the large random…
We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related…
In this paper we consider a class of interacting particle systems on dynamic random networks, in which the joint dynamics of vertices and edges acts as one-way feedback, i.e., edges appear and disappear over time depending on the state of…
Two classes of interacting particle systems on $\mathbb{Z}$ are shown to be Pfaffian point processes at fixed times, and for all deterministic initial conditions. The first comprises coalescing and branching random walks, the second…
We consider the complex branching random walk on a dyadic tree with Gaussian weights on the boundary between the diffuse phase and the glassy phase. We study the branching random walk in the space of continuous functions and establish…