Normal convergence problem? Two moments and a recurrence may be the clues

DOI10.1214/aoap/1029962872zbMath0960.60014OpenAlexW2063369100MaRDI QIDQ1578596

Boris G. Pittel

Publication date: 4 September 2000

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1029962872

zbMATH Keywords

independence numbernormal convergencenumber of linear extensionsbranching (Galton-Watson) processescoefficients of generating functionsnumber of vertices of degreerandom labelled rooted trees

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Graph theory (05C99)

Related Items (12)

Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs ⋮ Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ Phase changes in randomm-ary search trees and generalized quicksort ⋮ Asymptotic distribution of two-protected nodes in random binary search trees ⋮ Analysis of three graph parameters for random trees ⋮ On the independent set sequence of a tree ⋮ Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs ⋮ Limit laws for the Randić index of random binary tree models ⋮ The sum of powers of subtree sizes for conditioned Galton-Watson trees ⋮ On the distribution of the number of Young tableaux for a uniformly random diagram

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The average performance of the greedy matching algorithm
• The expected linearity of a simple equivalence algorithm
• The standard additive coalescent
• Linear extensions of a random partial order
• On a likely shape of the random Ferrers diagram
• Limit laws for local counters in random binary search trees
• Gibbs' Measures on Combinatorial Objects and the Central Limit Theorem for an Exponential Family of Random Trees
• On the Expected Performance of Path Compression Algorithms
• An urn model for cannibal behavior
• On maximal independent sets of nodes in trees
• A Recurrence Related to Trees
• On tree census and the giant component in sparse random graphs
• Packing and covering constants for certain families of trees. I
• Packing and Covering Constants for Certain Families of Trees. II
• On some problems of the statistical theory of partitions with application to characters of the symmetric group. III
• Analysis of the space of search trees under the random insertion algorithm
• On the log-product of the subtree-sizes of random trees
• A Note on the Theory of Moment Generating Functions

This page was built for publication: Normal convergence problem? Two moments and a recurrence may be the clues