Sciweavers

RSA
2010
91views more  RSA 2010»
13 years 9 months ago
The second largest component in the supercritical 2D Hamming graph
The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i, j), 1 ≤ i, j ≤ n, two vertices being adjacent when they share a common coordinate. We examine random sub...
Remco van der Hofstad, Malwina J. Luczak, Joel Spe...
RSA
2008
118views more  RSA 2008»
13 years 11 months ago
The cover time of the giant component of a random graph
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
Colin Cooper, Alan M. Frieze
INFOCOM
2009
IEEE
14 years 6 months ago
On the Properties of Giant Component in Wireless Multi-Hop Networks
—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...
Xiaoyuan Ta, Guoqiang Mao, Brian D. O. Anderson