%0 Generic %1 Newman2002 %A Newman, M. E. J. %D 2002 %K community detection k-partite measure modularity %T Mixing patterns in networks %U http://arxiv.org/abs/cond-mat/0209450 %X We study assortative mixing in networks, the tendency for vertices in networks to be connected to other vertices that are like (or unlike) them in some way. We consider mixing according to discrete characteristics such as language or race in social networks and scalar characteristics such as age. As a special example of the latter we consider mixing according to vertex degree, i.e., according to the number of connections vertices have to other vertices: do gregarious people tend to associate with other gregarious people? We propose a number of measures of assortative mixing appropriate to the various mixing types, and apply them to a variety of real-world networks, showing that assortative mixing is a pervasive phenomenon found in many networks. We also propose several models of assortatively mixed networks, both analytic ones based on generating function methods, and numerical ones based on Monte Carlo graph generation techniques. We use these models to probe the properties of networks as their level of assortativity is varied. In the particular case of mixing by degree, we find strong variation with assortativity in the connectivity of the network and in the resilience of the network to the removal of vertices.

@misc{Newman2002, abstract = { We study assortative mixing in networks, the tendency for vertices in networks to be connected to other vertices that are like (or unlike) them in some way. We consider mixing according to discrete characteristics such as language or race in social networks and scalar characteristics such as age. As a special example of the latter we consider mixing according to vertex degree, i.e., according to the number of connections vertices have to other vertices: do gregarious people tend to associate with other gregarious people? We propose a number of measures of assortative mixing appropriate to the various mixing types, and apply them to a variety of real-world networks, showing that assortative mixing is a pervasive phenomenon found in many networks. We also propose several models of assortatively mixed networks, both analytic ones based on generating function methods, and numerical ones based on Monte Carlo graph generation techniques. We use these models to probe the properties of networks as their level of assortativity is varied. In the particular case of mixing by degree, we find strong variation with assortativity in the connectivity of the network and in the resilience of the network to the removal of vertices. }, added-at = {2009-04-07T08:56:52.000+0200}, author = {Newman, M. E. J.}, biburl = {https://www.bibsonomy.org/bibtex/2f9424f63ea4db80b8d44237ed88cb7c0/folke}, description = {[cond-mat/0209450] Mixing patterns in networks}, interhash = {80620ec28fc6f8068f34f3e2b634e7aa}, intrahash = {f9424f63ea4db80b8d44237ed88cb7c0}, keywords = {community detection k-partite measure modularity}, note = {cite arxiv:cond-mat/0209450 Comment: 14 pages, 2 tables, 4 figures, some additions and corrections in this version}, timestamp = {2009-04-07T08:56:52.000+0200}, title = {Mixing patterns in networks}, url = {http://arxiv.org/abs/cond-mat/0209450}, year = 2002 }