Graph Theoretic and Spectral Analysis of Enron Email Data

详细信息    查看全文

• 作者：Anurat Chapanond ; Mukkai S. Krishnamoorthy and B¨¹lent Yener
• 关键词：email graph ; graph metrics ; spectral analysis ; social network analysis
• 刊名：Computational & Mathematical Organization Theory
• 出版年：2005
• 出版时间：October 2005
• 年：2005
• 卷：11
• 期：3
• 页码：265-281
• 全文大小：271 KB

文摘

Analysis of social networks to identify communities and model their evolution has been an active area of recent research. This paper analyzes the Enron email data set to discover structures within the organization. The analysis is based on constructing an email graph and studying its properties with both graph theoretical and spectral analysis techniques. The graph theoretical analysis includes the computation of several graph metrics such as degree distribution, average distance ratio, clustering coefficient and compactness over the email graph. The spectral analysis shows that the email adjacency matrix has a rank-2 approximation. It is shown that preprocessing of data has significant impact on the results, thus a standard form is needed for establishing a benchmark data.