The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Asymptotic normality of triad counts in random digraphs

På svenska

Author

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.

Publishing year

1989

Language

English

Pages

163-180

Publication/Series

Communications in Statistics. Stochastic Models

Volume

5

Issue

2

Document type

Journal article

Publisher

Taylor & Francis

Topic

  • Probability Theory and Statistics

Keywords

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

Status

Published

ISBN/ISSN/Other

  • ISSN: 0882-0287