Related papers: Exact Hausdorff and packing measures for random se…
In this paper, several properties of plain-oriented recursive trees (PORTs) are uncovered. Specifically, we investigate the degree profile of a PORT by determining the exact probability mass function of the degree of a node with a fixed…
We develop a finite-sample, design-based theory for random forests in which each tree is a randomized conditional predictor acting on fixed covariates and the forest is their Monte Carlo average. An exact variance identity separates Monte…
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of…
We show, under natural conditions, that uniform rooted trees with fixed degree sequence converge after renormalization toward inhomogeneous continuum random trees (ICRT). We also provide a sharp upper-bound for the tail of their heights. We…
Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…
Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…
In this paper we study a class of random Cantor sets. We determine their almost sure Hausdorff, packing, box, and Assouad dimensions. From a topological point of view, we also compute their typical dimensions in the sense of Baire category.…
We define, analyze, and give efficient algorithms for two kinds of distance measures for rooted and unrooted phylogenies. For rooted trees, our measures are based on the topologies the input trees induce on triplets; that is, on…
In this paper we present with algebraic trees a novel notion of (continuum) trees which generalizes countable graph-theoretic trees to (potentially) uncountable structures. For that purpose we focus on the tree structure given by the branch…
We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…
We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…
The Poisson boundary of a finite direct product of affine automorphism groups of homogeneous trees is considered. The Poisson boundary is shown to be a product of ends of trees with a hitting measure for spread-out, aperiodic measures of…
Let $\theta$ be a Bernoulli measure which is stationary for a random walk generated by finitely many contracting rational affine dilations of $\mathbb{R}^d$, and let $\mathcal{K} = \mathrm{supp}(\theta)$ be the corresponding attractor. An…
We consider an infinite extension $K$ of a local field of zero characteristic which is a union of an increasing sequence of finite extensions. $K$ is equipped with an inductive limit topology; its conjugate $\bar{K}$ is a completion of $K$…
We consider a family of CIFSs of the generalized complex continued fractions with a complex parameter space. We show that for each CIFS of the family, the Hausdorff measure of the limit set of the CIFS with respect to the Hausdorff…
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…
Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…
We consider the probability that a spanning tree chosen uniformly at random from a graph can be partitioned into a fixed number $k$ of trees of equal size by removing $k-1$ edges. In that case, the spanning tree is called {\em splittable}.…
Shortly after the determination of the first protein x-ray crystal structures, researchers analyzed their cores and reported packing fractions $\phi \approx 0.75$, a value that is similar to close packing equal-sized spheres. A limitation…