43 search results - page 2 / 9 » Percolation in the Secrecy Graph |
RSA
2006
14 years 11 months ago
2006
: Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be vertices. An earlier paper (J. Van den Berg and J. Kahn, Ann Probab 29 (2001), 1...
116
click to vote
RSA
2010
14 years 10 months ago
2010
: 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...
125
click to vote
CPC
2011
14 years 6 months ago
2011
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
AIRS
2006
Springer
15 years 3 months ago
2006
Springer
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
CPC
2010
14 years 9 months ago
2010
We study the diameter of C1, the largest component of the Erdos-R