Connectivity of the uniform random intersection graph

A uniform random intersection graphG(n,m,k) is a random graph constructed as follows. Label each of n nodes by a randomly chosen set of k distinct colours taken from some finite set of possible colours of size m. Nodes are joined by an edge if and only if some colour appears in both their labels. These graphs arise in the study of the security of wireless sensor networks, in particular when modelling the network graph of the well-known key predistribution technique due to Eschenauer and Gligor. The paper determines the threshold for connectivity of the graph G(n,m,k) when n->~ in many situations. For example, when k is a function of n such that k>=2 and [email protected]?n^@[email protected]? for some fixed positive real number @a then G(n,m,k) is almost surely connected when lim infk^2n/mlogn>1, and G(n,m,k) is almost surely disconnected when lim supk^2n/mlogn<1.

[1]  Béla Bollobás,et al.  Random Graphs: Preface to the Second Edition , 2001 .

[2]  Willemien Kets,et al.  RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING , 2009, Probability in the Engineering and Informational Sciences.

[3]  Erhard Godehardt,et al.  Two Models of Random Intersection Graphs for Classification , 2003 .

[4]  L. Mancini,et al.  How to Design Connected Sensor Networks that Are Provably Secure , 2006 .

[5]  Béla Bollobás,et al.  Random Graphs , 1985 .

[6]  Anusch Taraz,et al.  Efficiently covering complex networks with cliques of similar vertices , 2006, Theor. Comput. Sci..

[7]  Dudley Stark.  The vertex degree distribution of random intersection graphs , 2004 .

[8]  James Allen Fill,et al.  Random intersection graphs when m= w (n): an equivalence theorem relating the evolution of the G ( n, m, p ) and G ( n,P /italic>) models , 2000 .

[9]  James Allen Fill,et al.  Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models , 2000, Random Struct. Algorithms.

[10]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[11]  Roberto Di Pietro,et al.  Redoubtable Sensor Networks , 2008, TSEC.

[12]  Mindaugas Bloznelis,et al.  Component evolution in a secure wireless sensor network , 2009 .

[13]  Maurizio Vichi,et al.  Studies in Classification Data Analysis and knowledge Organization , 2011 .

[14]  Erhard Godehardt,et al.  Random Intersection Graphs and Classification , 2006, GfKl.

[15]  Jerzy Jaworski,et al.  The degree of a typical vertex in generalized random intersection graph models , 2006, Discret. Math..

[16]  Roberto Di Pietro,et al.  Sensor Networks that Are Provably Resilient , 2006, 2006 Securecomm and Workshops.