Statistical behavior of embeddedness and communities of overlapping cliques in online social networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 546-550

  Sridharan, Ajay ^a   Gao, Yong ^b   Wu, Kui ^a   Nastos, James ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; DEGREE DISTRIBUTIONS; EMBEDDEDNESS; EMPIRICAL EVIDENCE; FIRST-ORDER; HIGHER ORDER; HIGHER-ORDER STRUCTURE; INFORMATION NETWORKS; NETWORK MODELS; NODE DEGREE; ONLINE SOCIAL NETWORKS; POWER LAW; POWER LAW DEGREE DISTRIBUTION; POWER LAW DISTRIBUTION; SOCIAL NETWORKS; STATISTICAL BEHAVIOR; STRUCTURAL CHARACTERISTICS; TREE MODELS;

INFORMATION SERVICES; MATHEMATICAL MODELS; PLANT EXTRACTS;

SOCIAL NETWORKING (ONLINE);

EID: 79960849397     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935223     Document Type: Conference Paper

References (15)

1. D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010.
2. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, p. 509, 1999.
3. R. Durrett, Random Graph Dynamics. Cambridge University Press, 2007.
4. Z. Zhu, G. Cao, S. Zhu, S. Ranjan, and A. Nucci, "A social network based patching scheme for worm containment in cellular networks," in Proceedings of IEEE Infocom, April 2009.
5. S. Ioannidis and L. Massoulie, "Surfing the blogosphere: Optimal personalized strategies for searching the web," in Proceedings of IEEE Infocom, March 2010.
6. G. Palla, I. Dernyi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society," Nature, vol. 435(7043), pp. 814-818, June 2005.
7. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and Analysis of Online Social Networks," in Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07), San Diego, CA, October 2007.
8. T. Snijders, P. Pattison, G. Robins, and M. Handcock, "New specifications for exponential random graph models," Sociaological Methodology, vol. 36, no. 1, pp. 99-153, 2006.
9. Y. Gao, "The degree distribution of random k-trees," Theoretical Computer Science, vol. 410(8-10), pp. 688-695, 2009.
10. Y.-Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong, "Analysis of topological characteristics of huge online social networking services," in WWW '07: Proceedings of the 16th international conference on World Wide Web. New York, NY, USA: ACM, 2007, pp. 835-844.
11. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, no. 6684, pp. 440-442, june 1998.
12. H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman, "Sybilguard: defending against sybil attacks via social networks," in SIGCOMM '06: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications. New York, NY, USA: ACM, 2006, pp. 267-278.
13. S. Marti, P. Ganesan, and H. Garcia-Molina, "Sprout: P2p routing with social networks," in First International Workshop on Peer-to-Peer Computing and Databases (P2P&DB 2004), March 2004.
14. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou, "Walking in Facebook: A case study of unbiased sampling of OSNs," in Proceedings of IEEE INFOCOM 2010. IEEE, March 2010, pp. 1-9.
15. R. Toivonen, L. Kovanena, M. Kiveläa, J. Onnelab, J. Saramkia, and K. Kaskia, "A comparative study of social network models: Network evolution models and node attribute models," Social Networks, vol. 31, no. 4, pp. 240-254, 2009.