Cited By
View all- Safar MFarahat HMahdi K(2010)Robustness of dynamic social networksJournal of Mobile Multimedia10.5555/2011076.20110806:3(243-262)Online publication date: 1-Sep-2010
Analysis of dynamic social network: e-mail messages exchange network
Pages 41 - 48
Abstract
Counting entropy of social networks is used to study the dynamic of such networks. It depends on counting the number of cycles in the network, which is an NP problem. In this work we used a polynomial time approximation algorithm to count the number of cycles in an undirected graph that is based on regression and on a statistical mechanics approach. We used this approximation algorithm to analysis the dynamicity of a virtual social network, E-mail Messages Exchange Network (EMEN) where nodes and edges appear and disappear through time. We analyze the exact and approximated cyclic entropy variation with time as a function of the number of nodes and edges in the network. The purpose is to establish the robustness of the network. In addition, we study the effect of weighed links (number of interactions between users) on the analysis of such graphs.
References
[1]
R. Albert and A.-L. Barabasi. Statistical mechanics of complex networks. Reviews of Modern Physics, 74, 2002.
[2]
R. Rowe, G. Creamer, S. Hershkop, and S. Stolfo. Automated social hierarchy detection through email network analysis. International Conference on Knowledge Discovery and Data Mining archive, 2007.
[3]
A. Bagchi, A. Bandyopadhyay, and S. Mitra. Design of a data model for social network applications. Journal of Database Management, 2006.
[4]
T. Bhanu, S. M. A. Bagchi, and A. Bandyopadhyay. Pre-processing and path normalization of a web graph used as a social network. Special Issue on Web Information Retrieval of JDIM, 2006.
[5]
P. Boykin and V. Roychowdhury. Leveraging social networks to fight spam. In IEEE Computer Society Press, Computer, 38(4):61--68, 2005.
[6]
C. Cortes and D. Pregibon. Communities of interest. Intelligent Data Analysis, 6(3):211--219.
[7]
G. Creamer, R. Rowe, S. Hershkop, and S. Stolfo. Segmentation and automated social hierarchy detection through email network analysis. Lecture Notes in Computer Science, Springer Berlin/Heidelberg, Advances in Web Mining and Web Usage Analysis, 2009.
[8]
R. Holzer, B. Malin, and L. Sweeney. Email alias detection using social network analysis. International Conference on Knowledge Discovery and Data Mining archive, Proceedings of the 3rd international workshop on Link discovery, 2005.
[9]
C. Hsinchun and X. Jennifer. Criminal network analysis and visualization. Communications of ACM, pages 100--107, 2005.
[10]
D. B. Johnson. Finding all the elementary circuits of a directed graph. SIAM Journal on Computing, pages 77--84, 1975.
[11]
G. Kossinets and D. J. Watts. Empirical analysis of an evolving social network. Science, 311(5757):88--90, 2006.
[12]
K. Mahdi, H. Farahat, and M. Safar. Temporal evolution of social networks in paltalk. Proceedings of the 10th International Conference on Information Integration and Web-based Applications and Services (iiWAS), 2008.
[13]
K. Mahdi, M. Safar, and H. Farahat. Analysis of temporal evolution of social networks. The Journal of Mobile Multimedia (JMM), 5(4):333--350, 2009.
[14]
K. Mahdi, M. Safar, and I. Sorkhoh. Entropy of robust social networks. Proceedings of IADIS International e-Society Conference, 2008.
[15]
G. D. Marco and L. Barolli. On some current results of graph theory for ad-hoc networks. Journal of Mobile Multimedia (JMM), 2(4):15--33, 2007.
[16]
E. Marinari, R. Monasson, and G. Semerjian. An algorithm for counting circuits: application to real world and random graphs. Europhysics Letters, 2006.
[17]
S. Mitra, A. Bagchi, and A. Bandyopadhyay. Complex queries on web graph representing a social network. 1st International Conference on Digital Information Management, pages 430--435, 2006.
[18]
M. Newman, S. Forrest, and J. Balthrop. Email networks and the spread of computer viruses. Physics Reviews, 66(3), 2002.
[19]
W. Nooy, A. Mrvar, and V. Batagelj. Exploratory Social Network Analysis with Pajek (Structural Analysis in the Social Science). Cambridge University Press, England, 2005.
[20]
P. D. L. Rios, S. Lise, and A. Pelizzola. Bethe approximation for self-interacting lattice trees. Europhysics Letters, 53:176--182, 2001.
[21]
M. Safar, K. Mahdi, and A. Kassim. universal cycles distribution function of social networks. The First International Conference on Networked Digital Technologies (NDT), 2009.
[22]
J. Scott. Social Network Analysis: a Handbook. 2nd edition.
[23]
J. Tyler, D. Wilkinson, and B. Huberman. Email as spectroscopy: Automated discovery of community structure within organizations. Communities and Technologies, 6(3):81--96.
[24]
S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications. Cambridge University Press, England, 1994.
Index Terms
- Analysis of dynamic social network: e-mail messages exchange network
Recommendations
Robustness of dynamic social networks
The cyclic entropy of a real virtual friendship network provides an insight on the degree of its robustness. Cyclic entropy depends on counting the number of cycles of different sizes in the network, in which a probability distribution function is ...
Temporal evolution of social networks in Paltalk™
iiWAS '08: Proceedings of the 10th International Conference on Information Integration and Web-based Applications & ServicesThe article presents an analysis dynamic social network where words, nodes and edges appear and disappear through time. We study a popular virtual social network in the internet, known as Paltalk. We analyze the cyclic entropy variation with time with ...
Analysis of temporal evolution of social networks
The article presents an analysis of dynamic social network where words, nodes and edges appear and disappear through time. We study a popular virtual social network in the internet, known as Paltalk. We analyze the exact and approximated cyclic entropy ...
Comments
Information & Contributors
Information
Published In
December 2009
763 pages
ISBN:9781605586601
DOI:10.1145/1806338
- General Chair:
- Gabriele Kotsis,
- Program Chairs:
- David Taniar,
- Eric Pardede
Copyright © 2009 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- Johannes Kepler University
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 December 2009
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
iiWAS '09
Sponsor:
iiWAS '09: 11th International Conference on Information Integration and Web-based Applications & Services
December 14 - 16, 2009
Kuala Lumpur, Malaysia
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 264Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025
Other Metrics
Citations
Cited By
View all- Safar MFarahat HMahdi K(2010)Robustness of dynamic social networksJournal of Mobile Multimedia10.5555/2011076.20110806:3(243-262)Online publication date: 1-Sep-2010
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in