اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA tree without leaves
97
0
0.0
(
0
)
تأليف
Brigitte Meyer-Berthaud
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The puzzle presented by the famous stumps of Gilboa, New York, finds a solution in the discovery of two fossil specimens that allow the entire structure of these early trees to be reconstructed.
قيم البحث
اقرأ أيضاً
Stochastic models of evolution (Markov random fields on trivalent trees) generally assume that different characters (different runs of the stochastic process) are independent and identically distributed. In this paper we take the first steps towards
addressing dependent characters. Specifically we show that, under certain technical assumptions regarding the evolution of individual characters, we can detect any significant, history independent, correlation between any pair of multistate characters. For the special case of the Cavender-Farris-Neyman (CFN) model on two states with symmetric transition matrices, our analysis needs milder assumptions. To perform the analysis, we need to prove a new concentration result for multistate random variables of a Markov random field on arbitrary trivalent trees: we show that the random variable counting the number of leaves in any particular subset of states has variance that is subquadratic in the number of leaves.
The Robinson-Foulds (RF) distance is by far the most widely used measure of dissimilarity between trees. Although the distribution of these distances has been investigated for twenty years, an algorithm that is explicitly polynomial time has yet to b
e described for computing this distribution (which is also the distribution of trees around a given tree under the popular Robinson-Foulds metric). In this paper we derive a polynomial-time algorithm for this distribution. We show how the distribution can be approximated by a Poisson distribution determined by the proportion of leaves that lie in `cherries of the given tree. We also describe how our results can be used to derive normalization constants that are required in a recently-proposed maximum likelihood approach to supertree construction.
Observed bimodal tree cover distributions at particular environmental conditions and theoretical models indicate that some areas in the tropics can be in either of the alternative stable vegetation states forest or savanna. However, when including sp
atial interaction in nonspatial differential equation models of a bistable quantity, only the state with the lowest potential energy remains stable. Our recent reaction-diffusion model of Amazonian tree cover confirmed this and was able to reproduce the observed spatial distribution of forest versus savanna satisfactorily when forced by heterogeneous environmental and anthropogenic variables, even though bistability was underestimated. These conclusions were solely based on simulation results. Here, we perform an analytical and numerical analysis of the model. We derive the Maxwell point (MP) of the homogeneous reaction-diffusion equation without savanna trees as a function of rainfall and human impact and show that the front between forest and nonforest settles at this point as long as savanna tree cover near the front remains sufficiently low. For parameters resulting in higher savanna tree cover near the front, we also find irregular forest-savanna cycles and woodland-savanna bistability, which can both explain the remaining observed bimodality.
We consider a biased random walk $X_n$ on a Galton-Watson tree with leaves in the sub-ballistic regime. We prove that there exists an explicit constant $gamma= gamma(beta) in (0,1)$, depending on the bias $beta$, such that $X_n$ is of order $n^{gamma
}$. Denoting $Delta_n$ the hitting time of level $n$, we prove that $Delta_n/n^{1/gamma}$ is tight. Moreover we show that $Delta_n/n^{1/gamma}$ does not converge in law (at least for large values of $beta$). We prove that along the sequences $n_{lambda}(k)=lfloor lambda beta^{gamma k}rfloor$, $Delta_n/n^{1/gamma}$ converges to certain infinitely divisible laws. Key tools for the proof are the classical Harris decomposition for Galton-Watson trees, a new variant of regeneration times and the careful analysis of triangular arrays of i.i.d. heavy-tailed random variables.
A tree-based network $N$ on $X$ is called universal if every phylogenetic tree on $X$ is a base tree for $N$. Recently, binary universal tree-based networks have attracted great attention in the literature and their existence has been analyzed in var
ious studies. In this note, we extend the analysis to non-binary networks and show that there exist both a rooted and an unrooted non-binary universal tree-based network with $n$ leaves for all positive integers $n$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
