In the study of complex networks, assortative mixing, or assortativity, is a bias in favor of connections between network nodes with similar characteristics.[1] In the specific case of social networks, assortative mixing is also known as homophily. The rarer disassortative mixing is a bias in favor of connections between dissimilar nodes.
In social networks, for example, individuals commonly choose to associate with others of similar age, nationality, location, race, income, educational level, religion, or language as themselves.[2] In networks of sexual contact, the same biases are observed, but mixing is also disassortative by gender – most partnerships are between individuals of opposite sex.
Assortative mixing can have effects, for example, on the spread of disease: if individuals have contact primarily with other members of the same population groups, then diseases will spread primarily within those groups. Many diseases are indeed known to have differing prevalence in different population groups, although other social and behavioral factors affect disease prevalence as well, including variations in quality of health care and differing social norms.
Assortative mixing is also observed in other (non-social) types of networks, including biochemical networks in the cell,[3] computer and information networks,[4] and others.
Of particular interest is the phenomenon of assortative mixing by degree, meaning the tendency of nodes with high degree to connect to others with high degree, and similarly for low degree.[5] Because degree is itself a topological property of networks, this type of assortative mixing gives rise to more complex structural effects than other types. Empirically it has been observed that most social networks mix assortatively by degree, but most networks of other types mix disassortatively,[6][7] although there are exceptions.[8][9]
YouTube Encyclopedic
-
1/5Views:1 1202 3028 8331 4082 311
-
Assortativity - Homophily
-
4 1 Assortativity Index Calculation
-
Network Analysis. Lecture 7. Structural Equivalence and Assortative Mixing
-
8 2 8B resilience and assortativity
-
Introduction to SNA. Lecture 6. Network structure and visualization
Transcription
See also
- Assortative mating
- Assortativity
- Complex network
- Friendship paradox
- Graph theory
- Heterophily
- Homophily
- Preferential attachment
References
- ^ M. E. J. Newman (2003). "Mixing patterns in networks". Physical Review E. 67 (2): 026126. arXiv:cond-mat/0209450. Bibcode:2003PhRvE..67b6126N. doi:10.1103/PhysRevE.67.026126. PMID 12636767. S2CID 15186389.
- ^ M. McPherson; L. Smith-Lovin & J. M. Cook (2001). "Birds of a feather: Homophily in social networks". Annual Review of Sociology. 27: 415–444. doi:10.1146/annurev.soc.27.1.415. S2CID 2341021.
- ^ S. Maslov & K. Sneppen (2002). "Specificity and stability in topology of protein networks". Science. 296 (5569): 910–913. arXiv:cond-mat/0205380. Bibcode:2002Sci...296..910M. doi:10.1126/science.1065103. PMID 11988575. S2CID 2096348.
- ^ R. Pastor-Satorras; A. Vázquez & A. Vespignani (2001). "Dynamical and correlation properties of the Internet". Physical Review Letters. 87 (25): 258701. arXiv:cond-mat/0105161. Bibcode:2001PhRvL..87y8701P. doi:10.1103/PhysRevLett.87.258701. PMID 11736611. S2CID 6232586.
- ^ von Csefalvay, Chris (2023), "Simple compartmental models", Computational Modeling of Infectious Disease, Elsevier, pp. 19–91, doi:10.1016/b978-0-32-395389-4.00011-6, ISBN 978-0-323-95389-4, retrieved 2023-03-03
- ^ M. E. J. Newman (2002). "Assortative mixing in networks". Physical Review Letters. 89 (20): 208701. arXiv:cond-mat/0205405. Bibcode:2002PhRvL..89t8701N. doi:10.1103/PhysRevLett.89.208701. PMID 12443515. S2CID 1574486.
- ^ S. Johnson; J.J. Torres; J. Marro & M.A. Muñoz (2010). "Entropic origin of disassortativity in complex networks". Physical Review Letters. 104 (10): 108702. arXiv:1002.3286. Bibcode:2010PhRvL.104j8702J. doi:10.1103/PhysRevLett.104.108702. PMID 20366458. S2CID 32880913.
- ^ G. Bagler & S. Sinha (2007). "Assortative mixing in protein contact networks and protein folding kinetics". Bioinformatics. 23 (14): 1760–7. arXiv:0711.2723. doi:10.1093/bioinformatics/btm257. PMID 17519248.
- ^ A. V. Goltsev; S. N. Dorogovtsev & J.F.F. Mendes (2008). "Percolation on correlated networks". Physical Review E. 78 (5): 051105. arXiv:0810.1742. Bibcode:2008PhRvE..78e1105G. doi:10.1103/PhysRevE.78.051105. PMID 19113093. S2CID 76949.
 | This graph theory-related article is a stub. You can help Wikipedia by expanding it. |
 | This sociology-related article is a stub. You can help Wikipedia by expanding it. |
This page was last edited on 16 December 2023, at 15:35