Name
Abstract | ||
|---|---|---|
Let W1,…,Wn be independent random subsets of [m]={1,…,m}. Assuming that each Wi is uniformly distributed in the class of d-subsets of [m] we study the uniform random intersection graph Gs(n,m,d) on the vertex set {W1,…Wn}, defined by the adjacency relation: Wi∼Wj whenever ∣Wi∩Wj∣≥s. We show that as n,m→∞ the edge density threshold for the property that each vertex of Gs(n,m,d) has at least k neighbours is asymptotically the same as that for Gs(n,m,d) being k-connected. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.disc.2014.06.014 | Discrete Mathematics |
Keywords | Field | DocType |
Random intersection graph,k-connectivity,Wireless sensor network | Adjacency list,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Intersection graph,Edge density,Mathematics | Journal |
Volume | ISSN | Citations |
333 | 0012-365X | 1 |
PageRank | References | Authors |
0.37 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mindaugas Bloznelis | 1 | 1 | 0.37 |
| K. Rybarczyk | 2 | 25 | 1.67 |