Article | REF: H7444 V1

Detection community

Authors: Michel CRAMPES, Michel PLANTIÉ

Publication date: May 10, 2014

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


Français

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...

You do not have access to this resource.

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!


The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

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

Subscribe now!

Ongoing reading
Community stability and Nash equilibrium