Related papers: Distribution of tree parameters by martingale appr…
Neutral macroevolutionary models, such as the Yule model, give rise to a probability distribution on the set of discrete rooted binary trees over a given leaf set. Such models can provide a signal as to the approximate location of the root…
Random survival forest and survival trees are popular models in statistics and machine learning. However, there is a lack of general understanding regarding consistency, splitting rules and influence of the censoring mechanism. In this…
A degree sequence is a sequence ${\bf s}=(N_i,i\geq 0)$ of non-negative integers satisfying $1+\sum_i iN_i=\sum_i N_i<\infty$. We are interested in the uniform distribution $\mathbb{P}_{{\bf s}}$ on rooted plane trees whose degree sequence…
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a…
Starting from any graph on $\{1, \ldots, n\}$, consider the Markov chain where at each time-step a uniformly chosen vertex is disconnected from all of its neighbors and reconnected to another uniformly chosen vertex. This Markov chain has a…
The tree-depth is a parameter introduced under several names as a measure of sparsity of a graph. We compute asymptotic values of the tree-depth of random graphs. For dense graphs, p>> 1/n, the tree-depth of a random graph G is a.a.s.…
Respondent-Driven Sampling is a popular technique for sampling hidden populations. This paper models Respondent-Driven Sampling as a Markov process indexed by a tree. Our main results show that the Volz-Heckathorn estimator is…
We present an integrated approach for structure and parameter estimation in latent tree graphical models. Our overall approach follows a "divide-and-conquer" strategy that learns models over small groups of variables and iteratively merges…
There are some real life issues that are exists in nature which has early failure. This type of problems can be modelled either by a complex distribution having more than one parameter or by finite mixture of some distribution. In this…
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$…
In this paper, we consider the empirical spectral distribution of the sample correlation matrix and investigate its asymptotic behavior under mild assumptions on the data's distribution, when dimension and sample size increase at the same…
By considering a continuous pruning procedure on Aldous's Brownian tree, we construct a random variable $\Theta$ which is distributed, conditionally given the tree, according to the probability law introduced by Janson as the limit…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…
We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model…
Random forests have become an established tool for classification and regression, in particular in high-dimensional settings and in the presence of complex predictor-response relationships. For bounded outcome variables restricted to the…
We consider the Laplacian on a rooted metric tree graph with branching number $ K \geq 2 $ and random edge lengths given by independent and identically distributed bounded variables. Our main result is the stability of the absolutely…
Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…
Ordered pivotal sampling is one of the simplest algorithm to perform without-replacement unequal probability sampling. It has found uses in the context of longitudinal surveys and spatial sampling, and enables in particular a good spatial…
We study a class of rooted trees with a substitution type structure. These trees are not necessarily regular, but exhibit a lot of symmetries. We consider nearest neighbor operators which reflect the symmetries of the trees. The spectrum of…
We prove delocalization for the Anderson model on an infinite regular tree (or Cayley graph or Bethe lattice) at low disorder. This extends earlier results of Klein and Aizenman--Warzel by filling in the previously missing parts of the…