Algorithms for community and role detection in networks

Abstract

No abstract is available from our sources. Use “Read paper” to view it.

TL;DRThis work considers a generalization of the problem of community detection, termed role extraction, which does not use any prior assumption on the links distribution in the graph and describes a similarity measure based on the number of common neighbors between each pair of nodes that has interesting properties that reveal characteristics of the role structure in benchmark and real graphs. (Semantic Scholar)