Mixing patterns in networks.
By Mark Newman. Physical review. E, Statistical, nonlinear, and soft matter physics, 2002
3,066 citations recorded by the source corpus.
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.
Subfields: Mathematical Physics, Statistical and Nonlinear Physics
View Paper: https://www.semanticscholar.org/paper/0ed877bab75b32042a887715380c84ac27e64a8b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Mathematical Physics
- Mark Newman
- Albert-László Barabási
- Alessandro Vespignani
- José Fernando Ferreira Mendes
- Sergey N. Dorogovtsev
- Gregory Kossinets
- Òscar Celma
- Alexander V. Goltsev
In Statistical and Nonlinear Physics
- Santo Fortunato
- Mark Newman
- Jure Leskovec
- M. A. Porter
- Olaf Sporns
- Alex Arenas
- Marc Barthelemy
- Matjaz Perc
Citations in the corpus
- The architecture of globalization: a network approach to international economic integration (2007, background): “In network terminology, the presence of such patterns is referred to as assortative mixing and community structure (Newman, 2003).”
- Synchronization in complex networks (2008, methodology): “Note that the existence of such nodes is only possible in networks with power-law degree distributions (Boccaletti et al., 2006; Newman, 2003b), but this happens with a very small probability as k−γ , with γ > 2.”
- Assessing Vaccination Sentiments with Online Social Media: Implications for Infectious Disease Dynamics and Control (2011, background): “In order to investigate if users preferentially seek information from other users who share their opinion, we measured assortative mixing of users with a qualitatively similar opinion on vaccination (homophily) by calculating the assortativity coefficient r which is defined [13] as”
- It's a Man's Wikipedia? Assessing Gender Inequality in an Online Encyclopedia (2015, methodology): “For the case of same gender connections we use the standard definition of assortativity (Newman 2003): ∑ g P (from = g, to = g)− P (from = g) ∗ P (to = g) 1− ∑ g P (from = g) ∗ P (to = g) (2) For the case of asymmetry across genders, we compare the entries of L from one gender to the other, as A = L”
- Recommender Systems (2012, background): “This degree–degree correlation can be characterized by the average degree of the nearest neighbors [64,65] or a variant of Pearson coefficient called assortativity coefficient [66,67].”
- The Anatomy of the Facebook Social Graph (2011, background): “ructure. We focus on three other such quantities with essentially complete coverage for Facebook’s users; age, gender, and country of origin, and characterize their homophily [36] and mixing patterns [32]. We start by considering friendship patterns amongst individuals with different ages, and comput”
- Stock network stability in times of crisis (2014, methodology): “Additionally, we calculate the weighted clustering coefficient [30] and the assortativity coefficient [31].”
- The Anatomy of a Scientific Rumor (2013, methodology): “A standard method to uncover the presence of correlations in the network is to investigate the assortative mixing of its nodes [11, 12].”
- Effects of missing data in social networks (2003, background): “It has been shown that unipartite networks that are assortatively mixed by degree are more robust to removal of vertices than disassortative or neutral networks ( Newman, 2002b ).”
- Network ‘Small-World-Ness’: A Quantitative Method for Determining Canonical Network Equivalence (2008, background): “This is assumed to establish a ‘firstpass’ model of that system’s topology, which may be augmented by considering other factors such as degree sequence [23], degree correlation [25], modularity [26] and other properties.”
- Social cohesion in a hierarchically structured embayment population of Indo-Pacific bottlenose dolphins (2009, methodology): “Newman’s assortativity coefficient, r (Newman 2003) was then calculated to determine whether preferred associations formed between individuals that had similar ranging patterns.”
- Music recommendation and discovery in the long tail (2008, methodology): “We use the formula defined in (Newman, 2003a) to compute mixing patterns for discrete attributes.”
- Finding and evaluating community structure in networks. (2003, methodology): “S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW ~Oxford University Press, Oxford, 2003!. @4# M. E. J. Newman, SIAM Rev. 45, 167 ~2003!. @5# M. Faloutsos, P. Faloutsos, and C. Faloutsos, Comput.”
- Bipartite Graphs as Models of Complex Networks (2003, background): “…decreasing or constant) of the plot which relates the average degree of the neighbors of nodes of degree k , to k [11, 63, 64], or with a single parameter (assortativity coefficient), which may be positive (assortative networks), negative (dissortative networks) or null (neutral networks) [53].”
- Detecting rich-club ordering in complex networks (2006, background): “In turn, the quantity E k k ′ can be expressed as a function of the joint degree probability distributio”