On combinatorial Hoeffding decomposition and asymptotic normality of subgraph count statis\-tics
For a given graph, this paper considers the asymptotic distribution for the number of the copies of this graph with uniformly distributed edges. Using 2-starts, the simplest graph, as an illustrating example, the author presents a proof of the asymptotic normality based on the Hoeffding's decomposition and Stein's method, which is simpler than that given by \textit{S. Janson} [Random. Struct. Algorithms 1, 15--37 (1990; Zbl 0708.05052)] and based on random graph process. For the entire collection see [Zbl 1047.68003].
- Asymptotic normality of graph statistics
- Asymptotic normality of some Graph-Related statistics
- Subgraph counts in random graphs using incomplete U-statistics methods
- When are small subgraphs of a random graph normally distributed?
- The asymptotic distributions of generalized U-statistics with applications to random graphs
- Asymptotic normality of graph statistics
- Orthogonal decompositions and functional limit theorems for random graph statistics
- KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH
- The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs
- Normal approximation for subgraph count in random hypergraphs
This page was built for publication: On combinatorial Hoeffding decomposition and asymptotic normality of subgraph count statis\-tics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154666)
