SearcharxivSearch

arXiv · 2309.12055

Genetic Composition of Supercritical Branching Populations under Power Law Mutation Rates

Abstract

We aim to understand the evolution of the genetic composition of cancer cell populations. To achieve this, we consider an individual-based model representing a cell population where cells divide, die and mutate along the edges of a finite directed graph $(V,E)$. The process starts with only one cell of trait $0$. Following typical parameter values in cancer cell populations we study the model under power law mutation rates, in the sense that the mutation probabilities are parametrized by negative powers of a scaling parameter $n$ and the typical sizes of the population of interest are positive powers of $n$. Under a non-increasing growth rate condition, we describe the time evolution of the first-order asymptotics of the size of each subpopulation in the $\log(n)$ time scale, as well as in the random time scale at which the wild-type population, resp. the total population, reaches the size $n^{t}$. In particular, such results allow for the perfect characterization of evolutionary pathways. Without imposing any conditions on the growth rates, we describe the time evolution of the order of magnitude of each subpopulation, whose asymptotic limits are positive non-decreasing piecewise linear continuous functions.

Explore related subjects

Keep this discovery

BibTeXRIS

Vianney Brouard. 2023-09-21. Genetic Composition of Supercritical Branching Populations under Power Law Mutation Rates. https://arxiv.org/abs/2309.12055

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