On the asymptotic distributions of subgraph counts in a random tournament
1998 (English)In: RANDOM STRUCTURES & ALGORITHMS, Vol. 13, no 3-4, 249-260 p.Article in journal (Other scientific) Published
A random tournament T-n is obtained by independently orienting the edges of the complete graph on n vertices, with probability 1/2 far each direction. We study the asymptotic distribution, as n tends to infinity, of a suitable normalization of the number
Place, publisher, year, edition, pages
JOHN WILEY & SONS LTD , 1998. Vol. 13, no 3-4, 249-260 p.
IdentifiersURN: urn:nbn:se:uu:diva-26959OAI: oai:DiVA.org:uu-26959DiVA: diva2:54853
Addresses: Andersson P, Uppsala Univ, Dept Math, POB 480, SE-75106 Uppsala, Sweden. Uppsala Univ, Dept Math, SE-75106 Uppsala, Sweden.2008-10-172008-10-172011-01-14