Gaussian limiting distributions for the number of components in combinatorial structures

DOI10.1016/0097-3165(90)90056-3zbMath0691.60035OpenAlexW2092866774MaRDI QIDQ582688

Michèle Soria, Philippe Flajolet

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00075742/file/RR-0809.pdf

zbMATH Keywords

generating functionrandom mappingcontinuity theorem for characteristic functionsnumber of cycles in a random permutation

Mathematics Subject Classification ID

Gaussian processes (60G15) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05)

Related Items (47)

Limits of logarithmic combinatorial structures. ⋮ Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution ⋮ The least common multiple of random sets in polynomial rings over finite fields ⋮ Central and local limit theorems for the coefficients of polynomials associated with the Laguerre ones ⋮ On moment sequences and mixed Poisson distributions ⋮ On random polynomials over finite fields ⋮ Asymptotic expansions for the Stirling numbers of the first kind ⋮ Random polynomials over a finite field ⋮ The order of a typical matrix with entries in a finite field ⋮ Factorization in F_q[x and Brownian Motion] ⋮ Extended admissible functions and Gaussian limiting distributions ⋮ Limiting distributions for the number of distinct component sizes in relational structures ⋮ Asymptotic normality of a class of bivariate-multivariate discrete power series distributions ⋮ Asymptotics of combinatorial structures with large smallest component ⋮ Large deviations for combinatorial distributions. I: Central limit theorems ⋮ On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X\)] ⋮ Order statistics for decomposable combinatorial structures ⋮ Generalizing Zeckendorf's theorem to \(f\)-decompositions ⋮ Classical and almost sure local limit theorems ⋮ A \(q\)-analogue of the Stirling formula and a continuous limiting behaviour of the \(q\)-binomial distribution -- numerical calculations ⋮ Efficient generation of random derangements with the expected distribution of cycle lengths ⋮ Analytic number theory for 0-cycles ⋮ Unnamed Item ⋮ Automatic average-case analysis of algorithms ⋮ Enumeration of decomposable combinatorial structures with restricted patterns ⋮ On Poisson approximations for the Ewens sampling formula when the mutation parameter grows with the sample size ⋮ Marking in combinatorial constructions: Generating functions and limiting distributions ⋮ Steepest descent method and limiting distributions in combinatorial analysis ⋮ Asymptotic normality of a class of discrete power series distributions ⋮ Central and local limit theorems applied to asymptotic enumeration. IV: Multivariate generating functions ⋮ General combinatorial schemas: Gaussian limit distributions and exponential tails ⋮ An asymptotic expansion for theq-binomial series using singularity analysis for generating functions ⋮ Counting irreducible factors of polynomials over a finite field ⋮ Asymptotic normality of the coefficients of polynomials associated with the Gegenbauer ones ⋮ A central limit theorem on gl_n (f_q ) ⋮ Limit theorems for the number of summands in integer partitions ⋮ The cycle structure of two rows in a random Latin square ⋮ Analytic analysis of algorithms ⋮ An Application of Polya's Enumeration Theorem to Partitions of Subsets of Positive Integers ⋮ Local limit theorems for generalized scheme of allocation of particles into ordered cells ⋮ On the Lambert \(w\) function ⋮ A unified treatment for the asymptotic normality of the coefficients of polynomials related to orthogonal ones ⋮ Large deviations of combinatorial distributions. II: Local limit theorems ⋮ On the degrees of irreducible factors of polynomials over a finite field ⋮ Analytic variations on quadtrees ⋮ Continuous Stieltjes-Wigert limiting behaviour of a family of confluent \(q\)-Chu-Vandermonde distributions ⋮ On the internal structure of random recursive circuits

Cites Work

• A note on the number of functional digraphs
• On random mapping patterns
• Some methods for computing component distribution probabilities in relational structures
• Periodic oscillations of coefficients of power series that satisfy functional equations
• The average height of binary trees and other simple trees
• Central and local limit theorems for the coefficients of polynomials of binomial type
• The method of Darboux
• Central and local limit theorems applied to asymptotic enumeration
• The number of trees
• Ensembles de polynômes irréductibles et théorèmes de densité
• Singularity Analysis of Generating Functions
• Multisets of Aperiodic Cycles
• On the Altitude of Nodes in Random Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gaussian limiting distributions for the number of components in combinatorial structures