6 search results - page 1 / 2 » The order of the giant component of random hypergraphs |
RSA
2010
13 years 3 months ago
2010
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...
COCOON
2006
Springer
13 years 6 months ago
2006
Springer
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...
WAW
2009
Springer
13 years 11 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
RSA
2011
12 years 12 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—In this paper, we study the giant component, the largest component containing a non-vanishing fraction of nodes, in wireless multi-hop networks in d (d = 1, 2). We assume that n...