Elements of information theory
Elements of information theory
Node roles and community structure in networks
Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
On the evolution of user interaction in Facebook
Proceedings of the 2nd ACM workshop on Online social networks
Overlapping communities in dynamic networks: their detection and mobile applications
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
On new approaches of assessing network vulnerability: hardness and approximation
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We introduce Community structure Vulnerability Assessment (CVA) problem to assess the network vulnerability under a community structure point of view. Given a positive number k, CVA aims to find out the k most vulnerable nodes whose removals maximally transform the current network community structure to a different one. As the first attempt, we suggest an approximation algorithm for the special case k = 1, and propose multiple greedy algorithms for CVA problem. To certify the effectiveness of suggested approaches, we test them on not only synthesized networks with known community structures but also on real-world social traces.