Du är här

Asymptotic normality of triad counts in random digraphs

Publiceringsår: 1989
Språk: Engelska
Sidor: 163-180
Publikation/Tidskrift/Serie: Communications in Statistics – Stochastic Models
Volym: 5
Nummer: 2
Dokumenttyp: Artikel
Förlag: Taylor&Francis


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.



  • Mathematics and Statistics
  • communication networks
  • tournaments
  • incomplete U-statistics
  • Random digraphs
  • triad counts


  • ISSN: 0882-0287

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se


Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen