A stable decomposition algorithm for dynamic social network analysis

Dynamic networks raise new challenges for knowledge discovery. To efficiently handle this kind of data, analysis methods have to decompose the network, modelled by a graph, into similar sets of nodes. In this article, we present a graph decomposition algorithm that generates overlapping clusters. The complexity of this algorithm is [one formula omitted] This algorithm is particularly efficient because it can detect major changes in the data as it evolves over time