SearcharxivSearch

arXiv · 1810.01779

Stochastic Methods for the Neutron Transport Equation I: Linear Semigroup asymptotics

Abstract

The Neutron Transport Equation (NTE) describes the flux of neutrons through an inhomogeneous fissile medium. In this paper, we reconnect the NTE to the physical model of the spatial Markov branching process which describes the process of nuclear fission, transport, scattering, and absorption. By reformulating the NTE in its mild form and identifying its solution as an expectation semigroup, we use modern techniques to develop a Perron-Frobenius (PF) type decomposition, showing that growth is dominated by a leading eigenfunction and its associated left and right eigenfunctions. In the spirit of results for spatial branching and fragmentation processes, we use our PF decomposition to show the existence of an intrinsic martingale and associated spine decomposition. Moreover, we show how criticality in the PF decomposition dictates the convergence of the intrinsic martingale. The mathematical difficulties in this context come about through unusual piecewise linear motion of particles coupled with an infinite type-space which is taken as neutron velocity. The fundamental nature of our PF decomposition also plays out in accompanying work [20, 9].

Explore related subjects

Keep this discovery

BibTeXRIS

Emma Horton, Andreas E. Kyprianou, Denis Villemonais. 2018-10-03. Stochastic Methods for the Neutron Transport Equation I: Linear Semigroup asymptotics. https://arxiv.org/abs/1810.01779

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