Abstract
This work describes a methodology that can be used to identify structure and communication patterns within an organization based on e-mail data. The first step of the method is the construction of an e-mail graph; we then experimentally show that the adjacency matrix of the graph is well approximated by a low-rank matrix. The low-rank property indicates that Principal Component Analysis techniques may be used to remove the noise and extract the structural information (e.g. user communities, communication patterns, etc.). Furthermore, it is shown that the e-mail graph degree distribution (both with respect to indegrees and outdegrees) follows power laws; we also demonstrate that there exists a giant component connecting 70% of the nodes.
This research is supported by NSF ITR Award #0324947.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Babarasi, A., Albert, R.: Emergence of scaling in random networks. Science 286 (1999)
Kleinberg, J., Kumar, S., Raghavan, P., Rajagopalan, S., Tomkins, A.: The web as a graph: measurements, models and methods. In: Proceedings of the International Conference in Combinatorics and Computing (1999)
Garton, L., Haythornthwaite, C., Wellman, B.: Studying online social networks (1997), http://www.ascusc.org/jcmc/vol3/issue1/garton.htm (accessed March 16, 2004)
Wu, F., Huberman, B., Adamic, L., Tyler, J.: Information flow in social groups (2003) (manuscript)
Newman, M., Forrest, S., Balthrop, J.: E-mail networks and the spread of computer viruses. Physical Review (E)66 (2002)
Adamic, L., Adar, E.: How to search a social network (2003) (manuscript)
Tyler, J., Wilkinson, D., Huberman, B.: E-mail as spectroscopy: Automated discovery of community structure withing organizations. In: Proceeding of the International Conference on Communities and Technologies, Netherlands, Kluwer Academic Publishers, Dordrecht (2003)
Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: STOC, pp. 171–180 (1999)
Chung, F., Lu, L., Vu, V.: Eigenvalues of random power law graphs. Annals of Combinatorics 7 (2003)
Nonaka, I.: A dynamic theory of organizational knowledge creation. Organization Science 5, 14–37 (1994)
Freeman, L.C.: Visualizing social groups. In: 1999 Proceedings of the Section on Statistical Graphics, American Statistical Association, pp. 47–54 (2000)
Golub, G., Loan, F.V.: Matrix Computations. Johns Hopkins University Press, Baltimore (1984)
Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks. Advances in Physics 51, 1079–1187 (2002)
Newman, M.: Who is the best connected scientist? a study of scientific coauthorship networks. Physical Review (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drineas, P., Krishnamoorthy, M.S., Sofka, M.D., Yener, B. (2004). Studying E-Mail Graphs for Intelligence Monitoring and Analysis in the Absence of Semantic Information. In: Chen, H., Moore, R., Zeng, D.D., Leavitt, J. (eds) Intelligence and Security Informatics. ISI 2004. Lecture Notes in Computer Science, vol 3073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25952-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-25952-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22125-8
Online ISBN: 978-3-540-25952-7
eBook Packages: Springer Book Archive