Transitive reduction for social network analysis and visualization

In this paper, we show that transitive reduction can be used in real, large social networks analysis. Transitive reduction is an edge-removing operation on directed graphs that preserves some important properties and structures of the graph. After a presentation of this tool interest, we show its properties and how to use it. An application of the process on a real-word large social network (public and famous Enron corpus) built upon interaction data (email boxes) validates this approach.

[1]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[2]  Andrzej Skowron,et al.  Proceedings of the 2005 IEEE / WIC / ACM International Conference on Web Intelligence , 2005 .

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[4]  Jan van Leeuwen,et al.  Graph Algorithms , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[5]  Barend J. van Wyk,et al.  A POCS-Based Graph Matching Algorithm , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Alfred V. Aho,et al.  The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..

[7]  Yiming Yang,et al.  The Enron Corpus: A New Dataset for Email Classi(cid:12)cation Research , 2004 .

[8]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[9]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.