Un algorithme stable de décomposition pour l'analyse des réseaux sociaux dynamiques

Romain Bourqui (1) , Paolo Simonetto (1, 2) , Fabien Jourdan (3)

1 GRAVITE - Graph Visualization and Interactive Exploration
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 INRA - Institut National de la Recherche Agronomique

Dynamical networks raise new analysis problems. An efficient analysis tool has to not only allow to split the network into groups of \og similar~\fg{} elements but also allow to detect changes in the network structure. In this article, we describe a new method for analyzing such dynamical networks. This technique is based on an algorithm of decomposition of graph into overlapping clusters. Time complexity of this algorithm is $O(|E| \cdot deg_{max}^2 + |V| \cdot log(|V|)))$. The stability of that algorithm allows to detect the changes of the studied network over the time.

Domaines: Algorithme et structure de données [cs.DS]

Romain Bourqui, Paolo Simonetto, Fabien Jourdan. Un algorithme stable de décomposition pour l'analyse des réseaux sociaux dynamiques. Revue des Nouvelles Technologies de l'Information, 2009, pp.337-348. ⟨hal-00406437⟩