12 search results - page 2 / 3 » The Largest Component in Subcritical Inhomogeneous Random Gr... |
RSA
2008
13 years 4 months ago
2008
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 ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
RSA
2000
13 years 5 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
CPC
2007
13 years 5 months ago
2007
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
RSA
2011
13 years 6 days 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...