Evolving phylogenies of trait-dependent branching with mutation and competition. Part I: Existence

Sandra Kliem; Anita Winter

Home/Archive/arXiv

arXiv · 1705.03277

Evolving phylogenies of trait-dependent branching with mutation and competition. Part I: Existence

Sandra Kliem·Anita Winter

View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a type-dependent branching model with mutation and competition for modeling phylogenies of a virus population. The competition kernel depends for any two virus particles on the particles' types, the total mass of the population as well as genetic information available through the number of nucleotide substitutions separating the virus particles. We consider the evolving phylogenies of this individual based model in the huge population, short reproduction time and frequent mutation regime, and show tightness in the state space of marked metric measure spaces. Due to heterogeneity in the natural branching rates, the phylogenies are in general not ultra-metric. We therefore develop new techniques for verifying a compact containment condition. Finally, we characterize the limit as a solution of a martingale problem.

Explore related subjects

math.PR

Keep this discovery

BibTeX RIS

Sandra Kliem, Anita Winter. 2017-05-09. Evolving phylogenies of trait-dependent branching with mutation and competition. Part I: Existence. https://arxiv.org/abs/1705.03277

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↗