ACM Home Page
Please provide us with feedback. Feedback
Temporal evolution of social networks in Paltalk™
Full text PdfPdf (288 KB)
Source International Conference on Information Integration and web-based Applications and Services archive
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services table of contents
Linz, Austria
SESSION: iiWAS 2008: Social networking: research and applications table of contents
Pages 98-103  
Year of Publication: 2008
ISBN:978-1-60558-349-5
Authors
Khaled Mahdi  Kuwait University, Kuwait
Hisham Farahat  Kuwait University, Kuwait
Maytham Safar  Kuwait University, Kuwait
Sponsor
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 130,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1497308.1497330
What is a DOI?

ABSTRACT

The 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 the purpose to establish the robustness of the network.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
(n.d.). Retrieved August 1, 2008, from Paltalk: http://www.paltalk.com
 
2
Bagchi, A., Bandyopadhyay, A., & K. Mitra, S. (2006). Design of a data model for social network applications. Journal of Database Management.
 
3
Bhanu, T. C., & al, e. (2006). Pre-processing and path normalization of a web graph used as a social network. Special Issue on Web Information Retrieval of JDIM.
 
4
 
5
6
 
7
Johnson, D. B. (1975). Finding All the Elementary Circuits of a Directed Graph. SIAM Journal on Computing, 77--84.
 
8
Knoke, D., & Yang, S. (2008). Social Network Analysis (2nd ed.). SAGE.
 
9
Mahdi, K., Safar, M., & Sorkhoh, a. I. (2008). ENTROPY OF ROBUST SOCIAL NETWORKS.
 
10
Mitra, S. e. (2006). Complex queries on web graph representing a social network. 1st International Conference on Digital Information Management, (pp. 430--435). Bangalore, India.
 
11
Bagchi, A., Bandyopadhyay, A. & K. Mitra, S. (2006). Design of a data model for social network applications. Journal of Database Management.
 
12
Batagelj, V. et al, 2005. Exploratory Social Network Analysis with Pajek (Structural Analysis in the Social Science). Cambridge University Press, England.
 
13
Bhanu, T. C. et al, 2006. Pre-processing and path normalization of a web graph used as a social network. Special Issue on Web Information Retrieval of JDIM.
 
14
15
 
16
Mitra, S. et al, 2006. Complex queries on web graph representing a social network. 1st International Conference on Digital Information Management. Bangalore, India, pp 430--435.
 
17
Scott, J., 2000. Social Network Analysis: a Handbook. Sage Publications Ltd; Second Edition, U.S.A.
 
18
Wasserman, S., & Faust, K, 1994. Social Network Analysis: Methods and Applications. Cambridge University Press, England.

Collaborative Colleagues:
Khaled Mahdi: colleagues
Hisham Farahat: colleagues
Maytham Safar: colleagues