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 \(O(|E| \cdot deg^2_{max} + |V| \cdot log(|V|))\). This algorithm is particularly efficient because it can detect major changes in the data as it evolves over time.

[1]  Guy Melançon,et al.  Multiscale visualization of small world networks , 2003, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714).

[2]  Gary D. Bader,et al.  An automated method for finding molecular complexes in large protein interaction networks , 2003, BMC Bioinformatics.

[3]  Jacques van Helden,et al.  Evaluation of clustering algorithms for protein-protein interaction networks , 2006, BMC Bioinformatics.

[4]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Stephen G. Kobourov,et al.  Journal of Graph Algorithms and Applications Grip: Graph Drawing with Intelligent Placement , 2022 .

[6]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Emden R. Gansner,et al.  Using automatic clustering to produce high-level system organizations of source code , 1998, Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242).

[8]  A. Barabasi,et al.  Quantifying social group evolution , 2007, Nature.

[9]  Matthew Suderman,et al.  Tools for visually exploring biological networks , 2007, Bioinform..

[10]  Guy Melançon,et al.  Software components capture using graph clustering , 2003, 11th IEEE International Workshop on Program Comprehension, 2003..