Reformulations of the Map Equation for Community Finding and Blockmodelling
Refereed Conference Meeting Proceeding
Among the many community-finding algorithms that have been proposed in the last decade and more, the Infomap algorithm of Rosvall and Bergstrom has proven among the best. The algorithm finds good community structure in directed as well as undirected networks by abstracting information flow in the network as a random walk. In this paper, we reformulate the objective in terms of the Kullback-Leibler distance between the distribution of the random walk transitions and that of a model walk. The choice of model can be used to constrain the type of partition that the method extracts. This generalisation makes the method suitable for extracting other types of meso-structure from the network, enabling the analyst to explicitly control the type of extracted structure.
Digital Object Identifer (DOI):
National University of Ireland, Dublin (UCD)
Open access repository: