Experiment
Detection community

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.