Assortativity and clustering of sparse random intersection graphs

Abstract

We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of adjacent nodes (called the assortativity coefficient), the expected number of common neighbours of adjacent nodes, and the expected degree of a neighbour of a node of a given degree k. These expressions are written in terms of the asymptotic degree distribution and, alternatively, in terms of the parameters defining the underlying random graph model.

References in corpus (1)

• Degree and clustering coefficient in sparse random intersection graphs

Cited by in corpus (15)

• k-Connectivity in Random Key Graphs with Unreliable Links
• On resilience and connectivity of secure wireless sensor networks under node capture attacks
• On Topological Properties of Wireless Sensor Networks under the q-Composite Key Predistribution Scheme with On/Off Channels
• On $k$-connectivity and minimum vertex degree in random $s$-intersection graphs
• Random intersection graphs with communities
• Scale-free network clustering in hyperbolic and other random graphs
• Probabilistic key predistribution in mobile networks resilient to node-capture attacks
• Random intersection graphs and their applications in security, wireless communication, and social networks
• Designing Securely and Reliably Connected Wireless Sensor Networks
• Analyzing resilience of interest-based social networks against node and link failures
• Hyperbolicity, degeneracy, and expansion of random intersection graphs
• Critical scaling limits of the random intersection graph
• On the total variation distance between the binomial random graph and the random intersection graph
• On connectivity in a general random intersection graph
• Secure Connectivity of Wireless Sensor Networks Under Key Predistribution with on/off Channels