Search arXivSearch

arXiv · 1909.00581

Stochastic Methods for Neutron Transport Equation III: Generational many-to-one and $k_\texttt{eff}$

Abstract

The Neutron Transport Equation (NTE) describes the flux of neutrons over time through an inhomogeneous fissile medium. In the recent articles [5, 10], a probabilistic solution of the NTE is considered in order to demonstrate a Perron-Frobenius type growth of the solution via its projection onto an associated leading eigenfunction. In [9, 4], further analysis is performed to understand the implications of this growth both in the stochastic sense, as well as from the perspective of Monte-Carlo simulation. Such Monte-Carlo simulations are prevalent in industrial applications, in particular where regulatory checks are needed in the process of reactor core design. In that setting, however, it turns out that a different notion of growth takes centre stage, which is otherwise characterised by another eigenvalue problem. In that setting, the eigenvalue, sometimes called k-effective (written $k_\texttt{eff}$), has the physical interpretation as being the ratio of neutrons produced (during fission events) to the number lost (due to absorption in the reactor or leakage at the boundary) per typical fission event. In this article, we aim to supplement [5, 10, 9, 4], by developing the stochastic analysis of the NTE further to the setting where a rigorous probabilistic interpretation of keff is given, both in terms of a Perron-Frobenius type analysis as well as via classical operator analysis. To our knowledge, despite the fact that an extensive engineering literature and industrial Monte-Carlo software is concentrated around the estimation of keff and its associated eigenfunction, we believe that our work is the first rigorous treatment in the probabilistic sense (which underpins some of the aforesaid Monte-Carlo simulations).

Explore related subjects

Keep this discovery

BibTeXRIS

A. M. G. Cox, E. L. Horton, A. E. Kyprianou, D. Villemonais. 2019-09-02. Stochastic Methods for Neutron Transport Equation III: Generational many-to-one and $k_\texttt{eff}$. https://arxiv.org/abs/1909.00581

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