اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDynamics of the evolving Bolthausen-Sznitman coalescent
101
0
0.0
(
0
)
تأليف
Jason Schweinsberg
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Consider a population of fixed size that evolves over time. At each time, the genealogical structure of the population can be described by a coalescent tree whose branches are traced back to the most recent common ancestor of the population. As time goes forward, the genealogy of the population evolves, leading to what is known as an evolving coalescent. We will study the evolving coalescent for populations whose genealogy can be described by the Bolthausen-Sznitman coalescent. We obtain the limiting behavior of the evolution of the time back to the most recent common ancestor and the total length of the branches in the tree. By similar methods, we also obtain a new result concerning the number of blocks in the Bolthausen-Sznitman coalescent.
قيم البحث
اقرأ أيضاً
Full likelihood inference under Kingmans coalescent is a computationally challenging problem to which importance sampling (IS) and the product of approximate conditionals (PAC) method have been applied successfully. Both methods can be expressed in t
erms of families of intractable conditional sampling distributions (CSDs), and rely on principled approximations for accurate inference. Recently, more general $Lambda$- and $Xi$-coalescents have been observed to provide better modelling fits to some genetic data sets. We derive families of approximate CSDs for finite sites $Lambda$- and $Xi$-coalescents, and use them to obtain approximately optimal IS and PAC algorithms for $Lambda$-coalescents, yielding substantial gains in efficiency over existing methods.
The nested Kingman coalescent describes the ancestral tree of a population undergoing neutral evolution at the level of individuals and at the level of species, simultaneously. We study the speed at which the number of lineages descends from infinity
in this hierarchical coalescent process and prove the existence of an early-time phase during which the number of lineages at time $t$ decays as $ 2gamma/ct^2$, where $c$ is the ratio of the coalescence rates at the individual and species levels, and the constant $gammaapprox 3.45$ is derived from a recursive distributional equation for the number of lineages contained within a species at a typical time.
This paper studies the spatial coalescent on $Z^2$. In our setting, the partition elements are located at the sites of $Z^2$ and undergo local delayed coalescence and migration. That is, pairs of partition elements located at the same site coalesce i
nto one partition element after exponential waiting times. In addition, the partition elements perform independent random walks. The system starts in either locally finite configurations or in configurations containing countably many partition elements per site. These two situations are relevant if the coalescent is used to study the scaling limits for genealogies in Moran models respectively interacting Fisher-Wright diffusions (or Fleming-Viot processes), which is the key application of the present work. Our goal is to determine the longtime behavior with an initial population of countably many individuals per site restricted to a box $[-t^{alpha/2}, t^{alpha/2}]^2 cap Z^2$ and observed at time $t^beta$ with $1 geq beta geq alphage 0$. We study both asymptotics, as $ttoinfty$, for a fixed value of $alpha$ as the parameter $betain[alpha,1]$ varies, and for a fixed $beta$, as the parameter $alphain [0,beta]$ varies. This exhibits the genealogical structure of the mono-type clusters arising in 2-dimensional Moran and Fisher-Wright systems. (... for more see the actual preprint)
We revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some combinatorial coalescent processes: a time reversal of a fragmentation of Cayley trees or a parki
ng scheme in the additive case, and the random graph process $(G(n,p))_p$ in the multiplicative case. Time being fixed, encoding these combinatorial objects in real-valued processes indexed by the line is the key to describing the asymptotic behaviour of the masses as $nto +infty$. We propose to use the Prim order on the vertices instead of the classical breadth-first (or depth-first) traversal to encode the combinatorial coalescent processes. In the additive case, this yields interesting connections between the different representations of the process. In the multiplicative case, it allows one to answer to a stronger version of an open question of Aldous [Ann. Probab., vol. 25, pp. 812--854, 1997]: we prove that not only the sequence of (rescaled) masses, seen as a process indexed by the time $lambda$, converges in distribution to the reordered sequence of lengths of the excursions above the current minimum of a Brownian motion with parabolic drift $(B_t+lambda t - t^2/2, tgeq 0)$, but we also construct a version of the standard augmented multiplicative coalescent of Bhamidi, Budhiraja and Wang [Probab. Theory Rel., to appear] using an additional Poisson point process.
Let $mathbb{T}^d_N$, $dge 2$, be the discrete $d$-dimensional torus with $N^d$ points. Place a particle at each site of $mathbb{T}^d_N$ and let them evolve as independent, nearest-neighbor, symmetric, continuous-time random walks. Each time two parti
cles meet, they coalesce into one. Denote by $C_N$ the first time the set of particles is reduced to a singleton. Cox [6] proved the existence of a time-scale $theta_N$ for which $C_N/theta_N$ converges to the sum of independent exponential random variables. Denote by $Z^N_t$ the total number of particles at time $t$. We prove that the sequence of Markov chains $(Z^N_{ttheta_N})_{tge 0}$ converges to the total number of partitions in Kingmans coalescent.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
