Related papers: A representation for exchangeable coalescent trees…
Query evaluation in monadic second-order logic (MSO) is tractable on trees and treelike instances, even though it is hard for arbitrary instances. This tractability result has been extended to several tasks related to query evaluation, such…
We use an automated Voigt-profile fitting procedure to extract statistical properties of the Ly$\alpha$ forest in a numerical simulation of an $\Omega=1$, cold dark matter (CDM) universe. Our analysis method is similar to that used in most…
We provide time- and sample-efficient algorithms for learning and testing latent-tree Ising models, i.e. Ising models that may only be observed at their leaf nodes. On the learning side, we obtain efficient algorithms for learning a…
We introduce a flexible and tractable infinite-dimensional stochastic volatility model. More specifically, we consider a Hilbert space valued Ornstein-Uhlenbeck-type process, whose instantaneous covariance is given by a pure-jump stochastic…
Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…
We consider the problem of \emph{pruning} a classification tree, that is, selecting a suitable subtree that balances bias and variance, in common situations with inhomogeneous training data. Namely, assuming access to mostly data from a…
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…
$\Lambda$-coalescents model genealogies of samples of individuals from a large population by means of a family tree whose branches have lengths. The tree's leaves represent the individuals, and the lengths of the adjacent edges indicate the…
This paper contributes to the multivariate analysis of marked spatio-temporal point process data by introducing different partial point characteristics and extending the spatial dependence graph model formalism. Our approach yields a…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…
A characterization of finite homogeneous ultrametric spaces and finite ultrametric spaces generated by unrooted labeled trees is found in terms of representing trees. A characterization of finite ultrametric spaces having perfect strictly…
The star-shaped $\Lambda$-coalescent and corresponding $\Lambda$-Fleming-Viot process where the $\Lambda$ measure has a single atom at unity are studied in this paper. The transition functions and stationary distribution of the…
We propose a novel algorithm for optimizing multivariate linear threshold functions as split functions of decision trees to create improved Random Forest classifiers. Standard tree induction methods resort to sampling and exhaustive search…
Our results concern geometry of a manifold endowed with a pair of complementary orthogonal distributions (plane fields) and a time-dependent Riemannian metric. The work begins with formulae concerning deformations of geometric quantities as…
We extend de Finetti's [Ann. Inst. H. Poincar\'{e} 7 (1937) 1--68] notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than…
Considering a random binary tree with $n$ labelled leaves, we use a pruning procedure on this tree in order to construct a $\beta(3/2,1/2)$-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning…
Functional-structural models provide detailed representations of tree growth and their application to forestry seems full of prospects. However, owing to the complexity of tree architecture, parametric identification of such models remains…
We suggest a generalization of the Feynman path integral to an integral over random surfaces. The proposed action is proportional to the linear size of the random surfaces and is called gonihedric. The convergence and the properties of the…
We investigate how to model exchangeability with choice functions. Exchangeability is a structural assessment on a sequence of uncertain variables. We show how such assessments are a special indifference assessment, and how that leads to a…
We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…