Assortative mixing in networks.

By Mark Newman. Physical Review Letters, 2002

4,818 citations recorded by the source corpus.

A network is said to show assortative mixing if the nodes in the network that have many connections tend to be connected to other nodes with many connections. Here we measure mixing patterns in a variety of networks and find that social networks are mostly assortatively mixed, but that technological and biological networks tend to be disassortative. We propose a model of an assortatively mixed network, which we study both analytically and numerically. Within this model we find that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.

Subfields: Mathematical Physics, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/532d364b0ab407c349388a36832b226bb0ea33d5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Mathematical Physics

  1. Mark Newman
  2. Alessandro Vespignani
  3. Albert-László Barabási
  4. Romualdo Pastor-Satorras
  5. José Fernando Ferreira Mendes
  6. Sergey N. Dorogovtsev
  7. Alexander V. Goltsev
  8. Gregory Kossinets

In Statistical and Nonlinear Physics

  1. Mark Newman
  2. Olaf Sporns
  3. Santo Fortunato
  4. Albert-László Barabási
  5. Jure Leskovec
  6. Alessandro Vespignani
  7. Marc Barthelemy
  8. Linyuan Lu

Citations in the corpus