100 search results - page 2 / 20 » Unicyclic Components in Random Graphs |
CPC
1998
13 years 5 months ago
1998
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
CCCG
2009
13 years 6 months ago
2009
We study the emergence of rigid components in an Erdos-R
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...
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
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 ...