5 papers
Beyond expressiveness in pairwise and higher-order models
Cyril Rommens, Pietro Traversa, Guilherme Ferraz de Arruda +1
The debate over pairwise and higher-order models is often framed as a contest of expressive power. This framing is misleading. A graph with arbitrary multivariate node functions ca…
The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems
Cyril Rommens, Pietro Traversa, Guilherme Ferraz de Arruda +1
How much information is required to represent a dynamical system in terms of an interaction structure and an evolution rule? We address this question using algorithmic information…
Rumor propagation on hypergraphs
Kleber A. Oliveira, Pietro Traversa, Guilherme Ferraz de Arruda +1
The rapid spread of information and rumors through social media platforms, especially in group settings, motivates the need for more sophisticated models of rumor propagation. Trad…
Robustness and complexity of directed and weighted metabolic hypergraphs
Pietro Traversa, Guilherme Ferraz de Arruda, Alexei Vazquez +1
Metabolic networks are probably among the most challenging and important biological networks. Their study provides insight into how biological pathways work and how robust a specif…
From unbiased to maximal entropy random walks on hypergraphs
Pietro Traversa, Guilherme Ferraz de Arruda, Yamir Moreno
Random walks have been intensively studied on regular and complex networks, which are used to represent pairwise interactions. Nonetheless, recent works have demonstrated that many…