Efficient link cuts in online social networks
Due to the huge popularity of online social networks, many researchers focus on adding links, e.g., link prediction to help friend recommendation. So far, no research has been performed on link cuts. However, the spread of malware and misinformation can cause havoc and hence it is interesting to see how to cut links such that malware and misinformation will not run rampant. In fact, many online social networks can be modeled as undirected graphs. In this paper, we investigate different strategies to cut links among different users in undirected graphs so that the speed of virus and misinformation spread can be slowed down the most or even cut off. Two measures are chosen to evaluate the performance of these strategies: Average Inverse of Shortest Path Length (AIPL) and Rumor Saturation Rate (RSR). AIPL measures the communication efficiency of the whole graph while RSR checks the percentage of users receiving information within a certain time interval.
Publication Source (Journal or Book title)
2015 IEEE Global Communications Conference, GLOBECOM 2015
Ruan, J., Deng, J., Amariucai, G., & Wei, S. (2015). Efficient link cuts in online social networks. 2015 IEEE Global Communications Conference, GLOBECOM 2015 https://doi.org/10.1109/GLOCOM.2014.7417589