Assortative Mixing¶
Core Idea¶
Assortative mixing is the network pattern in which adjacent nodes are more similar on a declared attribute than an appropriate edge-end baseline predicts. Disassortative mixing is the opposite pattern: edges connect unlike nodes more often than expected. Neutral mixing means that, conditional on the baseline and admissible edges, the attributes observed at the two ends of an edge have no residual association.
The abstraction does not require a human preference. A social friendship network can be assortative by age; a technological network can be disassortative by degree; a protein-interaction network can exhibit degree correlations; and an information network can be assortative by political label.
Broad Use¶
The abstraction travels literally across networks whose nodes and edges have unrelated meanings.
Social networks. Friendship, marriage, advice, work, support, and communication ties often connect people similar in age, education, religion, occupation, ethnicity, attitudes, or other attributes. McPherson, Smith-Lovin, and Cook synthesize this as homophily and emphasize both its breadth and the ecological contexts that shape who can meet. Network assortativity supplies a general measurement interface for these patterns without making all of them the result of deliberate choice.
Clarity¶
The fastest diagnostic is to compare three quantities: raw same-type edge share, expected same-type share under the endpoint marginals, and their normalized difference. Suppose an undirected network has two equally represented endpoint types, A and B. Of eight edges, three are A–A, three are B–B, and two are A–B. In the symmetric mixing matrix, (e_{AA}=⅜), (e_{BB}=⅜), and the cross-type edge contributes (e_{AB}=e_{BA}=⅛).
Manages Complexity¶
A network with millions of edges and a rich attribute table contains an enormous set of pairwise observations. The mixing matrix compresses them into a joint endpoint distribution; the coefficient compresses that distribution further into a signed scalar. This reduction makes networks with different sizes and category frequencies comparable under an explicit baseline.
Abstract Reasoning¶
Assortative mixing licenses several disciplined inferences.
Baseline inference. If (e_{ij}=a_i b_j) for all relevant type pairs, edge endpoints are neutral with respect to that attribute under the stated sampling model. A diagonal count above its marginal expectation supports assortativity; raw sameness alone does not.
Knowledge Transfer¶
Transfer begins by replacing the substrate while preserving the roles. In a friendship network, nodes are people, edges are friendships, and the attribute might be age. In the Internet, nodes are autonomous systems, edges are peering relations, and the attribute might be degree. In a protein network, nodes are proteins, edges are interactions, and the attribute might be functional class. In a citation network, nodes are documents, directed edges are citations, and the attribute might be field. Each case supplies the same network, endpoint attribute, joint mixing distribution, marginals, null baseline, and signed comparison.
Relationships to Other Abstractions¶
Current abstraction Assortative Mixing Prime
Parents (1) — more general patterns this builds on
-
Assortative Mixing presupposes Network Prime
The accepted reference-grade review places Assortative Mixing under Network because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
Hierarchy path (1) — routes to 1 parentless root
- Assortative Mixing → Network → Reservoir-Flux Network → Conservation Laws → Invariance