Results 61 to 70 of about 5,579,561 (370)
Journal of Machine Learning Research, 2013 23 pages, 4 ...
Shah, RD, Meinshausen, N
openaire +4 more sources
A simple and effective approach to quantitatively characterize structural complexity
Scientific Reports, 2021 This study brings insight into interpreting forest structural diversity and explore the classification of individuals according to the distribution of the neighbours in natural forests. Natural forest communities with different latitudes and distribution
Gongqiao Zhang +3 more
doaj +1 more source
Annales de la Faculté des sciences de Toulouse : Mathématiques, 2009 We survey recent developments about random real trees, whose prototype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in particular of the relations between discrete Galton-Watson trees and continuous random trees.
openaire +2 more sources
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We give a unified treatment of the limit, as the size tends to infinity, of random simply generated trees, including both the well-known result in the standard case of critical Galton-Watson trees and similar but less well-known results in the other ...
Svante Janson
doaj +1 more source
Stable trees as mixings of inhomogeneous continuum random trees [PDF]
arXiv, 2022 It has been claimed in Aldous, Miermont and Pitman [PTRF, 2004] that all L\'evy trees are mixings of inhomogeneous continuum random trees. We give a rigorous proof of this claim in the case of a stable branching mechanism, relying on a new procedure for recovering the tree distance from the graphical spanning trees that works simultaneously for stable ...
arxiv
General Edgeworth expansions with applications to profiles of random trees [PDF]
, 2016 We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity.
Z. Kabluchko +2 more
semanticscholar +1 more source
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs [PDF]
Probability theory and related fields, 2015 One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade (Braunstein et al. in Phys Rev Lett 91(16):168701, 2003; Wu et al.
S. Bhamidi, R. Hofstad, S. Sen
semanticscholar +1 more source
Limit laws for two distance-based indices in random recursive tree models
Acta Universitatis Sapientiae: Informatica, 2022 In this paper, we derive several results related to total path length and Sackin index in two classes of random recursive trees. A limiting distribution of the normalized version of the Sackin index is given by the contraction method in random recursive ...
Naderi Sarkoat +2 more
doaj +1 more source
Random trees and applications [PDF]
Probability Surveys, 2005 We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the convergence in distribution of the contour process of conditioned Galton-Watson trees towards the normalized Brownian
openaire +5 more sources
International Journal of Mathematics and Mathematical Sciences, 2005 The number of local maxima (resp., local minima) in a tree T∈𝒯n rooted at r∈[n] is denoted by Mr(T) (resp., by mr(T)). We find exact formulas as rational functions of n for the expectation and variance of M1(T) and mn(T) when T∈𝒯n is chosen randomly ...
Lane Clark
doaj +1 more source