SearcharxivSearch

arXiv · 2207.03323

Binary branching processes with Moran type interactions

Abstract

The aim of this paper is to study the large population limit of a binary branching particle system with Moran type interactions: we introduce a new model where particles evolve, reproduce and die independently and, with a probability that may depend on the configuration of the whole system, the death of a particle may trigger the reproduction of another particle, while a branching event may trigger the death of an other one. We study the occupation measure of the new model, explicitly relating it to the Feynman-Kac semigroup of the underlying Markov evolution and quantifying the L2 distance between their normalisations. This model extends the fixed size Moran type interacting particle system discussed in [18, 19, 6, 7, 57] and we will indeed show that our model outperforms the latter when used to approximate a birth and death process. We discuss several other applications of our model including the neutron transport equation [36, 15] and population size dynamics.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander M. G. Cox, Emma Horton, Denis Villemonais. 2022-07-07. Binary branching processes with Moran type interactions. https://arxiv.org/abs/2207.03323

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR