@article{fdi:010086387,
  title = {{M}easuring dynamical systems on directed hypergraphs},
  author = {{F}accin, {M}auro},
  editor = {},
  language = {{ENG}},
  abstract = {{N}etworks and graphs provide a simple but effective model to a vast set of systems in which building blocks interact throughout pairwise interactions. {U}nfortunately, such models fail to describe all those systems in which building blocks interact at a higher order. {H}igher-order graphs provide us the right tools for the task, but introduce a higher computing complexity due to the interaction order. {I}n this paper we analyze the interplay between the structure of a directed hypergraph and a linear dynamical system, a random walk, defined on it. {H}ow can one extend network measures, such as centrality or modularity, to this framework? {I}nstead of redefining network measures through the hypergraph framework, with the consequent complexity boost, we will measure the dynamical system associated to it. {T}his approach let us apply known measures to pairwise structures, such as the transition matrix, and determine a family of measures that are amenable to such a procedure.},
  keywords = {},
  booktitle = {},
  journal = {{P}hysical {R}eview {E}},
  volume = {106},
  numero = {3},
  pages = {034306 [8 p.]},
  ISSN = {2470-0045},
  year = {2022},
  DOI = {10.1103/{P}hys{R}ev{E}.106.034306},
  URL = {https://www.documentation.ird.fr/hor/fdi:010086387},
}