Random walks on hypergraphs
arXiv:1911.06523 · doi:10.1103/PhysRevE.101.022308
Abstract
In the last twenty years network science has proven its strength in modelling many real-world interacting systems as generic agents, the nodes, connected by pairwise edges. Yet, in many relevant cases, interactions are not pairwise but involve larger sets of nodes, at a time. These systems are thus better described in the framework of hypergraphs, whose hyperedges effectively account for multi-body interactions. We hereby propose a new class of random walks defined on such higher-order structures, and grounded on a microscopic physical model where multi-body proximity is associated to highly probable exchanges among agents belonging to the same hyperedge. We provide an analytical characterisation of the process, deriving a general solution for the stationary distribution of the walkers. The dynamics is ultimately driven by a generalised random walk Laplace operator that reduces to the standard random walk Laplacian when all the hyperedges have size 2 and are thus meant to describe pairwise couplings. We illustrate our results on synthetic models for which we have a full control of the high-order structures, and real-world networks where higher-order interactions are at play. As a first application of the method, we compare the behaviour of random walkers on hypergraphs to that of traditional random walkers on the corresponding projected networks, drawing interesting conclusions on node rankings in collaboration networks. As a second application, we show how information derived from the random walk on hypergraphs can be successfully used for classification tasks involving objects with several features, each one represented by a hyperedge. Taken together, our work contributes to unveiling the effect of higher-order interactions on diffusive processes in higher-order networks, shading light on mechanisms at the hearth of biased information spreading in complex networked systems.
References in corpus (30)
- Statistical mechanics of complex networks
- Maps of random walks on complex networks reveal community structure
- Statistical physics of social dynamics
- Synchronization in complex networks
- Multilayer Networks
- Stability Criteria for Complex Ecosystems
- Higher-order organization of complex networks
- Simplicial models of social contagion
- The physics of spreading processes in multilayer networks
- Random Walks on Multiplex Networks
- Simplicial Closure and higher-order link prediction
- Memory in network flows and its effects on spreading dynamics and community detection
- Complex Networks as Hypergraphs
- Causality-Driven Slow-Down and Speed-Up of Diffusion in Non-Markovian Temporal Networks
- Random hypergraphs and their applications
- Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
- Entropy Rate of Diffusion Processes on Complex Networks
- Abrupt phase transition of epidemic spreading in simplicial complexes
- Simplicial Activity Driven Model
- Multi-body Interactions and Non-Linear Consensus Dynamics on Networked Systems
- The new challenges of multiplex networks: measures and models
- Simplicial SIS model in scale-free uniform hypergraph
- Efficient exploration of multiplex networks
- Characteristic exponents of complex networks
- The Simplex Geometry of Graphs
- Hopping in the crowd to unveil network topology
- Reactive random walkers on complex networks
- Random walk on temporal networks with lasting edges
- Dynamics of Nonlinear Random Walks on Complex Networks
- Classes of random walks on temporal networks with competing timescales
Cited by in corpus (70)
- Networks beyond pairwise interactions: structure and dynamics
- The physics of higher-order interactions in complex systems
- Dynamics on higher-order networks: A review
- What are higher-order networks?
- Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes
- Multiorder Laplacian for synchronization in higher-order networks
- Higher-order motif analysis in hypergraphs
- Inference of hyperedges and overlapping communities in hypergraphs
- Higher-order percolation processes on multiplex hypergraphs
- Synchronization induced by directed higher-order interactions
- Simplicial contagion in temporal higher-order networks
- Unveiling the higher-order organization of multivariate time series
- Evolution of honesty in higher-order social networks
- Higher-order interactions promote chimera states
- Community Detection in Large Hypergraphs
- Intralayer and interlayer synchronization in multiplex network with higher-order interactions
- The dynamic nature of percolation on networks with triadic interactions
- Unified treatment of synchronization patterns in generalized networks with higher-order, multilayer, and temporal interactions
- Vector Centrality in Hypergraphs
- Mapping flows on hypergraphs
- D-dimensional oscillators in simplicial structures: odd and even dimensions display different synchronization scenarios
- Expectation-Maximizing Network Reconstruction and MostApplicable Network Types Based on Binary Time Series Data
- Betweenness centrality of teams in social networks
- Modelling Non-Linear Consensus Dynamics on Hypergraphs
- Higher-Order Components Dictate Higher-Order Contagion Dynamics in Hypergraphs
- Effective epidemic containment strategy in hypergraphs
- Percolation and Topological Properties of Temporal Higher-order Networks
- Hypergraphx: a library for higher-order network analysis
- Higher-order interactions induce anomalous transitions to synchrony
- A class of models for random hypergraphs
- Hypergraph reconstruction from dynamics
- Turing patterns on discrete topologies: from networks to higher-order structures
- Information propagation in multilayer systems with higher-order interactions across timescales
- Diffusion-driven instability of topological signals coupled by the Dirac operator
- Phase chimera states on non-local hyperrings
- -core decomposition of hypergraphs
- Hyperlink communities in higher-order networks
- A framework to generate hypergraphs with community structure
- Collective dynamics on higher-order networks
- Multiplex measures for higher-order networks
- Global topological synchronization of weighted simplicial complexes
- Renormalization group theory of percolation on pseudo-fractal simplicial and cell complexes
- Triadic percolation induces dynamical topological patterns in higher-order networks
- Signless Normalized Laplacian for Hypergraphs
- Assessing the influence of French vaccine critics during the two first years of the COVID-19 pandemic
- Hyperlink prediction via local random walks and Jensen-Shannon divergence
- Theory of phase reduction from hypergraphs to simplicial complexes: a general route to higher-order Kuramoto models
- Higher-order triadic percolation on random hypergraphs
- Hyper-diffusion on multiplex networks
- Dynamical fluctuations of random walks in higher-order networks
- Measuring dynamical systems on directed hyper-graphs
- Topological estimation of the latent geometry of a complex network
- Community Detection with the Map Equation and Infomap: Theory and Applications
- Impact of directionality on the emergence of Turing patterns on m-directed higher-order structures
- Global Topological Dirac Synchronization
- Eigenvector localization in hypergraphs: pair-wise vs higher-order links
- Local topological moves determine global diffusion properties of hyperbolic higher-order networks
- Flow-based Community Detection in Hypergraphs
- Network stochastic resonance under higher-order interactions
- On the location and the strength of controllers to desynchronize coupled Kuramoto oscillators
- Time delay embeddings to characterize the timbre of musical instruments using Topological Data Analysis: a study on synthetic and real data
- On the convergence of nonlinear averaging dynamics with three-body interactions on hypergraphs
- Sampling nodes and hyperedges via random walks on large hypergraphs
- Reducibility of higher-order to pairwise interactions: Social impact models on hypergraphs
- Consensus dynamics on temporal hypergraphs
- On the efficiency of pairwise Hamiltonian control to desynchronize the higher-order Kuramoto model
- Comparative study of random walks with one-step memory on complex networks
- Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs
- Density-dependent stochastic resetting: a large deviations framework for achieving target distributions over networks
- Random walks on stochastic uniform growth trees: Analytical formula for mean first-passage time