On the number of induced subgraphs of a random graph
From MaRDI portal
(Redirected from Publication:1103632)
Let \(G_ n\) be a graph selected at random from the set of all labelled graphs of order n. This paper shows that for many a type, the number of induced subgraphs of that type in \(G_ n\) is asymptotically normally distributed as n tends to infinity.
Recommendations
Cites work
Cited in
(11)- Asymptotic normality of graph statistics
- A central limit theorem for decomposable random variables with applications to random graphs
- On the number of subgraphs of a specified form embedded in a random graph
- A threshold for the size of random caps to cover a sphere
- scientific article; zbMATH DE number 3865331 (Why is no real title available?)
- A functional limit theorem for random graphs with applications to subgraph count statistics
- scientific article; zbMATH DE number 3943865 (Why is no real title available?)
- Poisson convergence and semi-induced properties of random graphs
- The inducibility of complete bipartite graphs
- scientific article; zbMATH DE number 3333197 (Why is no real title available?)
- The asymptotic distributions of generalized U-statistics with applications to random graphs
This page was built for publication: On the number of induced subgraphs of a random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103632)