SearcharxivSearch

arXiv · 2105.04896

Total number of births on the negative half-line of the binary branching Brownian motion in the boundary case

Abstract

The binary branching Brownian motion in the boundary case is a particle system on the real line behaving as follows. It starts with a unique particle positioned at the origin at time $0$. The particle moves according to a Brownian motion with drift $\mu = 2$ and diffusion coefficient $\sigma^2 = 2$, until an independent exponential time of parameter $1$. At that time, the particle dies giving birth to two children who then start independent copies of the same process from their birth place. It is well-known that in this system, the cloud of particles eventually drifts to $\infty$. The aim of this note is to provide a precise estimate for the total number of particles that were born on the negative half-line, investigating in particular the tail decay of this random variable.

Explore related subjects

Keep this discovery

BibTeXRIS

Xinxin Chen, Bastien Mallein. 2021-05-11. Total number of births on the negative half-line of the binary branching Brownian motion in the boundary case. https://arxiv.org/abs/2105.04896

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