Analyzing resilience of interest-based social networks against node and link failures

Abstract

In typical online social networks, users are linked by symmetric friend relations and can define circles of friends based on shared interests. In this paper, we look at social networks where users form links subject to both friendships and shared interests. Our goal is to understand resilience of these networks in terms of connectivity when both nodes and links are allowed to fail. We derive a zero-one law as well as the asymptotically exact probability result for connectivity under both node and link failures. The results answer the question of how to set the network parameters such that reliable message dissemination can be achieved. We formally prove the results and confirm the results via experiments as well.

Published in: IEEE Transactions on Signal and Information Processing over Networks ( Volume: 3 , Issue: 2 , June 2017 ). arXiv admin note: text overlap with arXiv:1911.00745

References in corpus (6)

• Degree and clustering coefficient in sparse random intersection graphs
• On resilience and connectivity of secure wireless sensor networks under node capture attacks
• Topological properties of secure wireless sensor networks under the q-composite key predistribution scheme with unreliable links
• On Connectivity and Robustness in Random Intersection Graphs
• On Topological Properties of Wireless Sensor Networks under the q-Composite Key Predistribution Scheme with On/Off Channels
• Analyzing resilience of interest-based social networks against node and link failures

Cited by in corpus (3)

• Probabilistic key predistribution in mobile networks resilient to node-capture attacks
• On secure communication in sensor networks under q-composite key predistribution with unreliable links
• Analyzing resilience of interest-based social networks against node and link failures