Mixing patterns in networks

Santa Fe Institute · University of Michigan–Ann Arbor

PubMed
Indexed inarxivcrossrefpubmed

Abstract

We study assortative mixing in networks, the tendency for vertices in networks to be connected to other vertices that are like (or unlike) them in some way. We consider mixing according to discrete characteristics such as language or race in social networks and scalar characteristics such as age. As a special example of the latter we consider mixing according to vertex degree, i.e., according to the number of connections vertices have to other vertices: do gregarious people tend to associate with other gregarious people? We propose a number of measures of assortative mixing appropriate to the various mixing types, and apply them to a variety of real-world networks, showing that assortative mixing is a…

Citation impact

3,147
total citations
FWCI
42.49
Percentile
100%
References
83
Citations per year

Authors

1

Topics & keywords

Keywords
  • Assortativity
  • Mixing (physics)
  • Mixing patterns
  • Vertex (graph theory)
  • Computer science
  • Statistical physics
  • Scalar (mathematics)
  • Mathematics
UN Sustainable Development Goals
  • Reduced inequalities
No related works found for this paper.