Computing communities in large networks using random walks (long version)

Pascal Pons, Matthieu Latapy

Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expen…