Community detection in social networks based on fire propagation

摘要

Community detection is one of the key problem areas in social network analysis. It is classified as an NP-hard problem. Although a lot of good approximate algorithms are available for finding clusters in social networks, all those algorithms have serious drawbacks. They have high time complexities and are inefficient in finding shared communities, a phenomenon common in real-world social networks.