Related papers: Perfect Tree-Like Markovian Distributions
The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…
A simple way to model phenotypic evolution is to assume that after splitting, the trait values of the sister species diverge as independent Brownian motions. Relying only on a prior distribution for the underlying species tree (conditioned…
The standard method to check for the independence of two real-valued random variables -- demonstrating that the bivariate joint distribution factors into the product of its marginals -- is both necessary and sufficient. Here we present a…
In this paper, the existence and uniqueness of strong solutions to distribution dependent neutral SFDEs are proved. We give the conditions such that the order preservation of these equations holds. Moreover, we show these conditions are…
Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these…
A {\em maximal inequality} seeks to estimate $\mathbb{E}\max_i X_i$ in terms of properties of the $X_i$. When the latter are independent, the union bound (in its various guises) can yield tight upper bounds. If, however, the $X_i$ are…
We extend the theory of d-separation to cases in which data instances are not independent and identically distributed. We show that applying the rules of d-separation directly to the structure of probabilistic models of relational data…
Motivated by the need, in some Bayesian likelihood free inference problems, of imputing a multivariate counting distribution based on its vector of means and variance-covariance matrix, we define a generic multivariate discrete…
Construction of phylogenetic trees and networks for extant species from their characters represents one of the key problems in phylogenomics. While solution to this problem is not always uniquely defined and there exist multiple methods for…
A probability inequality is proved for n-fold convolutions of a smooth cumulative distribution function on (0,infinity)x...x(0,infinity), which is multivariate totally positive of order 2 (MTP2). This inequality is better than an inequality…
We provide a new approach for proving the indistinguishability of connected components of random one-or-two-ended oriented forests on unimodular random graphs. In particular, this approach leads to a new and simpler proof for the wired…
We study the number of random records in an arbitrary split tree (or equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for convergence of sums of triangular arrays to…
Knowing when a graphical model is perfect to a distribution is essential in order to relate separation in the graph to conditional independence in the distribution, and this is particularly important when performing inference from data.…
We examine a discrete random recursive tree growth process that, at each time step, either adds or deletes a node from the tree with probability $p$ and $1-p$, respectively. Node addition follows the usual uniform attachment model. For node…
We consider the random matrix obtained by picking vectors randomly from a large collection of mutually unbiased bases of $\mathbb{C}^n$, and prove that the spectral distribution converges to the Marchenko-Pastur law. This shows that vectors…
We prove that the multiplicity of a fixed eigenvalue $\alpha$ in a random recursive tree on $n$ vertices satisfies a central limit theorem with mean and variance asymptotically equal to $\mu_{\alpha} n$ and $\sigma^2_{\alpha} n$…
Understanding the effects of the choice of the tree on the joint distribution of a tree-structured Markov random field (MRF) is crucial for fully exploiting the intelligibility of such probabilistic graphical models. Tools must be developed…
For a model of molecular evolution to be useful for phylogenetic inference, the topology of evolutionary trees must be identifiable. That is, from a joint distribution the model predicts, it must be possible to recover the tree parameter.…
A tree is pathwise-random if all of its paths are Martin-Lof random. We show that (a) no weakly 2-random real computes a perfect pathwise-random tree; it follows that the class of perfect pathwise-random trees is null, with respect to any…
The usual stochastic order and the likelihood ratio order between probability distributions on the real line are reviewed in full generality. In addition, for the distribution of a random pair $(X,Y)$, it is shown that the conditional…