Related papers: On the re-rooting invariance property of Levy tree…
A program invariant is a property that holds for every execution of the program. Recent work suggest to infer likely-only invariants, via dynamic analysis. A likely invariant is a property that holds for some executions but is not…
By extending the breadth first search algorithm to any d-type critical or subcritical irreducible branching forest, we show that such forests may be encoded through d independent, integer valued, d-dimensional random walks. An application…
We prove a multivariate Lagrange-Good formula for functionals of uncountably many variables and investigate its relation with inversion formulas using trees. We clarify the cancellations that take place between the two aforementioned…
We study the problem of enumerating Braess edges for Kemeny's constant in trees. We obtain bounds and asympotic results for the number of Braess edges in some families of trees.
We study three different kinds of embeddings of tree patterns: weakly-injective, ancestor-preserving, and lca-preserving. While each of them is often referred to as injective embedding, they form a proper hierarchy and their computational…
We study a branching-process random iterated function system (RIFS) defined by a recursive replacement of leaves by finite subtrees at strictly smaller contraction scales. This construction yields a tree-valued, infinite-depth random…
We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the $\alpha$-stable looptrees of Curien and Kortchemski, where…
We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…
In the broadcasting problem on trees, a $\{-1,1\}$-message originating in an unknown node is passed along the tree with a certain error probability $q$. The goal is to estimate the original message without knowing the order in which the…
A genus one labeled circle tree is a tree with its vertices on a circle, such that together they can be embedded in a surface of genus one, but not of genus zero. We define an e-reduction process whereby a special type of subtree, called an…
In this paper we introduce and study several multivariate, heavy-tailed distribution classes, and we explore their closure properties and their applications. We consider the class of multivariate, positively decreasing distributions, and…
Random forests is a state-of-the-art supervised machine learning method which behaves well in high-dimensional settings although some limitations may happen when $p$, the number of predictors, is much larger than the number of observations…
We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous Cayley formula, which states that the number of labeled…
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…
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.…
Consider a tree $T=(V,E)$ with root $\circ$ and edge length function $\ell:E\to\mathbb{R}_+$. The phylogenetic covariance matrix of $T$ is the matrix $C$ with rows and columns indexed by $L$, the leaf set of $T$, with entries…
We study the virial expansion of mixtures of countably many different types of particles. The main tool is the Lagrange-Good inversion formula, which has other applications such as counting coloured trees or studying probability generating…
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…
The LR-drawing-method is a method of drawing an ordered rooted binary tree based on drawing one root-to-leaf path on a vertical line and attaching recursively obtained drawings of the subtrees on the left and right. In this paper, we study…
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…