42 search results - page 1 / 9 » Component Evolution in General Random Intersection Graphs |
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...
COMBINATORICS
2007
13 years 5 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/...
TIT
2010
12 years 11 months ago
2010
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the b...
CSR
2007
Springer
13 years 11 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...