Measuring dynamical systems on directed hyper-graphs

Abstract

Networks and graphs provide a simple but effective model to a vast set of systems which building blocks interact throughout pairwise interactions. Unfortunately, such models fail to describe all those systems which building blocks interact at a higher order. Higher order graphs provide us the right tools for the task, but introduce a higher computing complexity due to the interaction order. In this paper we analyze the interplay between the structure of a directed hypergraph and a linear dynamical system, a random walk, defined on it. How can one extend network measures, such as centrality or modularity, to this framework? Instead of redefining network measures through the hypergraph framework, with the consequent complexity boost, we will measure the dynamical system associated to it. This approach let us apply known measures to pairwise structures, such as the transition matrix, and determine a family of measures that are amenable of such procedure.

8 pages, 5 figures

References in corpus (7)

• Fast unfolding of communities in large networks
• Community structure in directed networks
• Random walks on hypergraphs
• Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyond
• Unified treatment of synchronization patterns in generalized networks with higher-order, multilayer, and temporal interactions
• Mapping flows on hypergraphs
• Assessing the influence of French vaccine critics during the two first years of the COVID-19 pandemic

Cited by in corpus (2)

• Assessing the influence of French vaccine critics during the two first years of the COVID-19 pandemic
• Impact of directionality on the emergence of Turing patterns on m-directed higher-order structures