When is a Network a Network? Multi-Order Graphical Model Selection in Pathways and Temporal Networks
arXiv:1702.05499 · doi:10.1145/3097983.3098145
Abstract
We introduce a framework for the modeling of sequential data capturing pathways of varying lengths observed in a network. Such data are important, e.g., when studying click streams in information networks, travel patterns in transportation systems, information cascades in social networks, biological pathways or time-stamped social interactions. While it is common to apply graph analytics and network analysis to such data, recent works have shown that temporal correlations can invalidate the results of such methods. This raises a fundamental question: when is a network abstraction of sequential data justified? Addressing this open question, we propose a framework which combines Markov chains of multiple, higher orders into a multi-layer graphical model that captures temporal correlations in pathways at multiple length scales simultaneously. We develop a model selection technique to infer the optimal number of layers of such a model and show that it outperforms previously used Markov order detection techniques. An application to eight real-world data sets on pathways and temporal networks shows that it allows to infer graphical models which capture both topological and temporal characteristics of such data. Our work highlights fallacies of network abstractions and provides a principled answer to the open question when they are justified. Generalizing network representations to multi-order graphical models, it opens perspectives for new data mining and knowledge discovery algorithms.
10 pages, 4 figures, 1 table, companion python package pathpy available on gitHub
References in corpus (2)
Cited by in corpus (17)
- Ranking in evolving complex networks
- Mapping higher-order network flows in memory and multilayer networks with Infomap
- Efficient modeling of higher-order dependencies in networks: from algorithm to application for anomaly detection
- Effects of memory on spreading processes in non-Markovian temporal networks
- The Mobility Network of Scientists: Analyzing Temporal Correlations in Scientific Careers
- From Relational Data to Graphs: Inferring Significant Links using Generalized Hypergeometric Ensembles
- What is the Entropy of a Social Organization?
- Adapting to Disruptions: Flexibility as a Pillar of Supply Chain Resilience
- HONEM: Learning Embedding for Higher Order Networks
- git2net - Mining Time-Stamped Co-Editing Networks from Large git Repositories
- Using Motif Transitions for Temporal Graph Generation
- Topology-Agnostic Detection of Temporal Money Laundering Flows in Billion-Scale Transactions
- Predicting Sequences of Traversed Nodes in Graphs using Network Models with Multiple Higher Orders
- Higher-order temporal network effects through triplet evolution
- Locating Community Smells in Software Development Processes Using Higher-Order Network Centralities
- Analysing Collective Behaviour in Temporal Networks Using Event Graphs and Temporal Motifs
- Counting Causal Paths in Big Times Series Data on Networks