Some methods for computing component distribution probabilities in relational structures

DOI10.1016/0012-365X(87)90119-1zbMath0649.05012MaRDI QIDQ1105605

Kevin J. Compton

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

probabilitynumber of componentsComponent distribution problemsrandom relational structure

Mathematics Subject Classification ID

Combinatorial probability (60C05) Enumerative combinatorics (05A99)

Related Items

Asymptotics of combinatorial structures with large smallest component, The number of clone orderings, Order statistics for decomposable combinatorial structures, Automatic average-case analysis of algorithms, Random Graphs from a Minor-Closed Class, Counting finite models, Steepest descent method and limiting distributions in combinatorial analysis, Asymptotic normality of a class of discrete power series distributions, General combinatorial schemas: Gaussian limit distributions and exponential tails, Taxonomic classes of sets, Gaussian limiting distributions for the number of components in combinatorial structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of trees in a random forest
• A logical approach to asymptotic combinatorics I. First order properties
• A logical approach to asymptotic combinatorics. II: Monadic second-order properties
• A Generalisation of Stirling's Formula.
• Counting Interval Graphs
• Asymptotic Methods in Enumeration
• An Asymptotic Expansion for the Coefficients of Some Formal Power Series
• A Relationship Between two Sequences
• Ordered Cycle Lengths in a Random Permutation
• A Relationship between Two Sequences Iii
• Asymptotic Relations Between Enumerative Functions in Graph Theory
• The Expected Number of Components Under a Random Mapping Function
• Probability of Indecomposability of a Random Mapping Function