Poisson convergence and semi-induced properties of random graphs

DOI10.1017/S0305004100066664zbMath0627.60016MaRDI QIDQ3763307

Michał Karoński, Andrzej Ruciński

Publication date: 1986

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

asymptotic normalityrandom graphcounting subgraphs of random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

Stein's method for conditional central limit theorem, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph, Concentration of measure for the number of isolated vertices in the Erdős-Rényi random graph by size bias couplings, Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models, A central limit theorem for decomposable random variables with applications to random graphs

Cites Work

• Limit theorems for complete subgraphs of random graphs
• On the number of vertices of given degree in a random graph
• Vertices of given degree in a random graph
• On Extreme Metric Characteristics of a Random Graph. II. Limit Distributions
• Poisson approximation for some statistics based on exchangeable trials