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 distributions in random graphs with applications to social networks

På svenska

Author

Summary, in English

Various kinds of subgraph counts have been proposed as important statistics in the social sciences: for instance, in connection with studies of the structural properties of social networks. Since the empirical structure in question often involves an element of randomness, subgraph counts are random variables and, consequently, we need to describe their probabilistic properties. In this paper we give a survey of results dealing with the asymptotic distributions of general subgraph counts for a number of standard graph distributions. Although we do not include proofs for all the results, we illustrate the methodology used through studies of asymptotic behaviour for certain subgraph counts.

Publishing year

1991

Language

English

Pages

295-325

Publication/Series

Statistica Neerlandica

Volume

45

Issue

3

Document type

Journal article

Publisher

John Wiley & Sons Inc.

Topic

  • Probability Theory and Statistics

Keywords

  • orthogonal projection
  • uniform graphs
  • Bernoulli graphs
  • subgraph counts
  • induced subgraph counts

Status

Published

ISBN/ISSN/Other

  • ISSN: 0039-0402