Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Asymptotic distributions in random graphs with applications to social networks

In English

Författare

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.

Publiceringsår

1991

Språk

Engelska

Sidor

295-325

Publikation/Tidskrift/Serie

Statistica Neerlandica

Volym

45

Issue

3

Dokumenttyp

Artikel i tidskrift

Förlag

John Wiley & Sons Inc.

Ämne

  • Probability Theory and Statistics

Nyckelord

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

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0039-0402