Some methods for computing component distribution probabilities in relational structures

DOI10.1016/0012-365X(87)90119-1MaRDI QIDQ1105605zbMATH OpenFDO

Authors Kevin J. Compton

Publication date 1987

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

number of componentsprobabilityComponent distribution problemsrandom relational structure

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4203348
• Limiting distributions for the number of distinct component sizes in relational structures
• On random relational structures
• Multi‐level decomposition of probabilistic relations
• On the complexity of inference about probabilistic relational models
• scientific article; zbMATH DE number 3913858
• scientific article; zbMATH DE number 2074037
• Relations into algebras of probabilistic distributions

Cites work

• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3720674 (Why is no real title available?)
• scientific article; zbMATH DE number 3238722 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• scientific article; zbMATH DE number 3344587 (Why is no real title available?)
• scientific article; zbMATH DE number 3373676 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A Generalisation of Stirling's Formula.
• A Relationship Between two Sequences
• A Relationship between Two Sequences Iii
• A logical approach to asymptotic combinatorics I. First order properties
• A logical approach to asymptotic combinatorics. II: Monadic second-order properties
• An Asymptotic Expansion for the Coefficients of Some Formal Power Series
• Asymptotic Methods in Enumeration
• Asymptotic Relations Between Enumerative Functions in Graph Theory
• Counting Interval Graphs
• On the number of trees in a random forest
• Ordered Cycle Lengths in a Random Permutation
• Probability of Indecomposability of a Random Mapping Function
• The Expected Number of Components Under a Random Mapping Function

Cited in

(12)

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

This page was built for publication: Some methods for computing component distribution probabilities in relational structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105605)