arXiv subjects

Alain Mazzolo

Publications and source records attributed to Alain Mazzolo.

33 records · Page 2Linked to original sources

arXiv2017

Monte Carlo particle transport in random media: the effects of mixing statistics

Particle transport in random media obeying a given mixing statistics is key in several applications in nuclear reactor physics and more generally in diffusion phenomena emerging in optics and life sciences. Exact solutions for the ensemble-averaged physical observables are hardly available, and several approximate models have been thus developed, providing a compromise between the accurate treatment of the disorder-induced spatial correlations and the computational time. In order to validate these models, it is mandatory to resort to reference solutions in benchmark configurations, typically obtained by explicitly generating by Monte Carlo methods several realizations of random media, simulating particle transport in each realization, and finally taking the ensemble averages for the quantities of interest. In this context, intense research efforts have been devoted to Poisson (Markov) mixing statistics, where benchmark solutions have been derived for transport in one-dimensional geometries. In a recent work, we have generalized these solutions to two and three-dimensional configurations, and shown how dimension affects the simulation results. In this paper we will examine the impact of mixing statistics: to this aim, we will compare the reflection and transmission probabilities, as well as the particle flux, for three-dimensional random media obtained by resorting to Poisson, Voronoi and Box stochastic tessellations. For each tessellation, we will furthermore discuss the effects of varying the fragmentation of the stochastic geometry, the material compositions, and the cross sections of the transported particles.

cond-mat.stat-mech↗

arXiv2016

Benchmark solutions for transport in $d$-dimensional Markov binary mixtures

Linear particle transport in stochastic media is key to such relevant applications as neutron diffusion in randomly mixed immiscible materials, light propagation through engineered optical materials, and inertial confinement fusion, only to name a few. We extend the pioneering work by Adams, Larsen and Pomraning \cite{benchmark_adams} (recently revisited by Brantley \cite{brantley_benchmark}) by considering a series of benchmark configurations for mono-energetic and isotropic transport through Markov binary mixtures in dimension $d$. The stochastic media are generated by resorting to Poisson random tessellations in $1d$ slab, $2d$ extruded, and full $3d$ geometry. For each realization, particle transport is performed by resorting to the Monte Carlo simulation. The distributions of the transmission and reflection coefficients on the free surfaces of the geometry are subsequently estimated, and the average values over the ensemble of realizations are computed. Reference solutions for the benchmark have never been provided before for two- and three-dimensional Poisson tessellations, and the results presented in this paper might thus be useful in order to validate fast but approximated models for particle transport in Markov stochastic media, such as the celebrated Chord Length Sampling algorithm.

cond-mat.stat-mech↗

arXiv2016

Finite-size effects and percolation properties of Poisson geometries

