Understanding Complex Systems: From Networks to Optimal Higher-Order Models
arXiv:1806.05977
Abstract
To better understand the structure and function of complex systems, researchers often represent direct interactions between components in complex systems with networks, assuming that indirect influence between distant components can be modelled by paths. Such network models assume that actual paths are memoryless. That is, the way a path continues as it passes through a node does not depend on where it came from. Recent studies of data on actual paths in complex systems question this assumption and instead indicate that memory in paths does have considerable impact on central methods in network science. A growing research community working with so-called higher-order network models addresses this issue, seeking to take advantage of information that conventional network representations disregard. Here we summarise the progress in this area and outline remaining challenges calling for more research.
arXiv comment8 pages, 4 figures
References in corpus (20)
- Emergence of scaling in random networks
- The structure and function of complex networks
- Community detection in graphs
- Catastrophic cascade of failures in interdependent networks
- Synchronization in small-world systems
- Higher-order organization of complex networks
- The physics of spreading processes in multilayer networks
- Memory in network flows and its effects on spreading dynamics and community detection
- Causality-Driven Slow-Down and Speed-Up of Diffusion in Non-Markovian Temporal Networks
- Modeling the Multi-layer Nature of the European Air Transport Network: Resilience and Passengers Re-scheduling under random failures
- Topological strata of weighted complex networks
- Representing higher-order dependencies in networks
- Betweenness Preference: Quantifying Correlations in the Topological Dynamics of Temporal Networks
- Modeling sequences and temporal networks with dynamic community structures
- Motif-based communities in complex networks
- Mapping higher-order network flows in memory and multilayer networks with Infomap
- Correlated dynamics in egocentric communication networks
- A bag-of-paths framework for network data analysis
- Network Discovery by Generalized Random Walks
- Maps of sparse Markov chains efficiently reveal community structure in network flows with memory