Related papers: Isomorphism and Symmetries in Random Phylogenetic …
We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and…
We study the asymptotic behavior of four statistics associated with subtrees of complete graphs: the uniform probability $p_n$ that a random subtree is a spanning tree of $K_n$, the weighted probability $q_n$ (where the probability a…
We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…
The magnitude of Pearson correlation between two scalar random variables can be visually judged from the two-dimensional scatter plot of an independent and identically distributed sample drawn from the joint distribution of the two…
We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…
We extend the results of B. Bollobas, O. Riordan, J. Spencer, G. Tusnady, and Mori. We consider a model of random tree growth, where at each time unit a new node is added and attached to an already existing node chosen at random. The…
We study properties of eigenvalues of a matrix associated with a randomly chosen partial automorphism of a regular rooted tree. We show that asymptotically, as the numbers of levels goes to infinity, the fraction of non-zero eigenvalues…
We obtain an exact formula for the probability that a uniformly random spanning tree of the $2$-by-$n$ square grid is ``balanced'' in the sense that it has an edge whose removal partitions its vertices into two sets of equal size. We…
We give a detailed asymptotic analysis of the profiles of random symmetric digital search trees, which are in close connection with the performance of the search complexity of random queries in such trees. While the expected profiles have…
We derive conditions under which random sequences of polarizations (two-point symmetrizations) converge almost surely to the symmetric decreasing rearrangement. The parameters for the polarizations are independent random variables whose…
Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…
Topological phylogenetic trees can be assigned edge weights in several natural ways, highlighting different aspects of the tree. Here the rooted triple and quartet metrizations are introduced, and applied to formulate novel fast methods of…
Estimating phylogenetic trees is an important problem in evolutionary biology, environmental policy and medicine. Although trees are estimated, their uncertainties are discarded by mathematicians working in tree space. Here we explicitly…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…
The Bayesian method is noted to produce spuriously high posterior probabilities for phylogenetic trees in analysis of large datasets, but the precise reasons for this over-confidence are unknown. In general, the performance of Bayesian…
The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…
This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…
In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
We consider random rooted maps without regard to their genus, with fixed large number of edges, and address the problem of limiting distributions for six different parameters: vertices, leaves, loops, root edges, root isthmus, and root…