Assortative Mixing in Networks
University of Michigan–Ann Arbor · Santa Fe Institute
Indexed inarxivcrossrefpubmed
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.
Citation impact
5,070
total citations
- FWCI
- 56.33
- Percentile
- 100%
- References
- 35
Citations per year
Authors
1Topics & keywords
Topics
Keywords
- Mixing (physics)
- Computer science
- Assortative mating
- Measure (data warehouse)
- Statistical physics
- Variety (cybernetics)
- Vertex (graph theory)
- Theoretical computer science
UN Sustainable Development Goals
- Reduced inequalities
No related works found for this paper.