The transsortative structure of networks

Complexity Digest

Shin-Chieng Ngo, Allon G. Percus, Keith Burghardt and Kristina Lerman

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volume 476 Issue 2237


Network topologies can be highly non-trivial, due to the complex underlying behaviours that form them. While past research has shown that some processes on networks may be characterized by local statistics describing nodes and their neighbours, such as degree assortativity, these quantities fail to capture important sources of variation in network structure. We define a property called transsortativity that describes correlations among a node’s neighbours. Transsortativity can be systematically varied, independently of the network’s degree distribution and assortativity. Moreover, it can significantly impact the spread of contagions as well as the perceptions of neighbours, known as the majority illusion. Our work improves our ability to create and analyse more realistic models of complex networks.


View original post