Poisson convergence and random graphs

DOI10.1017/S0305004100059995MaRDI QIDQ3963761zbMATH OpenOpenAlexWikidataFDO

Authors A. D. Barbour

Publication date 1982

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

Full work available at URL https://doi.org/10.1017/s0305004100059995

zbMATH Keywords

Poisson distributionStein's methodrandom graphs

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Enumeration in graph theory (05C30)

Cites work

• Limit theorems for complete subgraphs of random graphs
• Poisson approximation for dependent trials
• Threshold functions for small subgraphs

Cited in

(33)

• An Improvement of Poisson Approximation for Sums of Dependent Bernoulli Random Variables
• On the number of induced subgraphs of a random graph
• Asymptotic Normality of the Vertex Degree in Random Subgraphs of the n‐Cube
• Fundamentals of Stein's method
• Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
• The lower tail: Poisson approximation revisited
• Anti-concentration for subgraph counts in random graphs
• Poisson convergence and Poisson processes with applications to random graphs
• On tree census and the giant component in sparse random graphs
• New non-uniform bounds on Poisson approximation for dependent Bernoulli trials
• Asymptotic normality in random graphs with given vertex degrees
• A Random Graph With a Subcritical Number of Edges
• When are small subgraphs of a random graph normally distributed?
• The random-cluster model on the complete graph
• Bound on Poisson approximation for the street light problem via Stein-Chen method
• Tree and forest weights and their application to nonuniform random graphs
• Maximal induces trees in sparse random graphs
• Local central limit theorem for triangle counts in sparse random graphs
• On the probability of the occurrence of a copy of a fixed graph in a random distance graph
• POISSON APPROXIMATION FOR THE COUPON COLLECTOR’S PROBLEM
• Approximation of the difference of two Poisson-like counts by Skellam
• Fixed point characterizations of continuous univariate probability distributions and their applications
• Normal to Poisson phase transition for subgraph counting in the random-connection model
• Random subgraphs of the \(n\)-cycle and the \(n\)-wheel
• Stein's method and characteristic functions
• Approximating dependent rare events
• 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
• THE ESTIMATION OF ERROR ON POISSON APPROXIMATION FOR THE MÉNAGE PROBLEM
• CLT-related large deviation bounds based on Stein's method
• Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
• Compound Poisson approximations of subgraph counts in random graphs

This page was built for publication: Poisson convergence and random graphs

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