Search Results for author:
Found 2 papers, 0 papers with code
Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar
Additionally, results on adjusted mutual information reveal substantial dissimilarity between the sub-optimal partitions and any optimal partition of the networks in our experiments.
The Bayan Algorithm: Detecting Communities in Networks Through Exact and Approximate Optimization of Modularity
Community detection is a classic problem in network science with extensive applications in various fields.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
