Asymptotic normality of triad counts in random digraphs
Författare
Summary, in English
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.
Avdelning/ar
Publiceringsår
1989
Språk
Engelska
Sidor
163-180
Publikation/Tidskrift/Serie
Communications in Statistics. Stochastic Models
Volym
5
Issue
2
Dokumenttyp
Artikel i tidskrift
Förlag
Taylor & Francis
Ämne
- Probability Theory and Statistics
Nyckelord
- communication networks
- tournaments
- incomplete U-statistics
- Random digraphs
- triad counts
Status
Published
ISBN/ISSN/Övrigt
- ISSN: 0882-0287