A Mathematical Programming approach to Overlapping community detection by cluster's Shapley value
Optimization and Control
2023-01-26 v1
Abstract
We propose a new model to detect the overlapping communities of a network that is based on cooperative games and mathematical programming. More specifically, communities are defined as stable coalitions of a weighted graph community game and they are revealed as the optimal solution of a mixed-integer linear programming problem. Exact optimal solutions are obtained for small and medium sized instances and and it is shown that they provide useful information about the network structure, improving on previous contributions. Next, a heuristic algorithm is developed to solve the largest instances and used to compare two variations of the objective function.
Keywords
Cite
@article{arxiv.2301.10580,
title = {A Mathematical Programming approach to Overlapping community detection by cluster's Shapley value},
author = {Stefano Benati and Justo Puerto and Antonio M. Rodríguez-Chía and Francisco Temprano},
journal= {arXiv preprint arXiv:2301.10580},
year = {2023}
}