![](/assets/images/picto-drapeau-france-OnZXal1.png)
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 a first approximate result. A new criterion can be used to correct the assignments to...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-KGYj7ZH.png)
The Ultimate Scientific and Technical Reference
This article is included in
Digital documents and content management
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Community stability and Nash equilibrium
Bibliography
Websites
http://www.social-networks.mines-ales.fr
Demonstrator http://www.communities.mines-ales.fr
Online social analysis of a Facebook profile using Mathematica software
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-KGYj7ZH.png)
The Ultimate Scientific and Technical Reference