SearcharxivSearch

arXiv · 1210.3500

Branching Brownian motion with selection

Abstract

In this thesis, branching Brownian motion (BBM) is a random particle system where the particles diffuse on the real line according to Brownian motions and branch at constant rate into a random number of particles with expectation greater than 1. We study two models of BBM with selection: BBM with absorption at a space-time line and the N-BBM, where, as soon as the number of particles exceeds a given number N, only the N right-most particles are kept, the others being removed from the system. For the first model, we study the law of the number of absorbed particles in the case where the process gets extinct almost surely, using a relation between the Fisher-Kolmogorov-Petrovskii-Piskounov (FKPP) and the Briot-Bouquet equations. For the second model, the study of which represents the biggest part of the thesis, we give a precise asymptotic on the position of the cloud of particles when N is large. More precisely, we show that it converges at the timescale log^3 N to a L\'evy process plus a linear drift, both of them explicit, which confirms a prediction by Brunet, Derrida, Mueller and Munier. This study contributes to the understanding of travelling waves of FKPP type under the influence of noise. Finally, in a third part we point at the relation between the BBM and stable point processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Pascal Maillard. 2012-10-12. Branching Brownian motion with selection. https://arxiv.org/abs/1210.3500

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