Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1501.02648

Mean field dynamics of collisional processes with duplication, loss and copy

Federico Bassetti·Giuseppe Toscani
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we introduce and discuss kinetic equations for the evolution of the probability distribution of the number of particles in a population subject to binary interactions. The microscopic binary law of interaction is assumed to be dependent on fixed-in-time random parameters which describe both birth and death of particles, and the migration rule. These assumptions lead to a Boltzmann-type equation that in the case in which the mean number of the population is preserved, can be fully studied, by obtaining in some case the analytic description of the steady profile. In all cases, however, a simpler kinetic description can be derived, by considering the limit of quasi-invariant interactions. This procedure allows to describe the evolution process in terms of a linear kinetic transport-type equation. Among the various processes that can be described in this way, one recognizes the Lea-Coulson model of mutation processes in bacteria, a variation of the original model proposed by Luria and Delbr\"uck.

Explore related subjects

math.PRmath-phmath.MP

Keep this discovery

BibTeXRIS

Federico Bassetti, Giuseppe Toscani. 2015-01-12. Mean field dynamics of collisional processes with duplication, loss and copy. https://arxiv.org/abs/1501.02648

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↗