SearcharxivSearch

arXiv · 2506.01787

Branch lengths for geodesics in the directed landscape and mutation patterns in growing spatially structured populations

Abstract

Consider a population that is expanding in two-dimensional space. Suppose we collect data from a sample of individuals taken at random either from the entire population, or from near the outer boundary of the population. A quantity of interest in population genetics is the site frequency spectrum, which is the number of mutations that appear on $k$ of the $n$ sampled individuals, for $k = 1, \dots, n-1$. As long as the mutation rate is constant, this number will be roughly proportional to the total length of all branches in the genealogical tree that are on the ancestral line of $k$ sampled individuals. While the rigorous literature has primarily focused on models without any spatial structure, in many natural settings, such as tumors or bacteria colonies, growth is dictated by spatial constraints. Many such two dimensional growth models are expected to fall in the KPZ universality class. In this article we adopt the perspective that for population models in the KPZ universality class, the genealogical tree can be approximated by the tree formed by the infinite upward geodesics in the directed landscape, a universal scaling limit constructed in \cite{dov22}, starting from $n$ randomly chosen points. Relying on geodesic coalescence, we prove new asymptotic results for the lengths of the portions of these geodesics that are ancestral to $k$ of the $n$ sampled points and consequently obtain exponents driving the site frequency spectrum as predicted in \cite{fgkah16}. An important ingredient in the proof is a new tight estimate of the probability that three infinite upward geodesics stay disjoint up to time $t$, i.e., a sharp quantitative version of the well studied N3G problem, which is of independent interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Shirshendu Ganguly, Jason Schweinsberg, Yubo Shuai. 2025-06-02. Branch lengths for geodesics in the directed landscape and mutation patterns in growing spatially structured populations. https://arxiv.org/abs/2506.01787

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