Random tessellations of the space represent a class of prototype models of heterogeneous media, which are central in several applications in physics, engineering and life sciences. In this work, we investigate the statistical properties of $d$-dimensional isotropic Poisson geometries by resorting to Monte Carlo simulation, with special emphasis on the case $d=3$. We first analyse the behaviour of the key features of these stochastic geometries as a function of the dimension $d$ and the linear size $L$ of the domain. Then, we consider the case of Poisson binary mixtures, where the polyhedra are assigned two `labels' with complementary probabilities. For this latter class of random geometries, we numerically characterize the percolation threshold, the strength of the percolating cluster and the average cluster size.

cond-mat.stat-mech↗

arXiv2015

Neutron fluctuations: the importance of being delayed

The neutron population in a nuclear reactor is subject to fluctuations in time and in space due to the competition of diffusion by scattering, births by fission events, and deaths by absorptions. As such, fission chains provide a prototype model for the study of spatial clustering phenomena. In order for the reactor to be operated in stationary conditions at the critical point, the population of prompt neutrons instantaneously emitted at fission must be in equilibrium with the much smaller population of delayed neutrons, emitted after a Poissonian time by nuclear decay of the fissioned nuclei. In this work, we will show that the delayed neutrons, although representing a tiny fraction of the total number of neutrons in the reactor, have actually a key impact on the fluctuations, and their contribution is very effective in quenching the spatial clustering.

cond-mat.stat-mech↗

arXiv2014

Clustering of branching Brownian motions in confined geometries

We study the evolution of a collection of individuals subject to Brownian diffusion, reproduction and disappearance. In particular, we focus on the case where the individuals are initially prepared at equilibrium within a confined geometry. Such systems are widespread in physics and biology and apply for instance to the study of neutron populations in nuclear reactors and the dynamics of bacterial colonies, only to name a few. The fluctuations affecting the number of individuals in space and time may lead to a strong patchiness, with particles clustered together. We show that the analysis of this peculiar behaviour can be rather easily carried out by resorting to a backward formalism based on the Green's function, which allows the key physical observables, namely, the particle concentration and the pair correlation function, to be explicitly derived.

cond-mat.stat-mech↗

arXiv2014

Universal properties of branching random walks in confined geometries

Characterizing the occupation statistics of a radiation flow through confined geometries is key to such technological issues as nuclear reactor design and medical diagnosis. This amounts to assessing the distribution of the travelled length $\ell$ and the number of collisions $n$ performed by the underlying stochastic transport process, for which remarkably simple Cauchy-like formulas were established in the case of branching Pearson random walks with exponentially distributed jumps. In this Letter, we show that such formulas strikingly carry over to the much broader class of branching processes with arbitrary jumps, provided that scattering is isotropic and the average jump size is finite.

cond-mat.stat-mech↗

arXiv2014

Cauchy's formulas for random walks in bounded domains

Cauchy's formula was originally established for random straight paths crossing a body $B \subset \mathbb{R}^{n}$ and basically relates the average chord length through $B$ to the ratio between the volume and the surface of the body itself. The original statement was later extended in the context of transport theory so as to cover the stochastic paths of Pearson random walks with exponentially distributed flight lengths traversing a bounded domain. Some heuristic arguments suggest that Cauchy's formula may also hold true for Pearson random walks with arbitrarily distributed flight lengths. For such a broad class of stochastic processes, we rigorously derive a generalized Cauchy's formula for the average length travelled by the walkers in the body, and show that this quantity depends indeed only on the ratio between the volume and the surface, provided that some constraints are imposed on the entrance step of the walker in $B$. Similar results are obtained also for the average number of collisions performed by the walker in $B$, and an extension to absorbing media is discussed.

cond-mat.stat-mech↗

arXiv2012

Properties of branching exponential flights in bounded domains

Branching random flights are key to describing the evolution of many physical and biological systems, ranging from neutron multiplication to gene mutations. When their paths evolve in bounded regions, we establish a relation between the properties of trajectories starting on the boundary and those starting inside the domain. Within this context, we show that the total length travelled by the walker and the number of performed collisions in bounded volumes can be assessed by resorting to the Feynman-Kac formalism. Other physical observables related to the branching trajectories, such as the survival and escape probability, are derived as well.

cond-mat.stat-mech↗

arXiv2012

Branching exponential flights: travelled lengths and collision statistics

The evolution of several physical and biological systems, ranging from neutron transport in multiplying media to epidemics or population dynamics, can be described in terms of branching exponential flights, a stochastic process which couples a Galton-Watson birth-death mechanism with random spatial displacements. Within this context, one is often called to assess the length $\ell_V$ that the process travels in a given region $V$ of the phase space, or the number of visits $n_V$ to this same region. In this paper, we address this issue by resorting to the Feynman-Kac formalism, which allows characterizing the full distribution of $\ell_V$ and $n_V$ and in particular deriving explicit moment formulas. Some other significant physical observables associated to $\ell_V $ and $n_V$, such as the survival probability, are discussed as well, and results are illustrated by revisiting the classical example of the rod model in nuclear reactor physics.

cond-mat.stat-mech↗

arXiv2012

Discrete Feynman-Kac formulas for branching random walks

Branching random walks are key to the description of several physical and biological systems, such as neutron multiplication, genetics and population dynamics. For a broad class of such processes, in this Letter we derive the discrete Feynman-Kac equations for the probability and the moments of the number of visits $n_V$ of the walker to a given region $V$ in the phase space. Feynman-Kac formulas for the residence times of Markovian processes are recovered in the diffusion limit.

cond-mat.stat-mech↗

arXiv2011

Counting statistics: a Feynman-Kac perspective

By building upon a Feynman-Kac formalism, we assess the distribution of the number of hits in a given region for a broad class of discrete-time random walks with scattering and absorption. We derive the evolution equation for the generating function of the number of hits, and complete our analysis by examining the moments of the distribution, and their relation to the walker equilibrium density. Some significant applications are discussed in detail: in particular, we revisit the gambler's ruin problem and generalize to random walks with absorption the arcsine law for the number of hits on the half-line.

cond-mat.stat-mech↗

arXiv2011

Collision statistics for random flights with anisotropic scattering and absorption

For a broad class of random walks with anisotropic scattering kernel and absorption, we derive explicit formulas that allow expressing the moments of the collision number $n_V$ performed in a volume $V$ as a function of the particle equilibrium distribution. Our results apply to arbitrary domains $V$ and boundary conditions, and allow assessing the hitting statistics for systems where the typical displacements are comparable to the domain size, so that the diffusion limit is possibly not attained. An example is discussed for one-dimensional (1d) random flights with exponential displacements, where analytical calculations can be carried out.

cond-mat.stat-mech↗

arXiv2011

Residence time and collision statistics for exponential flights: the rod problem revisited

Many random transport phenomena, such as radiation propagation, chemical/biological species migration, or electron motion, can be described in terms of particles performing {\em exponential flights}. For such processes, we sketch a general approach (based on the Feynman-Kac formalism) that is amenable to explicit expressions for the moments of the number of collisions and the residence time that the walker spends in a given volume as a function of the particle equilibrium distribution. We then illustrate the proposed method in the case of the so-called {\em rod problem} (a 1d system), and discuss the relevance of the obtained results in the context of Monte Carlo estimators.

cond-mat.stat-mech↗

arXiv2011

Collision densities and mean residence times for $d$-dimensional exponential flights

In this paper we analyze some aspects of {\em exponential flights}, a stochastic process that governs the evolution of many random transport phenomena, such as neutron propagation, chemical/biological species migration, or electron motion. We introduce a general framework for $d$-dimensional setups, and emphasize that exponential flights represent a deceivingly simple system, where in most cases closed-form formulas can hardly be obtained. We derive a number of novel exact (where possible) or asymptotic results, among which the stationary probability density for 2d systems, a long-standing issue in Physics, and the mean residence time in a given volume. Bounded or unbounded, as well as scattering or absorbing domains are examined, and Monte Carlo simulations are performed so as to support our findings.

cond-mat.stat-mech↗

arXiv2011

Collision number statistics for transport processes

Many physical observables can be represented as a particle spending some random time within a given domain. For a broad class of transport-dominated processes, we detail how it is possible to express the moments of the number of particle collisions in an arbitrary volume in terms of repeated convolutions of the ensemble equilibrium distribution. This approach is shown to generalize the celebrated Kac formula for the moments of residence times, which is recovered in the diffusion limit. Some practical applications are illustrated for bounded, unbounded and absorbing domains.

cond-mat.stat-mech↗