Branching Brownian motion in strip: survival near criticality

Simon Harris; Marion Hesse; Andreas E. Kyprianou

Home/Archive/arXiv

arXiv · 1212.1444

Branching Brownian motion in strip: survival near criticality

Simon Harris·Marion Hesse·Andreas E. Kyprianou

View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider a branching Brownian motion with linear drift in which particles are killed on exiting the interval (0,K) and study the evolution of the process on the event of survival as the width of the interval shrinks to the critical value at which survival is no longer possible. We combine spine techniques and a backbone decomposition to obtain exact asymptotics for the near-critical survival probability. This allows us to deduce the existence of a quasi-stationary limit result for the process conditioned on survival which reveals that the backbone thins down to a spine as we approach criticality. This paper is motivated by recent work on survival of near critical branching Brownian motion with absorption at the origin by Aidekon and Harris as well as the work of Berestycki, Berestycki and Schweinsberg.

Explore related subjects

math.PR

Keep this discovery

BibTeX RIS

Simon Harris, Marion Hesse, Andreas E. Kyprianou. 2012-12-06. Branching Brownian motion in strip: survival near criticality. https://arxiv.org/abs/1212.1444

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