Asymptotic normality of triad counts in random digraphs
- 1 January 1989
- journal article
- research article
- Published by Taylor & Francis in Communications in Statistics. Stochastic Models
- Vol. 5 (2) , 163-180
- https://doi.org/10.1080/15326348908807104
Abstract
Triad counts for directed graphs are represented as numerators of incomplete U-statistics with symmetric or asymmetric kernels. Asymptotic normality for the simultaneous distribution of all triad counts is proved. Applications are given to investigations of inconsistency in tournaments and reliability of communication networks.Keywords
This publication has 17 references indexed in Scilit:
- Subgraph counts in random graphs using incomplete u-statistics methodsDiscrete Mathematics, 1988
- Asymptotic Poisson distributions with applications to statistical analysis of graphsAdvances in Applied Probability, 1988
- Markov GraphsJournal of the American Statistical Association, 1986
- Statistical Analysis of Multiple Sociometric RelationsJournal of the American Statistical Association, 1985
- On the number of strictly balanced subgraphs of a random graphPublished by Springer Nature ,1983
- An Exponential Family of Probability Distributions for Directed GraphsJournal of the American Statistical Association, 1981
- A Survey of Statistical Methods for Graph AnalysisSociological Methodology, 1981
- On Extending the Bradley-Terry Model to Accommodate Ties in Paired Comparison ExperimentsJournal of the American Statistical Association, 1970
- On the method of paired comparisonsBiometrika, 1947
- ON THE METHOD OF PAIRED COMPARISONSBiometrika, 1940