اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComputational inference beyond Kingmans coalescent
511
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 terms 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.
قيم البحث
اقرأ أيضاً
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.
We review recent progress in the understanding of the role of multiple- and simultaneous multiple merger coalescents as models for the genealogy in idealised and real populations with exceptional reproductive behaviour. In particular, we discuss mode
ls with `skewed offspring distribution (or under other non-classical evolutionary forces) which lead in the single locus haploid case to multiple merger coalescents, and in the multi-locus diploid case to simultaneous multiple merger coalescents. Further, we discuss inference methods under the infinitely-many sites model which allow both model selection and estimation of model parameters under these coalescents.
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.
Scientists and engineers employ stochastic numerical simulators to model empirically observed phenomena. In contrast to purely statistical models, simulators express scientific principles that provide powerful inductive biases, improve generalization
to new data or scenarios and allow for fewer, more interpretable and domain-relevant parameters. Despite these advantages, tuning a simulators parameters so that its outputs match data is challenging. Simulation-based inference (SBI) seeks to identify parameter sets that a) are compatible with prior knowledge and b) match empirical observations. Importantly, SBI does not seek to recover a single best data-compatible parameter set, but rather to identify all high probability regions of parameter space that explain observed data, and thereby to quantify parameter uncertainty. In Bayesian terminology, SBI aims to retrieve the posterior distribution over the parameters of interest. In contrast to conventional Bayesian inference, SBI is also applicable when one can run model simulations, but no formula or algorithm exists for evaluating the probability of data given parameters, i.e. the likelihood. We present $texttt{sbi}$, a PyTorch-based package that implements SBI algorithms based on neural networks. $texttt{sbi}$ facilitates inference on black-box simulators for practising scientists and engineers by providing a unified interface to state-of-the-art algorithms together with documentation and tutorials.
We consider inference about the history of a sample of DNA sequences, conditional upon the haplotype counts and the number of segregating sites observed at the present time. After deriving some theoretical results in the coalescent setting, we implem
ent rejection sampling and importance sampling schemes to perform the inference. The importance sampling scheme addresses an extension of the Ewens Sampling Formula for a configuration of haplotypes and the number of segregating sites in the sample. The implementations include both constant and variable population size models. The methods are illustrated by two human Y chromosome data sets.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
