Sciweavers

Share
RSA
2010
113views more  RSA 2010»
8 years 8 months ago
The order of the giant component of random hypergraphs
We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1...
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
MST
2006
81views more  MST 2006»
8 years 10 months ago
Local Limit Properties for Pattern Statistics and Rational Models
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
Alberto Bertoni, Christian Choffrut, Massimiliano ...
books