Fig. 2

Examples of dyadic and heterophilic distributions of node properties in a network. Nodes can be classified as either 0 or 1 (white or grey respectively). a shows a network on which 5 grey nodes are distributed randomly. b For a certain number of nodes, if edges occur more between similar nodes (i.e., 1–1 edges) than expected at random, the network is dyadic. c If edges occur more between dissimilar nodes (i.e., 1–0 edges) than at random, then the network is heterophilic