Gibbs' Measures on Combinatorial Objects and the Central Limit Theorem for an Exponential Family of Random Trees

DOI10.1017/S0269964800000279zbMath1133.60303MaRDI QIDQ3415827

J. Michael Steele

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Combinatorial probability (60C05)

Related Items (8)

Central and local limit theorems for the coefficients of polynomials associated with the Laguerre ones ⋮ A Gibbsian random tree with nearest neighbour interaction ⋮ Smoothed analysis of partitioning algorithms for Euclidean functionals ⋮ Asymptotic normality of a class of discrete power series distributions ⋮ Asymptotic normality of the coefficients of polynomials associated with the Gegenbauer ones ⋮ Normal convergence problem? Two moments and a recurrence may be the clues ⋮ Tree and forest weights and their application to nonuniform random graphs ⋮ A unified treatment for the asymptotic normality of the coefficients of polynomials related to orthogonal ones

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Application of the Berry-Esseen inequality to combinatorial estimates
• Hermite polynomials and a duality relation for matchings polynomials
• Matching behaviour is asymptotically normal
• Theory of monomer-dimer systems
• Central and local limit theorems applied to asymptotic enumeration
• On the theory of the matching polynomial
• Stirling Behavior is Asymptotically Normal
• Another Enumeration of Trees

This page was built for publication: Gibbs' Measures on Combinatorial Objects and the Central Limit Theorem for an Exponential Family of Random Trees