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

National audienceDynamical 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