ANALYSIS OF TEMPORAL EVOLUTION OF SOCIAL NETWORKS
Keywords:
Cyclic Entropy, Cycles, Graphs, Directed, UndirectedAbstract
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 variation with time with the purpose to establish the robustness of the network. In addition, we study the effect of weighed links on the analysis of such graphs.
Downloads
References
G. Pilato, A. Augello, G. Vassallo, S. Gaglio (2008), EHeBby: An evocative humorist chat-bot,
Journal of Mobile Information Systems, Vol.4, No. 3, pp. 165-181.
P. Boykin and V. Roychowdhury (2005), Leveraging Social Networks to Fight Spam. In IEEE
Computer Society Press, Computer, Vol.38, No. 4, pp. 61-68.
C. Hsinchun and X. Jennifer (2005), Criminal Network Analysis and Visualization. Communications
of ACM , pp. 100-107.
A. Bagchi, A. Bandyopadhyay and S.K. Mitra (2006), Design of a data model for social network
applications, Journal of Database Management.
T.C Bhanu, S. Mitra. A. Bagchi, A.K. Bandyopadhyay (2006), Pre-processing and path normalization
of a web graph used as a social network, Special Issue on Web Information Retrieval of
JDIM.
S. Mitra, A. Bagchi and A.K. Bandyopadhyay (2006), Complex queries on web graph representing
a social network, 1st International Conference on Digital Information Management, Bangalore,
India, pp 430-435.
R. Albert and A.-L. Barabasi (2002), Statistical Mechanics of Complex Networks, Reviews of
Modern Physics, 74.
K. Mahdi, M. Safar, & I. Sorkhoh (2008), Entropy of Robust Social Networks, Proceedings of
IADIS International e-Society Conference.
K. Mahdi, H. Farahat, M. Safar (2008), Temporal Evolution of Social Networks in Paltalk, Proceedings
of the 10th International Conference on Information Integration and Web-based Applications
& Services (iiWAS).
E. Marinari, R. Monasson, and G. Semerjian (2006), An algorithm for counting circuits: application
to real world and random graphs, Europhysics Letters.
G. Kalna and D. J. Higham (2007), A clustering coefficient for weighted networks, with application
to gene expression data, AI Communications, Vol.20, No. 4, pp. 263-271.
J. Scott (2000), Social Network Analysis: a Handbook, Sage Publications Ltd; Second Edition,
U.S.A.
W. Nooy, A. Mrvar and V. Batagelj (2005), Exploratory Social Network Analysis with Pajek
(Structural Analysis in the Social Science), Cambridge University Press, England.
S. Wasserman and K. Faust (1994), Social Network Analysis: Methods and Applications, Cambridge
University Press, England.
Retrieved August 1, 2008, from Paltalk: http://www.paltalk.com.
G. De Marco and L. Barolli (2007), On Some Current Results of Graph Theory for Ad-hoc Networks,
Journal of Mobile Multimedia (JMM), Vol. 2, No. 4, pp. 15-33.
D. B. Johnson (1975), Finding All the Elementary Circuits of a Directed Graph, SIAM Journal on
Computing , pp. 77-84.
P. De Los Rios, S. Lise and A. Pelizzola (2001), Bethe approximation for self-interacting lattice
trees, Europhys. Lett., Vol.53, pp. 176-182.
T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein (2001), Introduction to Algorithms (2nd
ed.), London: The MIT Press.
D. Knoke and S. Yang (2008), Social Network Analysis (2nd ed.). SAGE.
