Making Communities Show Respect for Order
arXiv:1908.11818 · doi:10.1007/s41109-020-00255-5
Abstract
In this work we give a community detection algorithm in which the communities both respects the intrinsic order of a directed acyclic graph and also finds similar nodes. We take inspiration from classic similarity measures of bibliometrics, used to assess how similar two publications are, based on their relative citation patterns. We study the algorithm's performance and antichain properties in artificial models and in real networks, such as citation graphs and food webs. We show how well this partitioning algorithm distinguishes and groups together nodes of the same origin (in a citation network, the origin is a topic or a research field). We make the comparison between our partitioning algorithm and standard hierarchical layering tools as well as community detection methods. We show that our algorithm produces different communities from standard layering algorithms.
References in corpus (17)
- Fast unfolding of communities in large networks
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Community detection in graphs
- From Louvain to Leiden: guaranteeing well-connected communities
- Resolution limit in community detection
- Statistical Mechanics of Community Detection
- Higher-order organization of complex networks
- The ground truth about metadata and community detection in networks
- Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
- Laplacian Dynamics and Multiscale Modular Structure in Networks
- Representing higher-order dependencies in networks
- Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit
- Large-scale structure of time evolving citation networks
- Transitive Reduction of Citation Networks
- Community detection in directed acyclic graphs
- Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks