IDEAS home Printed from https://ideas.repec.org/a/bla/stanee/v45y1991i3p295-325.html
   My bibliography  Save this article

Asymptotic distributions in random graphs with applications to social networks

Author

Listed:
  • K. Nowicki

Abstract

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.

Suggested Citation

  • K. Nowicki, 1991. "Asymptotic distributions in random graphs with applications to social networks," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 45(3), pages 295-325, September.
  • Handle: RePEc:bla:stanee:v:45:y:1991:i:3:p:295-325
    DOI: 10.1111/j.1467-9574.1991.tb01311.x
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/j.1467-9574.1991.tb01311.x
    Download Restriction: no

    File URL: https://libkey.io/10.1111/j.1467-9574.1991.tb01311.x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bryan S. Graham & Fengshi Niu & James L. Powell, 2019. "Kernel Density Estimation for Undirected Dyadic Data," Papers 1907.13630, arXiv.org.
    2. Bryan S. Graham, 2019. "Network Data," Papers 1912.06346, arXiv.org.
    3. Bryan S. Graham, 2019. "Network Data," CeMMAP working papers CWP71/19, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
    4. Knödler, D. & Dieterich, W., 1992. "Lattice-gas models of dispersive transport in disordered materials," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 191(1), pages 426-432.
    5. Andersson, Pontus, 2000. "Small variance of subgraph counts in a random tournament," Statistics & Probability Letters, Elsevier, vol. 49(2), pages 135-138, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:stanee:v:45:y:1991:i:3:p:295-325. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0039-0402 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.