Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Asymptotic distributions in random graphs with applications to social networks

Publiceringsår: 1991
Språk: Engelska
Sidor: 295-325
Publikation/Tidskrift/Serie: Statistica Neerlandica
Volym: 45
Nummer: 3
Dokumenttyp: Artikel i tidskrift
Förlag: John Wiley & Sons


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.


  • Probability Theory and Statistics
  • orthogonal projection
  • uniform graphs
  • Bernoulli graphs
  • subgraph counts
  • induced subgraph counts


  • ISSN: 0039-0402

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

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