Poisson convergence and semi-induced properties of random graphs
From MaRDI portal
Publication:3763307
DOI10.1017/S0305004100066664zbMATH Open0627.60016MaRDI QIDQ3763307FDOQ3763307
Authors: Michal Karonski, Andrzej Ruciński 
Publication date: 1986
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
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
- On Extreme Metric Characteristics of a Random Graph. II. Limit Distributions
- Vertices of given degree in a random graph
- Poisson approximation for some statistics based on exchangeable trials
- On the number of vertices of given degree in a random graph
- Limit theorems for complete subgraphs of random graphs
Cited In (15)
- 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
- Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
- On asymptotic properties of Bell polynomials and concentration of vertex degree of large random graphs
- On the number of vertices of given degree in a random graph
- Limit behaviors of random connected graphs driven by a Poisson process
- Graphon convergence of random cographs
- Title not available (Why is that?)
- 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
- Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality
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)
