SearcharxivSearch

arXiv · 2103.02237

Yaglom limit for critical neutron transport

Abstract

We consider the classical Yaglom limit theorem for a branching Markov process $X = (X_t, t \ge 0)$, with non-local branching mechanism in the setting that the mean semigroup is critical, i.e. its leading eigenvalue is zero. In particular, we show that there exists a constant $c(f)$ such that \[ {\rm Law}\left(\frac{\langle f, X_t\rangle}{t} \bigg| \langle 1, X_t\rangle > 0 \right) \to {\mathbf e}_{c(f)}, \qquad t \to \infty, \] where ${\mathbf e}_{c(f)}$ is an exponential random variable with rate $c(f)$ and the convergence is in distribution. As part of the proof, we also show that the probability of survival decays inversely proportionally to time. Although Yaglom limit theorems have recently been handled in the setting of branching Brownian motion in a bounded domain and superprocesses, \cite{Ellen, Yanxia}, these results do not allow for non-local branching, which complicates the analysis. Our approach and the main novelty of this work is based around a precise result for the scaled asymptotics for the $k$-th martingale moments of $X$ (rather than the Yaglom limit itself). We then illustrate our results in the setting of neutron transport, for which the non-locality is essential, complementing recent developments in this domain \cite{SNTE, SNTEII, SNTEIII, MCNTE, MultiNTE}.

Explore related subjects

Keep this discovery

BibTeXRIS

Simon C. Harris, Emma Horton, Andreas E. Kyprianou, Minmin Wang. 2021-03-03. Yaglom limit for critical neutron transport. https://arxiv.org/abs/2103.02237

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