6 search results - page 1 / 2 » Component Evolution in Random Intersection Graphs |
CORR
2010
Springer
13 years 4 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...
COMBINATORICS
2007
13 years 4 months ago
2007
CPC
2007
13 years 4 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/...
STOC
2000
ACM
13 years 9 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
WWW
2003
ACM
14 years 5 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...