Assortative mixing in networks.
By Mark Newman. Physical Review Letters, 2002
4,818 citations recorded by the source corpus.
A network is said to show assortative mixing if the nodes in the network that have many connections tend to be connected to other nodes with many connections. Here we measure mixing patterns in a variety of networks and find that social networks are mostly assortatively mixed, but that technological and biological networks tend to be disassortative. We propose a model of an assortatively mixed network, which we study both analytically and numerically. Within this model we find that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.
Subfields: Mathematical Physics, Statistical and Nonlinear Physics
View Paper: https://www.semanticscholar.org/paper/532d364b0ab407c349388a36832b226bb0ea33d5
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
- Alessandro Vespignani
- Albert-László Barabási
- Romualdo Pastor-Satorras
- José Fernando Ferreira Mendes
- Sergey N. Dorogovtsev
- Alexander V. Goltsev
- Gregory Kossinets
In Statistical and Nonlinear Physics
- Mark Newman
- Olaf Sporns
- Santo Fortunato
- Albert-László Barabási
- Jure Leskovec
- Alessandro Vespignani
- Marc Barthelemy
- Linyuan Lu
Citations in the corpus
- Functional neural network analysis in frontotemporal dementia and Alzheimer's disease using EEG and graph theory (2009, background): “An assortative network is generally associated with a more efficient information processing and a lower vulnerability to network damage [8,21,22].”
- Detecting community structure in networks (2004, background): “Assuming these are uncorrelated (which is known not to be true in some networks [39, 40]), this time scales as the square of the mean degree, i.e., as m 2 =n 2 .”
- Universality in network dynamics (2013, background): “Despite the profound diversity in the scale and purpose of networks observed in nature and technology, their topology shares several highly reproducible and often universal characteristics [1–8]: many real networks display the small world property [9], are scale-free [10], develop distinct community”
- On the uniform generation of random graphs with prescribed degree sequences (2003, methodology): “We will refer to them as the switching algorithm [8, 9, 15, 16, 17, 18, 19] and the matching algorithm [4, 5, 19].”
- Node Similarity Preserving Graph Convolutional Networks (2020, background): “tasks since node similarity can play a crucial role in many scenarios. Next we illustrate several examples of these scenarios. First,whenthe graphstructureisnotoptimal, e.g.,graphs are disassortative [26] or graph structures have been manipulated by adversarial attacks, relying heavily on the struct”
- The rich-club phenomenon in the Internet topology (2003, background): “distribution [1] [2] [3] (degree is the number of links a node has) and they are known as scale-free networks. Scale-free networks can be grouped into assortative, disassortative and neutral networks [4] [5] [6]. Social networks (e.g. the co-authorship network) are scale-free assortative networks, i”
- Why social networks are different from other types of networks. (2003, background): “It has been observed that the degrees of adjacent vertices in networks are positively correlated in social networks but negatively correlated in most other networks [8].”
- An information-theoretic primer on complexity, self-organization, and emergence (2009, background): “…if a node is reached by following a randomly chosen link, then the remaining number of links (the remaining degree) of this node is not distributed according to p k — instead it is biased in favor of nodes of high degree, since more links end at a high-degree node than at a low-degree one [44].”
- Structure and dynamics of core/periphery networks (2013, background): “If the number of connections is sufficiently high, and the degree distribution is slowly decreasing, even random networks without multiple and self-connections contain a core of about n2/3 highly interconnected nodes, where n is the number of nodes in the network [67].”
- Complex network approaches to nonlinear time series analysis (2019, background): “, the correlation coefficient between the degrees of all pairs of mutually connected vertices [85].”
- Test-retest reliability of resting-state connectivity network characteristics using fMRI and graph theoretical measures (2012, background): “It is quantified by correlating the degree of each node to the mean degree of their neighbors (Newman, 2002).”