5. Experiment
Here, we look at some of the experiments carried out with the unification method presented, which can consider unipartite, bipartite and oriented graphs equally well. Moreover, the application of Louvain's algorithm produces some of the best results in a very short time on both binary and weighted graphs. For some graphs, we add overlap with the legitimacy function. Finally, we study the stability of certain communities, taking into account the reallocation function and the Nash equilibrium.
5.1 Unipartite graphs
For unipartite graphs, numerous data sets are available, ranging from very few vertices to graphs with millions of vertices. As the partitioning of these graphs has been extensively studied, only two examples are presented, bearing in mind that Louvain...
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Experiment
Discussion and open problems
Article included in this offer
"Digital documents and content management"
(
76 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
