Small variance of subgraph counts in a random tournament

Pontus Andersson

Statistics & Probability Letters, 2000, vol. 49, issue 2, 135-138

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.

Keywords: Random; tournament; Subgraph; count (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(00)00041-9
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:49:y:2000:i:2:p:135-138

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().