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

  • Faraz ZaidiEmail author
  • Muhammad Qasim Pasta
  • Arnaud Sallaberry
  • Guy Melançon
Original Article


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.


Social networks Small world networks Scale free networks Network generation models 


  1. Auber D (2003) Tulip—a huge graph visualization framework. In: Mutzel P, Jünger M (eds) Graph drawing software, mathematics and visualization series. Springer, BerlinGoogle Scholar
  2. Badham J, Stocker R (2010) A spatial approach to network generation for three properties: degree distribution, clustering coefficient and degree assortativity. J Artif Soc Soc Simul 13(1):11Google Scholar
  3. Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512MathSciNetCrossRefGoogle Scholar
  4. Boguñá M, Pastor-Satorras R, Díaz-Guilera A, Arenas A (2004) Models of social networks based on social distance attachment. Phys Rev E 70(5):056122CrossRefGoogle Scholar
  5. Bollobás B, Riordan OM (2002) Mathematical results on scale-free random graphs. In: Bornholdt S, Schuster HG (eds) Handbook of Graphs and Networks: From the Genome to the Internet. Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim, FRG. doi: 10.1002/3527602755.ch1
  6. Bollt EM, ben Avraham D (2004) What is special about diffusion on scale-free nets? New J Phys 7:26CrossRefGoogle Scholar
  7. Bourqui R, Zaidi F, Gilbert F, Sharan U, Simonetto P (2008) Vast 2008 challenge: social network dynamics using cell phone call patterns. In: IEEE symposium on visual analytics science and technology, 2008Google Scholar
  8. Burt RS (2005) Brokerage and closure. Oxford University Press, OxfordGoogle Scholar
  9. Cannataro M, Guzzi PH, Veltri P (2010) Protein-to-protein interactions: technologies, databases, and algorithms. ACM Comput Surv 43:1:1–1:36CrossRefGoogle Scholar
  10. Catanzaro M, Caldarelli G, Pietronero L (2004) Assortative model for social networks. Phys Rev E (Statistical, Nonlinear, and Soft Matter Physics) 70(3):1–4Google Scholar
  11. Condon A, Karp RM (1999) Algorithms for graph partitioning on the planted partition model. Random Struct Algorithms 18(2):116–140MathSciNetCrossRefGoogle Scholar
  12. de Almeida ML, Mendes GA, Viswanathan GM, da Silva LR (2013) Scale-free homophilic network. Europ Phys J B 86(2):1–6CrossRefGoogle Scholar
  13. Dorogovtsev S, Mendes J (2000) Exactly solvable small-world network. Europ Phys Lett 50(1):1–7CrossRefGoogle Scholar
  14. Dorogovtsev SN, Mendes JFF (2000) Evolution of networks with aging of sites. Phys Rev E 62(2):1842–1845CrossRefGoogle Scholar
  15. Dorogovtsev SN, Mendes JFF (2002) Evolution of networks. Adv Phys 51:1079–1187CrossRefGoogle Scholar
  16. Ducruet C, Zaidi F (2012) Maritime constellations: a complex network approach to shipping and ports. Maritime Policy Manag 39(2):151–168CrossRefGoogle Scholar
  17. Fortunato S (2010) Community detection in graphs. Phys Rep 486(3):75–174MathSciNetCrossRefGoogle Scholar
  18. Frank O, Strauss D (1986) Markov graphs. J Am Stat Assoc 81(395):832–842MathSciNetCrossRefzbMATHGoogle Scholar
  19. Fu P, Liao, K (2006) An evolving scale-free network with large clustering coefficient. In ICARCV IEEE, pp 1–4Google Scholar
  20. Geng X, Wang Y (2009) Degree correlations in citation networks model with aging. Europhys Lett 88(3):38002MathSciNetCrossRefGoogle Scholar
  21. Goldenberg A, Zheng AX, Fienberg SE, Airoldi EM (2010) A survey of statistical network models. Found Trends Mach Learn 2(2):129–233CrossRefGoogle Scholar
  22. Granovetter M (1973) The strength of weak ties. Am J Sociol 78(6):1360–1380CrossRefGoogle Scholar
  23. Guillaume J-L, Latapy M (2006) Bipartite graphs as models of complex networks. Phys A Stat Mech Appl 371(2):795–813CrossRefGoogle Scholar
  24. Guimera R, Mossa S, Turtschi A, Amaral LAN (2005) The worldwide air transportation network: anomalous centrality, community structure, and cities’ global roles. Proc Nat Acad Sci USA 102(22):7794–7799MathSciNetCrossRefzbMATHGoogle Scholar
  25. Holme P, Kim BJ (2002) Growing scale-free networks with tunable clustering. Phys Rev E 65:026107CrossRefGoogle Scholar
  26. Hussain OA, Anwar Z, Saleem S, Zaidi F (2013) Empirical analysis of seed selection criterion in influence mining for different classes of networks. In: Cloud and green computing (CGC), 2013 third international conference on IEEE, pp 348–353Google Scholar
  27. Jackson MO (2005) A survey of network formation models: stability and efficiency. Cambridge University Press, CambridgeGoogle Scholar
  28. Jung CJ (1921) Psychologischen typen, volume Translation H.G. Baynes, 1923. Rascher Verlag, ZurichGoogle Scholar
  29. Kasturirangan R (1999) Multiple scales in small-world networks. In Brain and Cognitive Science Department, MITGoogle Scholar
  30. Klemm K, Eguiluz VM (2002) Growing scale-free networks with small world behavior. Phys Rev E 65:057102CrossRefGoogle Scholar
  31. Krackhardt D (1992) The strength of strong ties: the importance of philos in networks and organization. In: Nohria N, Eccles RG (eds) Networks and organizations. Harvard Business School Press, BostonGoogle Scholar
  32. Krivitsky PN, Handcock MS, Raftery AE, Hoff PD (2009) Representing degree distributions, clustering, and homophily in social networks with latent cluster random effects models. Soc Netw 31(3):204–213CrossRefGoogle Scholar
  33. Kurant M, Gjoka M, Butts CT, Markopoulou (2011) Walking on a graph with a magnifying glass: stratified sampling via weighted random walks. In: Proceedings of the ACM SIGMETRICS joint international conference on measurement and modeling of computer systems, pp 281–292. ACMGoogle Scholar
  34. Lancichinetti A, Fortunato S (2009) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80(1):016118CrossRefGoogle Scholar
  35. Lewis K, Kaufman J, Gonzalez M, Wimmer A, Christakis N (2008) Tastes, ties, and time: a new social network dataset using Soc Netw 30(4):330–342CrossRefGoogle Scholar
  36. Liu J-G, Dang Y-Z, Wang Z (2005) Multistage random growing small-world networks with power-law degree distribution. Chin Phys Lett 3(3):746Google Scholar
  37. Moriano P, Finke J (2013) On the formation of structure in growing networks. arXiv preprint arXiv:1301.4192
  38. Newman MEJ (2001) Scientific collaboration networks. I. Network construction and fundamental results. Phys Rev E 64(1):016131. doi: 10.1103/PhysRevE.64.016131
  39. Newman MEJ (2002) Assortative mixing in networks. Phys Rev Lett, pp 89–20Google Scholar
  40. Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104Google Scholar
  41. Newman MEJ, Watts DJ, Strogatz SH (2002) Random graph models of social networks. Proc Natl Acad Sci USA 99(Suppl 1):2566–2572CrossRefzbMATHGoogle Scholar
  42. Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167MathSciNetCrossRefzbMATHGoogle Scholar
  43. Pan Z, Li X, Wang X (2006) Generalized local-world models for weighted networks. Phys Rev E 73(5):056109CrossRefGoogle Scholar
  44. Pasta MQ, Jan Z, Sallaberry A, Zaidi F (2013) Tunable and growing network generation model with community structures. In: social computing and applications, 2013 third international conference on, pp 233–240Google Scholar
  45. Pasta MQ, Zaidi F, Rozenblat C (2014) Generating online social networks based on socio-demographic attributes. J Complex Netw 2(4):475–494Google Scholar
  46. Rapoport A (1957) Contribution to the theory of random and biased nets. Bull Math Biophys 19:257–277MathSciNetCrossRefGoogle Scholar
  47. Rapoport A, Horvath WJ (1961) A study of a large sociogram. Behav Sci 6(4):279–291CrossRefGoogle Scholar
  48. Robins G, Pattison P, Kalish Y, Lusher D (2007) An introduction to exponential random graph (p) models for social networks. Soc Net 29(2):173–191CrossRefGoogle Scholar
  49. Sallaberry A, Zaidi F, Melançon G (2013) Model for generating artificial social networks having community structures with small-world and scale-free properties. Soc Netw Anal Min 3:597–609CrossRefGoogle Scholar
  50. Schnettler S (2009) A structured overview of 50 years of small-world research. Soc Netw 31(3):165–178CrossRefGoogle Scholar
  51. Scott JP (2000) Social network analysis: a handbook. SAGE Publications, LondonGoogle Scholar
  52. Scott J (2011) Social network analysis: developments, advances, and prospects. Soc Net Anal Min 1:21–26CrossRefGoogle Scholar
  53. Simmel G, Wolff KH (1950) The sociology of Georg Simmel / translated and edited with an introduction by Kurt H. Wolff. Free Press, Glencoe IllGoogle Scholar
  54. Snijders TA, Pattison PE, Robins GL, Handcock MS (2006) New specifications for exponential random graphs models. Sociolog Methodol 36(1):99–153CrossRefGoogle Scholar
  55. Sun X, Feng E, Li J (2007) From unweighted to weighted networks with local information. Phys A Stat Mech Appl 385(1):370–378CrossRefGoogle Scholar
  56. Toivonen R, Kovanen L, Kivel M, Onnela J-P, Saramki J, Kaski K (2009) A comparative study of social network models: network evolution models and nodal attribute models. Soc Netw 31(4):240–254CrossRefGoogle Scholar
  57. Virtanen S (2003) Properties of nonuniform random graph models. Research Report A77, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, FinlandGoogle Scholar
  58. Wang L-N, Guo J-L, Yang H-X, Zhou T (2009) Local preferential attachment model for hierarchical networks. Phys A Stat Mech Appl 388(8):1713–1720CrossRefGoogle Scholar
  59. Wang J, Rong L (2008) Evolving small-world networks based on the modified ba model. Computer science and information technology, international conference on, pp 143–146Google Scholar
  60. Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, CambridgeCrossRefGoogle Scholar
  61. Watts DJ, Strogatz SH (1998) Collective dynamics of ’small-world’ networks. Nature 393:440–442CrossRefGoogle Scholar
  62. Wattsc DJ (2003) Six degrees: the science of a connected age, 1st edn. W. W. Norton & Company, New YorkGoogle Scholar
  63. Wen G, Duan Z, Chen G, Geng X (2011) A weighted local-world evolving network model with aging nodes. Phys A Stat Mech Appl 390(21):4012–4026CrossRefGoogle Scholar
  64. Wong LH, Pattison P, Robins G (2006) A spatial model for social networks. Phys A Stat Mech Appl 360(1):99–120CrossRefGoogle Scholar
  65. Zaidi F (2013) Small world networks and clustered small world networks with random connectivity. Soc Netw Anal Min 3(1):51–63CrossRefGoogle Scholar
  66. Zhu H, Wang X, Zhu J-Y (2003) Effect of aging on network structure. Phys Rev E 68(5):056121CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Wien 2015

Authors and Affiliations

  • Faraz Zaidi
    • 1
    • 2
    Email author
  • Muhammad Qasim Pasta
    • 2
    • 3
  • Arnaud Sallaberry
    • 4
  • Guy Melançon
    • 5
    • 6
  1. 1.Levich Institute and Physics DepartmentCity College of New YorkNew YorkUSA
  2. 2.Karachi Institute of Economics and TechnologyKarachiPakistan
  3. 3.Usman Institute of TechnologyKarachiPakistan
  4. 4.LIRMMUniversité Paul Valéry MontpellierMontpellierFrance
  5. 5.CNRS UMR 5800 LaBRITalenceFrance
  6. 6.INRIA Bordeaux – Sud-OuestTalenceFrance

Personalised recommendations