The transsortative structure of networks

DOI10.1098/RSPA.2019.0772MaRDI QIDQ5160938zbMATH OpenOpenAlexWikidataFDO

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

Publication date 29 October 2021

Published in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.09538, https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7277123

zbMATH Keywords

complexitynetwork sciencerandom networksstatistical physicsmulti-hop structure

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of statistical and quantum mechanics to economics (econophysics) (91B80) Connectivity (05C40)

Abstract: Network topologies can be non-trivial, due to the complex underlying behaviors that form them. While past research has shown that some processes on networks may be characterized by low-order statistics describing nodes and their neighbors, such as degree assortativity, these quantities fail to capture important sources of variation in network structure. We introduce a property called transsortativity that describes correlations among a node's neighbors, generalizing these statistics from immediate one-hop neighbors to two-hop neighbors. We describe how transsortativity can be systematically varied, independently of the network's degree distribution and assortativity. Moreover, we show that it can significantly impact the spread of contagions as well as the perceptions of neighbors, known as the majority illusion. Our work improves our ability to create and analyze more realistic models of complex networks.

Recommendations

• Assortativity in complex networks
• Higher order assortativity in complex networks
• Spreading dynamics in heterogeneous graphs: beyond the assortativity coefficient
• Structure of triadic relations in multiplex networks
• Mixing patterns and community structure in networks

Cites work

• scientific article; zbMATH DE number 1996193 (Why is no real title available?)
• A critical point for random graphs with a given degree sequence
• A simple model of global cascades on random networks
• Assortativity in complex networks
• Collective dynamics of `small-world' networks
• Correlated binomial models and correlation structures
• Higher order assortativity in complex networks
• How Many People Do You Know in Prison?
• Mean field solution of the Ising model on a Barabási-Albert network
• Mixed degree-degree correlations in directed social networks
• Random graph models of social networks
• Reproducing kernel method for the numerical solution of the Brinkman-Forchheimer momentum equation

Cited in

(5)

• Spreading dynamics in heterogeneous graphs: beyond the assortativity coefficient
• The role of graphlets in viral processes on networks
• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• The influence of student interaction on GPA in social networks
• The evolution and optimization control of collective decision-making with opinion preferences on social networks

This page was built for publication: The transsortative structure of networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160938)