On the Altitude of Nodes in Random Trees
From MaRDI portal
Publication:4175300
DOI10.4153/CJM-1978-085-0zbMath0394.05015OpenAlexW1983188796WikidataQ105685674 ScholiaQ105685674MaRDI QIDQ4175300
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
Related Items
Uniform recursive trees: branching structure and simple random downward walk, The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees, Simply generated trees, B-series and Wigner processes, The shape of large Galton-Watson trees with possibly infinite variance, A calculus for the random generation of labelled combinatorial structures, The number of trees with a 1-factor, The distribution of height and diameter in random non-plane binary trees, Analytic models and ambiguity of context-free languages, Monotonically labelled Motzkin trees, Random walks, heat equation and distributed algorithms, Local limit approximations for Lagrangian distributions, Level number sequences for trees, On Ramanujan's \(Q\)-function, On the lexicographical generation of compressed codes, Depth Properties of scaled attachment random recursive trees, A unifying approach for proving hook-length formulas for weighted tree families, On the number of induced subgraphs of trees, Profiles of ordered trees with mutation and associated Riordan matrices, Survival under random coverings of trees, Simulating theta random variates, Asymptotic Rayleigh instantaneous unit hydrograph, On the average hyperoscillations of planted plane trees, Localization in quiver moduli spaces, Large deviations for combinatorial distributions. I: Central limit theorems, Largest component in random combinatorial structures, On the degree distribution of the nodes in increasing trees, On the distribution of betweenness centrality in random trees, Schröder’s problems and scaling limits of random trees, Profile of random exponential recursive trees, Limiting distributions for the number of inversions in labelled tree families, Equality of Shapley value and fair proportion index in phylogenetic trees, On combinatorial properties and the zero distribution of certain Sheffer sequences, A criterion for sharpness in tree enumeration and the asymptotic number of triangulations in Kuperberg's \(G_2\) spider, On the representation of simply generated trees by leftist trees, Generalized covariances of multi-dimensional Brownian excursion local times., Decomposable branching processes with a fixed extinction moment, Condensation in nongeneric trees, On the shape of random Pólya structures, Long and short paths in uniform random recursive dags, Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation, A quantitative study of pure parallel processes, Spectral dimension of trees with a unique infinite spine, Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees, Algebraic simplification in computer algebra: an analysis of bottom-up algorithms, Heavy subtrees of Galton-Watson trees with an application to Apollonian networks, The average height of binary trees and other simple trees, The outer-distance of nodes in random trees, The depth first processes of Galton-Watson trees converge to the same Brownian excursion, Cutting down trees with a Markov chainsaw, Automatic average-case analysis of algorithms, Uniform random generation of expressions respecting algebraic identities, Emergent network modularity, Random trees in queueing systems with deadlines, On the number of unary-binary tree-like structures with restrictions on the unary height, The Horton-Strahler number of conditioned Galton-Watson trees, Distances in random plane-oriented recursive trees, Additive weights of a special class of nonuniformly distributed backtrack trees, Average-case analysis on simple families of trees using a balanced probability model, Unnamed Item, A distributional study of the path edge-covering numbers for random trees, On the distribution of distances between specified nodes in increasing trees, Singularity analysis, Hadamard products, and tree recurrences, Random maps, coalescing saddles, singularity analysis, and Airy phenomena, A generic approach for the unranking of labeled combinatorial classes, Reflected Brownian bridge local time conditioned on its local time at the origin, On the altitude of specified nodes in random trees, Enumeration results for alternating tree families, The shape of unlabeled rooted random trees, Branching structure of uniform recursive trees, Analysis of three graph parameters for random trees, A functional limit theorem for the profile of \(b\)-ary trees, Patterns in trees, Gaussian limiting distributions for the number of components in combinatorial structures, Area Limit Laws for Symmetry Classes of Staircase Polygons, Generalized gamma approximation with rates for urns, walks and trees, Width and mode of the profile for some random trees of logarithmic height, On \(q\)-functional equations and excursion moments, Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees, Additive weights under the balanced probability model, The expected additive weight of trees, Complexity analysis of term-rewriting systems, The cycle lemma and some applications, The asymptotic behaviour of coefficients of powers of certain generating functions, An analysis of budgeted parallel search on conditional Galton-Watson trees, On the parity of the Wiener index, On an asymptotic method in enumeration, The properties of random trees, On exact simulation algorithms for some distributions related to Jacobi theta functions, Scaling limits for a family of unrooted trees, On the average number of nodes in a subtree of a tree, The sum of powers of subtree sizes for conditioned Galton-Watson trees, Trees with power-like height dependent weight, On the average shape of monotonically labelled tree structures, Analytic combinatorics of non-crossing configurations, Distinct fringe subtrees in random trees, On sets of integers with prescribed gaps, Basic analytic combinatorics of directed lattice paths, Scaling limits of random planar maps with a unique large face, Bandwidths and profiles of trees, Limit distribution for the maximum degree of a random recursive tree, The distance profile of rooted and unrooted simply generated trees, (Un)expected path lengths of asymmetric binary search trees, Normal Limit Law for Protected Node Profile of Random Recursive Trees, A unified approach to the analysis of Horton‐Strahler parameters of binary tree structures, On the covariance of the level sizes in random recursive trees, Random stable-type minimal factorizations of the n-cycle, Expectation transfer between branching processes and random trees, Random recursive forests, Connection reliabilities in stochastic acyclic networks, Balanced ordered trees, The Distribution of Heights of Binary Trees and Other Simple Trees, Components of Random Forests, On the average number of registers needed to evaluate a special class of backtrack trees, Unlabeled trees: Distribution of the maximum degree, The Variance of Level Numbers in Certain Families of Trees, Enumeration of trees by inversions, Random generation of colored trees, Leaf multiplicity in a Bienaym\'e-Galton-Watson tree, Root estimation in Galton–Watson trees, Compaction for two models of logarithmic‐depth trees: Analysis and experiments, A combinatorial link between labelled graphs and increasingly labelled Schröder trees, Occupancy problems related to the generalized Stirling numbers, Trees with exponential height dependent weight, On random trees and forests, Central Limit Theorems for Additive Tree Parameters with Small Toll Functions, Formulae and Asymptotics for Coefficients of Algebraic Functions, Shape Measures of Random Increasing k-trees, Simply Generated Non-Crossing Partitions, On maximal independent sets of nodes in trees, Asymptotic expansions for sub-critical lagrangean forms, A complexity calculus for recursive tree algorithms, The height of increasing trees, On the combinatorics of leftist trees, The climbing depth of random trees, Level of nodes in increasing trees revisited, The structure and distances in Yule recursive trees, The Wiener Index of simply generated random trees, Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees, The Distribution of Patterns in Random Trees, Analytic analysis of algorithms, On the inner structure of multidimensional simply generated trees, On the inner structure of multidimensional simply generated trees, On the Multiplicative Zagreb Indices of Bucket Recursive Trees, Speeding up non-Markovian first-passage percolation with a few extra edges, On the shape of the fringe of various types of random trees, Ladder variables, internal structure of Galton–Watson trees and finite branching random walks, Random cutting and records in deterministic and random trees, A review of random graphs, On the average shape of simply generated families of trees
