IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v49y2000i2p135-138.html
   My bibliography  Save this article

Small variance of subgraph counts in a random tournament

Author

Listed:
  • Andersson, Pontus

Abstract

It is known that, for 'most' digraphs D on v vertices, the variance of the number of copies of D in a random tournament on n vertices (chosen uniformly from all such tournaments) is of degree 2v-3 as a polynomial in n. Here we prove that there are arbitrarily large D for which this degree is as small as v.

Suggested Citation

  • Andersson, Pontus, 2000. "Small variance of subgraph counts in a random tournament," Statistics & Probability Letters, Elsevier, vol. 49(2), pages 135-138, August.
    • Handle: RePEc:eee:stapro:v:49:y:2000:i:2:p:135-138
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(00)00041-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bryan S. Graham, 2019. "Network Data," Papers 1912.06346, arXiv.org.
    2. Bryan S. Graham & Fengshi Niu & James L. Powell, 2019. "Kernel density estimation for undirected dyadic data," CeMMAP working papers CWP39/19, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
    3. Graham, Bryan S. & Niu, Fengshi & Powell, James L., 2024. "Kernel density estimation for undirected dyadic data," Journal of Econometrics, Elsevier, vol. 240(2).
    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. Bryan S. Graham, 2019. "Network Data," CeMMAP working papers CWP71/19, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.

    More about this item

    Keywords

    Random tournament Subgraph count;

    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:eee:stapro:v:49:y:2000:i:2:p:135-138. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    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.