Skip to main content

Second-Order Assortative Mixing in Social Networks

  • Conference paper
  • First Online:
Complex Networks VIII (CompleNet 2017)

Part of the book series: Springer Proceedings in Complexity ((SPCOM))

Included in the following conference series:

Abstract

In a social network, the number of links of a node, or node degree, is often assumed as a proxy for the node’s importance or prominence within the network. It is known that social networks exhibit the (first-order) assortative mixing, i.e. if two nodes are connected, they tend to have similar node degrees, suggesting that people tend to mix with those of comparable prominence. In this paper, we report the second-order assortative mixing in social networks. If two nodes are connected, we measure the degree correlation between their most prominent neighbours, rather than between the two nodes themselves. We observe very strong second-order assortative mixing in social networks, often significantly stronger than the first-order assortative mixing. This suggests that if two people interact in a social network, then the importance of the most prominent person each knows is very likely to be the same. This is also true if we measure the average prominence of neighbours of the two people. This property is weaker or negative in non-social networks. We investigate a number of possible explanations for this property. However, none of them was found to provide an adequate explanation. We therefore conclude that second-order assortative mixing is a new property of social networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Barabási, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509 (1999)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  2. Barabási, A.L.: Linked: The New Science of Networks. Perseus Publishing (2002)

    Google Scholar 

  3. Boguñá, M., Pastor-Satorras, R., Vespignani, A.: Cut-offs and finite size effects in scale-free networks. Eur. Phys. J. B 38, 205–210 (2004)

    Article  ADS  MATH  Google Scholar 

  4. Bornholdt, S., Schuster, H.G.: Handbook of Graphs and Networks—From the Genome to the Internet. Wiley-VCH, Weinheim Germany (2002)

    Book  MATH  Google Scholar 

  5. Colizza, V., Flammini, A., Maritan, A., Vespignani, A.: Characterization and modeling of protein-protein interaction networks. Physica A 352, 1–27 (2005)

    Article  ADS  Google Scholar 

  6. Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F.: Pseudofractal scale-free web. Phys. Rev. E 65, 066122 (2002)

    Article  ADS  Google Scholar 

  7. Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks—From Biological Nets to the Internet and WWW. Oxford University Press, Oxford (2003)

    Book  MATH  Google Scholar 

  8. Efron, B.: Computers and the theory of statistics thinking the unthinkable. SIAM Rev. 21, 460–480 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  9. Erdös, P., Rényi, A.: On random graphs. Publ. Math. Debrecen 6, 290 (1959)

    MathSciNet  MATH  Google Scholar 

  10. Gleiser, P., Danon, L.: Community structure in jazz. Adv. Complex Syst. 6, 565–573 (2003)

    Article  Google Scholar 

  11. Guimera, R., Danon, L., Diaz-Guilera, A., Giralt, F., Arenas, A.: Self-similar community structure in a network of human interactions. Phys. Rev. E 68, 065103 (2003)

    Article  ADS  Google Scholar 

  12. Jeong, H., Tombor, B., Albert, R., Oltvai, Z.N., Barabási, A.-L.: The large-scale organization of metabolic networks. Nature 407, 651–654 (2000)

    Article  ADS  Google Scholar 

  13. Mahadevan, P., Krioukov, D., Fall, K., Vahdat, A.: Systematic topology analysis and generation using degree correlations. ACM SIGCOMM Comput. Commun. Rev. 36(4), 135–146 (2006)

    Article  Google Scholar 

  14. Maslov, S., Sneppen, K.: Specificity and stability in topology of protein networks. Science 296(5569), 910–913 (2002)

    Article  ADS  Google Scholar 

  15. Maslov, S., Sneppenb, K., Zaliznyaka, A.: Detection of topological patterns in complex networks: correlation profile of the internet. Physica A 333, 529–540 (2004)

    Article  ADS  Google Scholar 

  16. Newman, M.: Scientific collaboration networks. I. Network construction and fundamental results. Phys. Rev. E 64(016131), 016131 (2001)

    Article  ADS  Google Scholar 

  17. Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89(208701), 208701 (2002)

    Article  ADS  Google Scholar 

  18. Pastor-Satorras, R., Vázquez, A., Vespignani, A.: Dynamical and correlation properties of the Internet. Phys. Rev. Lett. 87(258701), 258701 (2001)

    Article  ADS  Google Scholar 

  19. Pastor-Satorras, R., Vespignani, A.: Evolution and Structure of the Internet—A Statistical Physics Approach. Cambridge University Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  20. Ravasz, E., Barabási, A.-L.: Hierarchical organization in complex networks. Phys. Rev. E 67, 026112 (2003)

    Article  ADS  MATH  Google Scholar 

  21. Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)

    Book  MATH  Google Scholar 

  22. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440 (1998)

    Article  ADS  Google Scholar 

  23. Watts, J.: Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton Univeristy Press, New Jersey, USA (1999)

    MATH  Google Scholar 

  24. Zhou, S., Mondragón, R.: Structural constraints in complex networks. New J. Phys. 9(173), 1–11 (2007)

    MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors thank Ole Winther and Sune Lehmann of DTU, Denmark for discussions relating to the clustering coefficient.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shi Zhou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Zhou, S., Cox, I.J., Hansen, L.K. (2017). Second-Order Assortative Mixing in Social Networks. In: Gonçalves, B., Menezes, R., Sinatra, R., Zlatic, V. (eds) Complex Networks VIII. CompleNet 2017. Springer Proceedings in Complexity. Springer, Cham. https://doi.org/10.1007/978-3-319-54241-6_1

Download citation

Publish with us

Policies and ethics