Estimation algorithm for counting periodic orbits in complex social networks

Information Systems Frontiers

Volumn 15, Issue 2, 2013, Pages 193-202

  Sorkhoh, Ibrahim ^a   Mahdi, Khaled A ^a   Safar, Maytham ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Algorithms; Complex networks; Design; Performance; Theory

Indexed keywords

ALGORITHMS; BACKPROPAGATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; DESIGN; INFORMATION MANAGEMENT; SOCIAL NETWORKING (ONLINE);

BELIEF PROPAGATION ALGORITHM; COMPLEX SOCIAL NETWORKS; COMPUTATION TIME; CYCLE DISTRIBUTION; ESTIMATION ALGORITHM; PERFORMANCE; PERIODIC ORBITS; THEORY;

COMPLEX NETWORKS;

EID: 84890562942     PISSN: 13873326     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10796-012-9366-9     Document Type: Article

References (26)

1. Angelova, R., Lipczak, M., & Milios, E., Pralat, P. (2010). Investigating the properties of a social bookmarking and tagging network. International Journal of Data Warehousing and Mining, 6(1), 1-19.
2. Barabási, A. L., & Albert, R. (1997). Emergence of scaling in random networks. Science, 286, 509-512.
3. Costa, L. d. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007). Characterization of complex networks: a survey of measurements. Advances in Physics, 56(1), 167-242. (Pubitemid 46504905)
4. Erdös, P., & Rényi, A. (1959). On random graphs. Publicationes Mathematicae, 6, 290-297.
5. Erdös, P., & Rényi, A. (1960). On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 5, 17-61.
6. Erdös, P., & Rényi, A. (1961). On the strength of connectedness of a random graph. Acta Mathematica Scientia Hungary, 12, 261-267.
7. Johnson, D. (1975). Finding all the elementary circuits of a directed graph. SIAM Journal on Computing, 4(1), 77-84.
8. Liu, H., & Wang, J. (2006). A new way to enumerate cycles in graph. In Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (pp. 57).
9. Mahdi, K., Safar, M.,&Farahat, H. (2009a).Analysis of temporal evolution of social networks. Journal of Mobile Multimedia, 5(4), 333-350.
10. Mahdi, K., Safar, M., & Sorkhoh, I. (2008). Entropy of robust social networks. In IADIS international conference e-society, Algarve, Portugal.
11. Mahdi, K., Safar, M., & Torabi, S. (2009b). A model of diffusion parameter characterizing social networks. In IADIS international conference e-society.
12. Mahdi, K. A., Safar, M., Sorkhoh, I., & Kassem, A. (2009c). Cycle-based versus degree-based classification of social networks. Journal of Digital Information Management, 7(6),383-389.
13. Marinari, E., & Semerjian, G. (2006). On the number of circuits in random graphs. Journal of Statistical Mechanics: Theory and Experiment, 2006, P06019.
14. Milgram, S. (1967). The small world problem. Psychology Today, 1(1), 60-67.
15. Papadopoulos, S., Vakali, A., & Kompatsiaris, I. (2010). The dynamics of content popularity in social media. International Journal of Data Warehousing and Mining, 6(1), 20-37.
16. Rios, P. D. L, Lise, S., & Pelizzola, A. (2001). Bethe approximation for self-interacting lattice trees. EPL (Europhysics Letters), 53(2), 176-182.
17. Safar, M., & Ghaith, H. B. (2006). Friends network. In IADIS international conference WWW/Internet, Murcia, Spain.
18. Safar, M., Mahdi, K., & Sorkhoh, I. (2008). Maximum entropy of fully connected social network. In IADIS international conference web based communities, Amsterdam, Holland.
19. Safar, M., El-Sayed, N., Mahdi, K., & Taniar, D. (2010). Entropy optimization of social networks using evolutionary algorithm. Journal of Universal Computer Science, 16(6), 983-1003.
20. Tarjan, R. E. (1972). Enumeration of the elementary circuits of a directed graph. Tech. rep., Cornell University.
21. Wang, B., Tang, H., Guo, C., & Xiu, Z. (2005). Entropy optimization of scale-free networks' robustness to random failures. Physica A, 363(2), 591-596.
22. Watts, D. J. (2003a). Small worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press.
23. Watts, D. J. (2003b). Six degrees. The Science of a Connected Age. W. W. Norton & Company.
24. Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of small-world networks. Nature, 393(6684), 440-442.
25. Wetzker, R., Zimmermann, C.,&Bauckage, C. (2010). Detecting trends in social bookmarking systems:Ade.icio.us endeavor. International Journal of DataWarehousing and Mining, 6(1), 38-57.
26. Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2003). Understanding belief propagation and its generalizations. In Exploring artificial intelligence in the new millennium (pp. 239-269).Morgan Kaufmann Publishers Inc.