Corpus ID: 236428317

Predicting Influential Higher-Order Patterns in Temporal Network Data

@article{Gote2021PredictingIH,
  title={Predicting Influential Higher-Order Patterns in Temporal Network Data},
  author={Christoph Gote and Vincenzo Perri and Ingo Scholtes},
  journal={ArXiv},
  year={2021},
  volume={abs/2107.12100}
}
Networks are frequently used to model complex systems comprised of interacting elements. While links capture the topology of direct interactions, the true complexity of many systems originates from higher-order patterns in paths by which nodes can indirectly in uence each other. Path data, representing ordered sequences of consecutive direct interactions, can be used to model these patterns. However, to avoid over tting, such models should only consider those higher-order patterns for which the… Expand

Figures and Tables from this paper

References

SHOWING 1-10 OF 37 REFERENCES
When is a Network a Network?: Multi-Order Graphical Model Selection in Pathways and Temporal Networks
TLDR
This work develops a model selection technique to infer the optimal number of layers of such a model and shows that it outperforms baseline Markov order detection techniques and allows to infer graphical models that capture both topological and temporal characteristics of such data. Expand
Higher-order aggregate networks in the analysis of temporal networks: path structures and centralities
TLDR
A novel framework for the study of path-based centralities in higher-order aggregate networks, a recently proposed generalization of the commonly used static representation of time-stamped data is introduced. Expand
Higher-order Networks of Diabetes Comorbidities: Disease Trajectories that Matter
TLDR
It is shown that higher-order networks provide a more accurate representation of the underlying disease trajectories than traditional first-order Networks, and differences in PageRank scores and community structure at higher orders are analyzed. Expand
Representing higher-order dependencies in networks
TLDR
The higher-order network (HON) representation is proposed, including accuracy, scalability, and direct compatibility with the existing suite of network analysis methods, and it is illustrated how HON can be applied to a broad variety of tasks, such as random walking, clustering, and ranking. Expand
Memory in network flows and its effects on spreading dynamics and community detection.
TLDR
It is suggested that accounting for higher-order memory in network flows can help to better understand how real systems are organized and function. Expand
From networks to optimal higher-order models of complex systems
Rich data are revealing that complex dependencies between the nodes of a network may not be captured by models based on pairwise interactions. Higher-order network models go beyond these limitations,Expand
Modelling sequences and temporal networks with dynamic community structures
TLDR
A data-driven method that determines relevant timescales for the dynamics and uses it to identify communities is presented and a nonparametric Bayesian inference framework is developed that identifies the simplest such model that can explain temporal interaction data. Expand
Maps of random walks on complex networks reveal community structure
TLDR
An information theoretic approach is introduced that reveals community structure in weighted and directed networks of large-scale biological and social systems and reveals a directional pattern of citation from the applied fields to the basic sciences. Expand
Complex Networks: Structure and Dynamics
TLDR
The major concepts and results recently achieved in the study of the structure and dynamics of complex networks are reviewed, and the relevant applications of these ideas in many different disciplines are summarized, ranging from nonlinear science to biology, from statistical mechanics to medicine and engineering. Expand
Centrality and network flow
  • S. Borgatti
  • Mathematics, Computer Science
  • Soc. Networks
  • 2005
TLDR
A key claim made in this paper is that centrality measures can be regarded as generating expected values for certain kinds of node outcomes given implicit models of how traffic flows, and that this provides a new and useful way of thinking about centrality. Expand
...
1
2
3
4
...