Assortative Mixing in Networks

M. E. J. Newman
Phys. Rev. Lett. 89, 208701 – Published 28 October 2002

Abstract

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.

  • Figure
  • Received 20 May 2002

DOI:https://doi.org/10.1103/PhysRevLett.89.208701

©2002 American Physical Society

Authors & Affiliations

M. E. J. Newman

  • Department of Physics, University of Michigan, Ann Arbor, MI 48109–1120
  • Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, New Mexico 87501

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 89, Iss. 20 — 11 November 2002

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×