Social ties, homophily and extraversion--introversion to generate complex networks

被引：1
作者：
Zaidi F. [1 ,2 ]
Pasta M.Q. [2 ,3 ]
Sallaberry A. [4 ]
Melançon G. [5 ,6 ]
机构：
[1] Levich Institute and Physics Department, City College of New York, New York, NY
[2] Karachi Institute of Economics and Technology, Karachi
[3] Usman Institute of Technology, Karachi
[4] LIRMM, Université Paul Valéry Montpellier, Montpellier
[5] CNRS UMR 5800 LaBRI, Talence
[6] INRIA Bordeaux – Sud-Ouest, Talence
来源：
Social Network Analysis and Mining | 2015年 / 5卷 / 01期
关键词：
Network generation models; Scale free networks; Small world networks; Social networks;
D O I：
10.1007/s13278-015-0270-4
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Many interconnected systems and particularly social interactions can be modeled as networks. These networks often exhibit common properties such as high clustering coefficient, low average path lengths and degree distributions following power-law. Networks having these properties are called small world-scale free networks or simply complex networks. Recent interest in complex networks has catalysed the development of algorithmic models to artificially generate these networks. Often these algorithms introduce network properties in the model regardless of their social interpretation resulting in networks which are statistically similar but structurally different from real world networks. In this paper, we focus on social networks and apply concepts of social ties, homophily and extraversion-introversion to develop a model for social networks with small world and scale free properties. We claim that the proposed model produces networks which are structurally similar to real world social networks. © 2015, Springer-Verlag Wien.
引用
收藏
页码：1 / 12
页数：11
相关论文
共 65 条
[1]  
Auber D., Mutzel P., Junger M., Tulip—a huge graph visualization framework, Graph drawing software, mathematics and visualization series, (2003)
[2]  
Badham J., Stocker R., A spatial approach to network generation for three properties: degree distribution, clustering coefficient and degree assortativity, J Artif Soc Soc Simul, 13, 1, (2010)
[3]  
Barabasi A.L., Albert R., Emergence of scaling in random networks, Science, 286, 5439, pp. 509-512, (1999)
[4]  
Boguna M., Pastor-Satorras R., Diaz-Guilera A., Arenas A., Models of social networks based on social distance attachment, Phys Rev E, 70, 5, (2004)
[5]  
Bollt E.M., ben Avraham D., What is special about diffusion on scale-free nets?, New J Phys, 7, (2004)
[6]  
Bourqui R., Zaidi F., Gilbert F., Sharan U., Simonetto P (2008) Vast, challenge: social network dynamics using cell phone call patterns, (2008)
[7]  
Burt R.S., Brokerage and closure, (2005)
[8]  
Cannataro M., Guzzi P.H., Veltri P., Protein-to-protein interactions: technologies, databases, and algorithms, ACM Comput Surv, 43, pp. 1-36, (2010)
[9]  
Catanzaro M., Caldarelli G., Pietronero L., Assortative model for social networks, Phys Rev E (Statistical, Nonlinear, and Soft Matter Physics), 70, 3, pp. 1-4, (2004)
[10]  
Condon A., Karp R.M., Algorithms for graph partitioning on the planted partition model, Random Struct Algorithms, 18, 2, pp. 116-140, (1999)
1234567