corner
corner

Phys. Rev. Lett. 89, 208701 (2002) [4 pages]

Assortative Mixing in Networks

Download: PDF (95 kB) Buy this article Export: BibTeX or EndNote (RIS)

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

Received 20 May 2002; published 28 October 2002

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.

© 2002 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevLett.89.208701
DOI:
10.1103/PhysRevLett.89.208701
PACS:
89.75.Hc, 64.60.Ak, 87.23.Ge, 89.20.Hh