4. Community stability and Nash equilibrium
4.1 Stability and reassignment
We have seen how efficient algorithms like Louvain's can handle large graphs, albeit with the risk of obtaining sub-optimal approximate results, whether in terms of modularity, entropy or other measures. This raises the question of how to improve a result obtained by an algorithm such as Louvain. For this purpose, it is necessary to have a criterion other than the modularity that enabled us to achieve
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Community stability and Nash equilibrium
Experiment
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Article included in this offer
"Digital documents and content management"
(
77 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
