On the Altitude of Nodes in Random Trees
From MaRDI portal
Publication:4175300
DOI10.4153/CJM-1978-085-0zbMATH Open0394.05015OpenAlexW1983188796WikidataQ105685674 ScholiaQ105685674MaRDI QIDQ4175300FDOQ4175300
Authors: A. Meir, J. W. Moon
Publication date: 1978
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1978-085-0
TreesWidthBinary TreesRandom TreesAltitude of NodesLabeled TreesRecursive TreesRooted TreeRooted Unlabeled Trees
Cited In (only showing first 100 items - show all)
- Leaf multiplicity in a Bienaym\'e-Galton-Watson tree
- Title not available (Why is that?)
- A complexity calculus for recursive tree algorithms
- The Distribution of Heights of Binary Trees and Other Simple Trees
- Distances in random plane-oriented recursive trees
- Average-case analysis on simple families of trees using a balanced probability model
- Long and short paths in uniform random recursive dags
- The height of increasing trees
- Components of Random Forests
- Uniform random generation of expressions respecting algebraic identities
- Depth properties of scaled attachment random recursive trees
- Random cutting and records in deterministic and random trees
- Analytic models and ambiguity of context-free languages
- Large deviations for combinatorial distributions. I: Central limit theorems
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- On the covariance of the level sizes in random recursive trees
- Simply generated trees, B-series and Wigner processes
- The shape of unlabeled rooted random trees
- On the lexicographical generation of compressed codes
- Level of nodes in increasing trees revisited
- Random generation of colored trees
- Gaussian limiting distributions for the number of components in combinatorial structures
- Enumeration of trees by inversions
- A unifying approach for proving hook-length formulas for weighted tree families
- Spectral dimension of trees with a unique infinite spine
- Enumeration results for alternating tree families
- On sets of integers with prescribed gaps
- Bandwidths and profiles of trees
- The average height of binary trees and other simple trees
- Condensation in nongeneric trees
- On \(q\)-functional equations and excursion moments
- Complexity analysis of term-rewriting systems
- On an asymptotic method in enumeration
- On the average number of nodes in a subtree of a tree
- The Distribution of Patterns in Random Trees
- On the parity of the Wiener index
- Branching structure of uniform recursive trees
- Largest component in random combinatorial structures
- On the average hyperoscillations of planted plane trees
- Random recursive forests
- The number of trees with a 1-factor
- Analytic combinatorics of non-crossing configurations
- Central limit theorems for additive tree parameters with small toll functions
- Basic analytic combinatorics of directed lattice paths
- A functional limit theorem for the profile of \(b\)-ary trees
- Width and mode of the profile for some random trees of logarithmic height
- Cutting down trees with a Markov chainsaw
- Ladder variables, internal structure of Galton–Watson trees and finite branching random walks
- On the shape of the fringe of various types of random trees
- On maximal independent sets of nodes in trees
- Random walks, heat equation and distributed algorithms
- The cycle lemma and some applications
- A generic approach for the unranking of labeled combinatorial classes
- Level number sequences for trees
- Uniform recursive trees: branching structure and simple random downward walk
- On exact simulation algorithms for some distributions related to Jacobi theta functions
- The depth first processes of Galton-Watson trees converge to the same Brownian excursion
- On the degree distribution of the nodes in increasing trees
- Profiles of ordered trees with mutation and associated Riordan matrices
- Decomposable branching processes with a fixed extinction moment
- A review of random graphs
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- Generalized gamma approximation with rates for urns, walks and trees
- Singularity analysis, Hadamard products, and tree recurrences
- On Ramanujan's \(Q\)-function
- Localization in quiver moduli spaces
- Patterns in trees
- On the average shape of monotonically labelled tree structures
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena
- Limit distribution for the maximum degree of a random recursive tree
- Limiting distributions for the number of inversions in labelled tree families
- Scaling limits of random planar maps with a unique large face
- The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees
- The properties of random trees
- Schröder's problems and scaling limits of random trees
- Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
- The shape of large Galton-Watson trees with possibly infinite variance
- The Wiener Index of simply generated random trees
- Analytic analysis of algorithms
- The distribution of height and diameter in random non-plane binary trees
- A calculus for the random generation of labelled combinatorial structures
- Automatic average-case analysis of algorithms
- Random trees in queueing systems with deadlines
- Formulae and asymptotics for coefficients of algebraic functions
- Monotonically labelled Motzkin trees
- Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
- Occupancy problems related to the generalized Stirling numbers
- Scaling limits for a family of unrooted trees
- On the representation of simply generated trees by leftist trees
- Generalized covariances of multi-dimensional Brownian excursion local times.
- On the number of induced subgraphs of trees
- On the distribution of distances between specified nodes in increasing trees
- Analysis of three graph parameters for random trees
- On the Multiplicative Zagreb Indices of Bucket Recursive Trees
- The distance profile of rooted and unrooted simply generated trees
- Normal Limit Law for Protected Node Profile of Random Recursive Trees
- Unlabeled trees: Distribution of the maximum degree
- Connection reliabilities in stochastic acyclic networks
- Asymptotic Rayleigh instantaneous unit hydrograph
- Shape measures of random increasing \(k\)-trees
This page was built for publication: On the Altitude of Nodes in Random Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175300)