The transsortative structure of networks

  • Ngo S
  • Percus A
  • Burghardt K
  • et al.
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Ngo, S.-C., Percus, A. G., Burghardt, K., & Lerman, K. (2020). The transsortative structure of networks. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 476(2237). https://doi.org/10.1098/rspa.2019.0772

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free