Probabilistic construction of proportional graphs

DOI10.1002/RSA.3240030203MaRDI QIDQ3990216zbMATH OpenOpenAlexFDO

Authors Svante Janson, Joel Spencer

Publication date 28 June 1992

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240030203

zbMATH Keywords

Bernoulli graphproportional graphsrandom graphtriad counts

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4101220
• Probabilistic Bigraphs
• Probabilistic Inductive Classes of Graphs
• Probability graphs
• Interpolation of probability measures on graphs
• scientific article; zbMATH DE number 4205985
• scientific article; zbMATH DE number 4196022
• Probability distributions with summary graph structure
• Probabilistic methods for decomposition dimension of graphs

Cites work

• A central limit theorem for decomposable random variables with applications to random graphs
• A functional limit theorem for random graphs with applications to subgraph count statistics
• The asymptotic distributions of generalized U-statistics with applications to random graphs

Cited in

(7)

• How unproportional must a graph be?
• Proportional graphs
• An example of a superproportional graph
• Existence of proportional graphs
• A graph Fourier transform and proportional graphs
• How balanced can permutations be?
• A graphical study of comparative probabilities

This page was built for publication: Probabilistic construction of proportional graphs

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