We argue that social networks differ from most other types of networks, including technological and biological networks, in two important ways. First, they have nontrivial clustering or network transitivity and second, they show positive correlations, also called assortative mixing, between the degrees of adjacent vertices. Social networks are often divided into groups or communities, and it has recently been suggested that this division could account for the observed clustering. We demonstrate that group structure in networks can also account for degree correlations. We show using a simple model that we should expect assortative mixing in such networks whenever there is variation in the sizes of the groups and that the predicted level of assortative mixing compares well with that observed in real-world networks.
%0 Journal Article
%1 newman2003social
%A Newman, M. E. J.
%A Park, Juyong
%C Department of Physics and Center for the Study of Complex Systems, University of Michigan, Ann Arbor, Michigan 48109, USA.
%D 2003
%I American Physical Society
%J Physical Review E
%K 2003 _todo socialNetwork
%N 3
%R 10.1103/PhysRevE.68.036122
%T Why social networks are different from other types of networks.
%U http://pre.aps.org/abstract/PRE/v68/i3/e036122
%V 68
%X We argue that social networks differ from most other types of networks, including technological and biological networks, in two important ways. First, they have nontrivial clustering or network transitivity and second, they show positive correlations, also called assortative mixing, between the degrees of adjacent vertices. Social networks are often divided into groups or communities, and it has recently been suggested that this division could account for the observed clustering. We demonstrate that group structure in networks can also account for degree correlations. We show using a simple model that we should expect assortative mixing in such networks whenever there is variation in the sizes of the groups and that the predicted level of assortative mixing compares well with that observed in real-world networks.
@article{newman2003social,
abstract = {We argue that social networks differ from most other types of networks, including technological and biological networks, in two important ways. First, they have nontrivial clustering or network transitivity and second, they show positive correlations, also called assortative mixing, between the degrees of adjacent vertices. Social networks are often divided into groups or communities, and it has recently been suggested that this division could account for the observed clustering. We demonstrate that group structure in networks can also account for degree correlations. We show using a simple model that we should expect assortative mixing in such networks whenever there is variation in the sizes of the groups and that the predicted level of assortative mixing compares well with that observed in real-world networks.},
added-at = {2010-03-15T10:32:48.000+0100},
address = {Department of Physics and Center for the Study of Complex Systems, University of Michigan, Ann Arbor, Michigan 48109, USA.},
author = {Newman, M. E. J. and Park, Juyong},
biburl = {https://www.bibsonomy.org/bibtex/201f063dea546d0256dc2b573e2009280/trude},
doi = {10.1103/PhysRevE.68.036122},
interhash = {c074e9640dd0a12bdcb5165afcab5981},
intrahash = {01f063dea546d0256dc2b573e2009280},
issn = {1063-651X},
journal = {Physical Review E},
keywords = {2003 _todo socialNetwork},
month = {September},
number = 3,
publisher = {American Physical Society},
timestamp = {2011-03-05T17:08:52.000+0100},
title = {Why social networks are different from other types of networks.},
url = {http://pre.aps.org/abstract/PRE/v68/i3/e036122},
volume = 68,
year = 2003
}