Asymptotic normality of graph statistics
From MaRDI portal
Publication:1116572
DOI10.1016/0378-3758(89)90005-0zbMath0666.62016MaRDI QIDQ1116572
Publication date: 1989
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(89)90005-0
random graphs; Markov graphs; Asymptotic normality; Bernoulli graphs; graph statistics; induced subgraph counts; numerators of incomplete U-statistics
Related Items
The asymptotic distributions of generalized U-statistics with applications to random graphs, Asymptotic distributions in random graphs with applications to social networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of induced subgraphs of a random graph
- Markov Graphs
- Transitivity in stochastic graphs and digraphs
- Some properties of incomplete U-statistics
- Random directed graph distributions and the triad census in social networks†
- Matrix measures for transitivity and balance*
- Cluster Inference by Using Transitivity Indices in Empirical Graphs
- A review of random graphs
- ON THE METHOD OF PAIRED COMPARISONS
- On the method of paired comparisons
- A Class of Statistics with Asymptotically Normal Distribution