Matthias Birkner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Matthias Birkner has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Jochen Blath
Goethe-Universität
5 shared publications - Matthias Steinrücken
Department of Statistics, University of California, Berkeley, CA 94720, USA
4 shared publications - Frank Den Hollander
Mathematical Institute, Leiden University, Leiden, The Netherlands
3 shared publications - Michael Baake
Fakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany
3 shared publications - Rongfeng Sun
National University of Singapore
3 shared publications - Andreas Greven
Department Mathematik Universität Erlangen-Nürnberg Cauerstrasse 11 D-91058 Erlangen Germany
2 shared publications
Latest Publications
- Open Access
A conditional coalescent for diploid exchangeable population models given the pedigree
We study coalescent processes conditional on the population pedigree under the exchangeable diploid bi-parental population model of \citet{BirknerEtAl2018}. While classical coalescent models average over all reproductive histories, thereby marginalizing the pedigree, our work analyzes the genealogical structure embedded within a fixed pedigree generated by the diploid Cannings model. In the large-population limit, we show that these conditional coalescent processes differ significantly from their marginal counterparts when the marginal coalescent process includes multiple mergers. We characterize the limiting process as an inhomogeneous $(Ψ,c)$-coalescent, where $Ψ$ encodes the timing and scale of multiple mergers caused by generations with large individual progeny (GLIPs), and $c$ is a constant rate governing binary mergers. Our results reveal fundamental distinctions between quenched (conditional) and annealed (classical) genealogical models, demonstrate how the fixed pedigree structure impacts multi-locus statistics such as the site-frequency spectrum, and have implications for interpreting patterns of genetic variation among unlinked loci in the genomes of sampled individuals. They significantly extend the results of \citet{DiamantidisEtAl2024}, which considered a sample of size two under a specific Wright-Fisher model with a highly reproductive couple, and those of \citet{TyukinThesis2015}, where Kingman coalescent was the limiting process. Our proofs adapt coupling techniques from the theory of random walks in random environments.Open AccessA conditional coalescent for diploid exchangeable population models given the pedigree
We study coalescent processes conditional on the population pedigree under the exchangeable diploid bi-parental population model of \citet{BirknerEtAl2018}. While classical coalescent models average over all reproductive histories, thereby marginalizing the pedigree, our work analyzes the genealogical structure embedded within a fixed pedigree generated by the diploid Cannings model. In the large-population limit, we show that these conditional coalescent processes differ significantly from their marginal counterparts when the marginal coalescent process includes multiple mergers. We characterize the limiting process as an inhomogeneous $(Ψ,c)$-coalescent, where $Ψ$ encodes the timing and scale of multiple mergers caused by generations with large individual progeny (GLIPs), and $c$ is a constant rate governing binary mergers. Our results reveal fundamental distinctions between quenched (conditional) and annealed (classical) genealogical models, demonstrate how the fixed pedigree structure impacts multi-locus statistics such as the site-frequency spectrum, and have implications for interpreting patterns of genetic variation among unlinked loci in the genomes of sampled individuals. They significantly extend the results of \citet{DiamantidisEtAl2024}, which considered a sample of size two under a specific Wright-Fisher model with a highly reproductive couple, and those of \citet{TyukinThesis2015}, where Kingman coalescent was the limiting process. Our proofs adapt coupling techniques from the theory of random walks in random environments. - Open Access
Survival and complete convergence for a branching annihilating random walk
We study a discrete-time branching annihilating random walk (BARW) on the $d$-dimensional lattice. Each particle produces a Poissonian number of offspring with mean $μ$ which independently move to a uniformly chosen site within a fixed distance $R$ from their parent's position. Whenever a site is occupied by at least two particles, all the particles at that site are annihilated. We prove that for any $μ>1$ the process survives when $R$ is sufficiently large. For fixed $R$ we show that the process dies out if $μ$ is too small or too large. Furthermore, we exhibit an interval of $μ$-values for which the process survives and possesses a unique non-trivial ergodic equilibrium for $R$ sufficiently large. We also prove complete convergence for that case.Open AccessSurvival and complete convergence for a branching annihilating random walk
We study a discrete-time branching annihilating random walk (BARW) on the $d$-dimensional lattice. Each particle produces a Poissonian number of offspring with mean $μ$ which independently move to a uniformly chosen site within a fixed distance $R$ from their parent's position. Whenever a site is occupied by at least two particles, all the particles at that site are annihilated. We prove that for any $μ>1$ the process survives when $R$ is sufficiently large. For fixed $R$ we show that the process dies out if $μ$ is too small or too large. Furthermore, we exhibit an interval of $μ$-values for which the process survives and possesses a unique non-trivial ergodic equilibrium for $R$ sufficiently large. We also prove complete convergence for that case. - Open Access
- 1 January 2024
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 29 (none) , 1-22
On the fixation probability of an advantageous allele in a population with skewed offspring distribution
Consider an advantageous allele that arises in a haploid population of size N evolving in continuous time according to a skewed reproduction mechanism, which generates under neutrality genealogies lying in the domain of attraction of a Beta (2−α,α)-coalescent for α∈(1,2). We prove in a setting of moderate selection that the fixation probability πN of the advantageous allele is asymptotically equal to α1∕(α−1)sN1∕(α−1), where sN is the selection strength of the advantageous allele. Our proof uses duality with a suitable Λ-ancestral selection graph.
- 1 January 2024
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 29 (none) , 1-22
Open AccessOn the fixation probability of an advantageous allele in a population with skewed offspring distribution
Consider an advantageous allele that arises in a haploid population of size N evolving in continuous time according to a skewed reproduction mechanism, which generates under neutrality genealogies lying in the domain of attraction of a Beta (2−α,α)-coalescent for α∈(1,2). We prove in a setting of moderate selection that the fixation probability πN of the advantageous allele is asymptotically equal to α1∕(α−1)sN1∕(α−1), where sN is the selection strength of the advantageous allele. Our proof uses duality with a suitable Λ-ancestral selection graph.
- Open Access
On the fixation probability of an advantageous allele in a population with skewed offspring distribution
Consider an advantageous allele that arises in a haploid population of size $N$ evolving in continuous time according to a skewed reproduction mechanism, which generates under neutrality genealogies lying in the domain of attraction of a Beta$(2-\alpha, \alpha)$-coalescent for $\alpha \in (1,2)$. We prove in a setting of moderate selection that the fixation probability $\pi_N$ of the advantageous allele is asymptotically equal to $\alpha^{1/(\alpha-1)} s_N^{1/(\alpha-1)}$ , where $s_N$ is the selection strength of the advantageous allele. Our proof uses duality with a suitable $\Lambda$-ancestral selection graph.Open AccessOn the fixation probability of an advantageous allele in a population with skewed offspring distribution
Consider an advantageous allele that arises in a haploid population of size $N$ evolving in continuous time according to a skewed reproduction mechanism, which generates under neutrality genealogies lying in the domain of attraction of a Beta$(2-\alpha, \alpha)$-coalescent for $\alpha \in (1,2)$. We prove in a setting of moderate selection that the fixation probability $\pi_N$ of the advantageous allele is asymptotically equal to $\alpha^{1/(\alpha-1)} s_N^{1/(\alpha-1)}$ , where $s_N$ is the selection strength of the advantageous allele. Our proof uses duality with a suitable $\Lambda$-ancestral selection graph. - Open Access
Collective vs. individual behaviour for sums of i.i.d. random variables: appearance of the one-big-jump phenomenon
This article studies large and local large deviations for sums of i.i.d. real-valued random variables in the domain of attraction of an $α$-stable law, $α\in (0,2]$, with emphasis on the case $α=2$. There are two different scenarios: either the deviation is realised via a collective behaviour with all summands contributing to the deviation (a Gaussian scenario), or a single summand is atypically large and contributes to the deviation (a one-big-jump scenario). Such results are known when $α\in (0,2)$ (large deviations always follow a one big-jump scenario) or when the random variables admit a moment of order $2+δ$ for some $δ>0$. We extend these results, including in particular the case where the right tail is regularly varying with index $-2$ (treating cases with infinite variance in the domain of attraction of the normal law). We identify the threshold for the transition between the Gaussian and the one-big-jump regimes; it is slightly larger when considering local large deviations compared to integral large deviations. Additionally, we complement our results by describing the behaviour of the sum and of the largest summand conditionally on a (local) large deviation, for any $α\in (0,2]$, both in the Gaussian and in the one-big-jump regimes. As an application, we show how our results can be used in the study of condensation phenomenon in the zero-range process at the critical density, extending the range of parameters previously considered in the literature.Open AccessCollective vs. individual behaviour for sums of i.i.d. random variables: appearance of the one-big-jump phenomenon
This article studies large and local large deviations for sums of i.i.d. real-valued random variables in the domain of attraction of an $α$-stable law, $α\in (0,2]$, with emphasis on the case $α=2$. There are two different scenarios: either the deviation is realised via a collective behaviour with all summands contributing to the deviation (a Gaussian scenario), or a single summand is atypically large and contributes to the deviation (a one-big-jump scenario). Such results are known when $α\in (0,2)$ (large deviations always follow a one big-jump scenario) or when the random variables admit a moment of order $2+δ$ for some $δ>0$. We extend these results, including in particular the case where the right tail is regularly varying with index $-2$ (treating cases with infinite variance in the domain of attraction of the normal law). We identify the threshold for the transition between the Gaussian and the one-big-jump regimes; it is slightly larger when considering local large deviations compared to integral large deviations. Additionally, we complement our results by describing the behaviour of the sum and of the largest summand conditionally on a (local) large deviation, for any $α\in (0,2]$, both in the Gaussian and in the one-big-jump regimes. As an application, we show how our results can be used in the study of condensation phenomenon in the zero-range process at the critical density, extending the range of parameters previously considered in the literature. - Open Access
- 3 July 2023
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 187 (1-2) , 523-569
Correction to: Quenched large deviation principle for words in a letter sequence
- 3 July 2023
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 187 (1-2) , 523-569
Open AccessCorrection to: Quenched large deviation principle for words in a letter sequence
- Open Access
Quenched large deviation principle for words in a letter sequence
When we cut an i.i.d. sequence of letters into words according to an independent renewal process, we obtain an i.i.d. sequence of words. In the \emph{annealed} large deviation principle (LDP) for the empirical process of words, the rate function is the specific relative entropy of the observed law of words w.r.t. the reference law of words. In the present paper we consider the \emph{quenched} LDP, i.e., we condition on a typical letter sequence. We focus on the case where the renewal process has an \emph{algebraic} tail. The rate function turns out to be a sum of two terms, one being the annealed rate function, the other being proportional to the specific relative entropy of the observed law of letters w.r.t. the reference law of letters, with the former being obtained by concatenating the words and randomising the location of the origin. The proportionality constant equals the tail exponent of the renewal process. Earlier work by Birkner considered the case where the renewal process has an exponential tail, in which case the rate function turns out to be the first term on the set where the second term vanishes and to be infinite elsewhere. The previous version (arXiv:0807.2611v2) appeared in Probab. Theory Relat. Fields 148, no. 3/4 (2010), 403--456. Meanwhile, it has turned out that the original proof of the representation of the rate function is flawed when the mean word length is infinite. We add an erratum in which we fix the flaw in the proof. Along the way we derive new representations of the rate function that are interesting in their own right. A key ingredient in the proof is the observation that if the rate function in the annealed large deviation principle is finite at a stationary word process, then the letters in the tail of the long words in this process are typical.
Open AccessQuenched large deviation principle for words in a letter sequence
When we cut an i.i.d. sequence of letters into words according to an independent renewal process, we obtain an i.i.d. sequence of words. In the \emph{annealed} large deviation principle (LDP) for the empirical process of words, the rate function is the specific relative entropy of the observed law of words w.r.t. the reference law of words. In the present paper we consider the \emph{quenched} LDP, i.e., we condition on a typical letter sequence. We focus on the case where the renewal process has an \emph{algebraic} tail. The rate function turns out to be a sum of two terms, one being the annealed rate function, the other being proportional to the specific relative entropy of the observed law of letters w.r.t. the reference law of letters, with the former being obtained by concatenating the words and randomising the location of the origin. The proportionality constant equals the tail exponent of the renewal process. Earlier work by Birkner considered the case where the renewal process has an exponential tail, in which case the rate function turns out to be the first term on the set where the second term vanishes and to be infinite elsewhere. The previous version (arXiv:0807.2611v2) appeared in Probab. Theory Relat. Fields 148, no. 3/4 (2010), 403--456. Meanwhile, it has turned out that the original proof of the representation of the rate function is flawed when the mean word length is infinite. We add an erratum in which we fix the flaw in the proof. Along the way we derive new representations of the rate function that are interesting in their own right. A key ingredient in the proof is the observation that if the rate function in the annealed large deviation principle is finite at a stationary word process, then the letters in the tail of the long words in this process are typical.
- Open Access
Coalescing directed random walks on the backbone of a 1 +1-dimensional oriented percolation cluster converge to the Brownian web
We consider the backbone of the infinite cluster generated by supercritical oriented site percolation in dimension 1 +1. A directed random walk on this backbone can be seen as an "ancestral line" of an individual sampled in the stationary discrete-time contact process. Such ancestral lineages were investigated in [BCDG13] where a central limit theorem for a single walker was proved. Here, we consider infinitely many coalescing walkers on the same backbone starting at each space-time point. We show that, after diffusive rescaling, the collection of paths converges in distribution to the Brownian web. Hence, we prove convergence to the Brownian web for a particular system of coalescing random walks in a dynamical random environment. An important tool in the proof is a tail bound on the meeting time of two walkers on the backbone, started at the same time. Our result can be interpreted as an averaging statement about the percolation cluster: apart from a change of variance, it behaves as the full lattice, i.e. the effect of the "holes" in the cluster vanishes on a large scale.
Open AccessCoalescing directed random walks on the backbone of a 1 +1-dimensional oriented percolation cluster converge to the Brownian web
We consider the backbone of the infinite cluster generated by supercritical oriented site percolation in dimension 1 +1. A directed random walk on this backbone can be seen as an "ancestral line" of an individual sampled in the stationary discrete-time contact process. Such ancestral lineages were investigated in [BCDG13] where a central limit theorem for a single walker was proved. Here, we consider infinitely many coalescing walkers on the same backbone starting at each space-time point. We show that, after diffusive rescaling, the collection of paths converges in distribution to the Brownian web. Hence, we prove convergence to the Brownian web for a particular system of coalescing random walks in a dynamical random environment. An important tool in the proof is a tail bound on the meeting time of two walkers on the backbone, started at the same time. Our result can be interpreted as an averaging statement about the percolation cluster: apart from a change of variance, it behaves as the full lattice, i.e. the effect of the "holes" in the cluster vanishes on a large scale.
- Open Access
Coalescent results for diploid exchangeable population models
We consider diploid bi-parental analogues of Cannings models: in a population of fixed size $N$ the next generation is composed of $V_{i,j}$ offspring from parents $i$ and $j$, where $V=(V_{i,j})_{1\le i\neq j \le N}$ is a (jointly) exchangeable (symmetric) array. Every individual carries two chromosome copies, each of which is inherited from one of its parents. We obtain general conditions, formulated in terms of the vector of the total number of offspring to each individual, for the convergence of the properly scaled ancestral process for an $n$-sample of genes towards a ($\Xi$-)coalescent. This complements M\"ohle and Sagitov's (2001) result for the haploid case and sharpens the profile of M\"ohle and Sagitov's (2003) study of the diploid case, which focused on fixed couples, where each row of $V$ has at most one non-zero entry. We apply the convergence result to several examples, in particular to two diploid variations of Schweinsberg's (2003) model, leading to Beta-coalescents with two-fold and with four-fold mergers, respectively.Open AccessCoalescent results for diploid exchangeable population models
We consider diploid bi-parental analogues of Cannings models: in a population of fixed size $N$ the next generation is composed of $V_{i,j}$ offspring from parents $i$ and $j$, where $V=(V_{i,j})_{1\le i\neq j \le N}$ is a (jointly) exchangeable (symmetric) array. Every individual carries two chromosome copies, each of which is inherited from one of its parents. We obtain general conditions, formulated in terms of the vector of the total number of offspring to each individual, for the convergence of the properly scaled ancestral process for an $n$-sample of genes towards a ($\Xi$-)coalescent. This complements M\"ohle and Sagitov's (2001) result for the haploid case and sharpens the profile of M\"ohle and Sagitov's (2003) study of the diploid case, which focused on fixed couples, where each row of $V$ has at most one non-zero entry. We apply the convergence result to several examples, in particular to two diploid variations of Schweinsberg's (2003) model, leading to Beta-coalescents with two-fold and with four-fold mergers, respectively.