Assortative mixing: Difference between revisions
m Robot - Moving category Social sciences methodology to Category:Social science methodology per CFD at Wikipedia:Categories for discussion/Log/2014 May 14. |
Hindumuninc (talk | contribs) |
||
| Line 104: | Line 104: | ||
*[[Homophily]] |
*[[Homophily]] |
||
*[[Heterophily]] |
*[[Heterophily]] |
||
*[[Assortative mating]] |
|||
==References== |
==References== |
||
Revision as of 23:00, 27 August 2014
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. 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,[5][6] although there are exceptions.[7][8]
See also
- Preferential attachment
- Complex network
- Graph theory
- Friendship paradox
- Homophily
- Heterophily
- Assortative mating
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.
- ^ M. McPherson, L. Smith-Lovin, and 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.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ S. Maslov and 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.
- ^ R. Pastor-Satorras, A. Vázquez, and 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.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ 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.
- ^ S. Johnson, J.J. Torres, J. Marro, and 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.
{{cite journal}}: CS1 maint: extra punctuation (link) CS1 maint: multiple names: authors list (link) - ^ G. Bagler and 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 and 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.
 | This applied mathematics–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. |