Sciweavers

12 search results - page 1 / 3
» The Largest Component in Subcritical Inhomogeneous Random Gr...
Sort
View
RSA
2010
98views more  RSA 2010»
13 years 9 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier
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...
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
13 years 11 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald
CPC
2010
117views more  CPC 2010»
13 years 8 months ago
Diameters in Supercritical Random Graphs Via First Passage Percolation
We study the diameter of C1, the largest component of the Erdos-R
Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Per...