Poisson convergence and semi-induced properties of random graphs

DOI10.1017/S0305004100066664MaRDI QIDQ3763307zbMATH OpenFDO

Authors Michal Karonski, 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)

Recommendations

• Poisson convergence of numbers of vertices of a given degree in random graphs
• On the number of vertices of given degree in a random graph
• On the number of induced subgraphs of a random graph
• When are small subgraphs of a random graph normally distributed?
• scientific article; zbMATH DE number 5310725

Cites work

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

Cited in

(15)

• Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality
• Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models
• On the number of induced subgraphs of a random graph
• Concentration for Poisson functionals: component counts in random geometric graphs
• On asymptotic properties of Bell polynomials and concentration of vertex degree of large random graphs
• Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
• On the number of vertices of given degree in a random graph
• Limit behaviors of random connected graphs driven by a Poisson process
• scientific article; zbMATH DE number 5863938 (Why is no real title available?)
• Graphon convergence of random cographs
• Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions
• Stein's method for conditional central limit theorem
• A central limit theorem for decomposable random variables with applications to random graphs
• Concentration of measure for the number of isolated vertices in the Erdős-Rényi random graph by size bias couplings
• A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph

This page was built for publication: Poisson convergence and semi-induced properties of random graphs

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