Random Trees
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Random trees. Abstracts from the workshop held January 18th -- January 24th, 2009.
- Random enriched trees with applications to random graphs
- Normal limiting distribution of the size of binary interval trees
- Non-fringe subtrees in conditioned Galton-Watson trees
- On the distribution of betweenness centrality in random trees
- Reductions of binary trees and lattice paths induced by the register function
- Edgeworth expansions for profiles of lattice branching random walks
- General Edgeworth expansions with applications to profiles of random trees
- A functional limit theorem for the profile of random recursive trees
- A bijection of plane increasing trees with relaxed binary trees of right height at most one
- On the number of unary-binary tree-like structures with restrictions on the unary height
- An introduction to random trees
- Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
- The properties of random trees
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- The number of rooted trees of given depth
- Random planar maps and graphs with minimum degree two and three
- Metric dimension of critical Galton-Watson trees and linear preferential attachment trees
- Geometry of weighted recursive and affine preferential attachment trees
- Correction to: ``How linear reinforcement affects Donsker's theorem for empirical processes
- Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
- On general subtrees of a conditioned Galton-Watson tree
- Conformal growth rates and spectral geometry on distributional limits of graphs
- On the expected number of perfect matchings in cubic planar graphs
- On a two-parameter Yule-Simon distribution
- The sum of powers of subtree sizes for conditioned Galton-Watson trees
- Correction terms for the height of weighted recursive trees
- Trees with power-like height dependent weight
- Counting embeddings of rooted trees into families of rooted trees
- Enumeration of chordal planar graphs and maps
- On joint properties of vertices with a given degree or label in the random recursive tree
- Distinct fringe subtrees in random trees
- Broadcasting on random recursive trees
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
- Insertion depth in power-weight trees
- Correlated randomly growing graphs
- Central limit theorems for additive functionals and fringe trees in tries
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Short cycles in high genus unicellular maps
- Root finding algorithms and persistence of Jordan centrality in growing random trees
- A half-normal distribution scheme for generating functions
- On the number of increasing trees with label repetitions
- How linear reinforcement affects Donsker's theorem for empirical processes
- Universal limits of substitution-closed permutation classes
- Counting phylogenetic networks of level 1 and 2
- The \(k\)-cut model in deterministic and random trees
- Universal singular exponents in catalytic variable equations
- Maximal clades in random binary search trees
- Supercritical percolation on large scale-free random trees
- Maximal independent sets and maximal matchings in series-parallel and related graph classes
- Pattern occurrences in random planar maps
- A central limit theorem for almost local additive tree functionals
- Random self-similar trees: a mathematical theory of Horton laws
- Statistical properties of lambda terms
- An involution on increasing trees
- On the limiting distribution of the metric dimension for random forests
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
- Thin tails of fixed points of the nonhomogeneous smoothing transform
- Fringe analysis of plane trees related to cutting and pruning
- The height of the latest common ancestor of two randomly chosen leaves from a (sub-)critical Galton-Watson tree
- \(k\)-cut on paths and some trees
- Depth in bucket recursive trees with variable capacities of buckets
- Extremal statistics on non-crossing configurations
- Search trees: metric aspects and strong limit theorems
- A functional limit theorem for the profile of search trees
- Associative and commutative tree representations for Boolean functions
- Random recursive trees: a boundary theory approach
- Spanning trees in random series-parallel graphs
- Finding the seed of uniform attachment trees
- Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study
- Profile of random exponential recursive trees
- Limit laws for two distance-based indices in random recursive tree models
- Computational properties of the arithmetic-geometric index
- Continuous-time digital search tree and a border aggregation model
- Asymptotic expectation of protected node profile in random digital search trees
- Local convergence of random planar graphs
- Quantification and statistical analysis of topological features of recursive trees
- Multiway trees of maximum and minimum probability under the random permutation model
- Persisting randomness in randomly growing discrete structures: graphs and search trees
- Randomized rumor spreading in poorly connected small-world networks
- The shape of random tanglegrams
- Persisting randomness in randomly growing discrete structures: graphs and search trees
- Parking functions for mappings
- Almost giant clusters for percolation on large trees with logarithmic heights
- Universal exponents and tail estimates in the enumeration of planar maps
- Psi-series method for equality of random trees and quadratic convolution recurrences
- Depth properties of scaled attachment random recursive trees
- The height of multiple edge plane trees
- The maximum degree of random planar graphs
- Schröder's problems and scaling limits of random trees
- Trees
- 3-Connected Cores In Random Planar Graphs
- An asymptotic analysis of labeled and unlabeled k-trees
- Limit theorems for depths and distances in weighted random b-ary recursive trees
- The distribution of height and diameter in random non-plane binary trees
- Triangles in random cubic planar graphs
- High degrees in recursive trees
- The existence of a giant cluster for percolation on large Crump–Mode–Jagers trees
- Asymptotic results on Hoppe trees and their variations
- Almost sure asymptotic expansions for profiles of simply generated random trees
This page was built for publication: Random Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3516035)
