Results 1 to 10 of about 744,531 (188)
Acta Mathematica Hungarica, 2014 Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs.
Deák, Attila
core +9 more sources
Ergodic Theory and Dynamical Systems, 2012 We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree.
Aldous +5 more
core +4 more sources
Fragmentation of Random Trees [PDF]
Journal of Physics A: Mathematical and Theoretical, 2014 We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node.
Ben-Naim, E., Kalay, Z.
core +4 more sources
Random ultrametric trees and applications* [PDF]
ESAIM: Proceedings and Surveys, 2017 Ultrametric trees are trees whose leaves lie at the same distance from the root. They are used to model the genealogy of a population of particles co-existing at the same point in time.
Lambert Amaury
doaj +3 more sources
Annales de la Faculté des sciences de Toulouse : Mathématiques, 2006 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 ...
Gall, J. F. Le
core +5 more sources
On random trees and forests [PDF]
ESAIM: Proceedings and Surveys, 2023 The first talk at the session Random trees and random forests “Journée MAS” (27/08/2021) was presented by I. Kortchemski. After a general up-to-date introduction to local and scaling limits of Bienaymé trees (which are discrete branching trees), he ...
Contat Alice +4 more
doaj +1 more source
Optimal randomized classification trees [PDF]
Computers & Operations Research, 2021 This research has been financed in part by research projects EC H2020 MSCA RISE NeEDS (Grant agreement ID: 822214), FQM-329 and P18-FR-2369 (Junta de Andaluc\'ia), and PID2019-110886RB-I00 (Ministerio de Ciencia, Innovaci\'on y Universidades, Spain).
Blanquero, Rafael +3 more
openaire +3 more sources
Profiles of random trees: plane-oriented recursive trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We summarize several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance, asymptotic approximations of the expected width and the ...
Hsien-Kuei Hwang
doaj +1 more source
Conditioned Galton-Watson trees do not grow [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 An example is given which shows that, in general, conditioned Galton-Watson trees cannot be obtained by adding vertices one by one, while this can be done in some important but special cases, as shown by Luczak and Winkler.
Svante Janson
doaj +1 more source
Extremely randomized trees [PDF]
Machine Learning, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Geurts, Pierre +2 more
openaire +5 more sources