Dynamical systems on directed hyper-graphs

02/25/2022
by   Mauro Faccin, et al.
0

Networks and graphs provide a simple but effective model to a vast set of systems which building blocks interact throughout pairwise interactions. 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. We analyze the interplay between the structure of a directed hyper-graph and a dynamical system evolving on it. We connect the dynamical system on the h to a corresponding random walk on an effective graph. Measures of hyper-dynamics correspond to similar measures on the effective dynamics. We can use simple and well tested algorithms on the effective graph.

READ FULL TEXT
research
03/27/2023

Hypergraphx: a library for higher-order network analysis

From social to biological systems, many real-world systems are character...
research
05/11/2023

Identifying vital nodes through augmented random walks on higher-order networks

Empirical networks possess considerable heterogeneity of node connection...
research
10/04/2022

Link Partitioning on Simplicial Complexes Using Higher-Order Laplacians

Link partitioning is a popular approach in network science used for disc...
research
04/20/2021

What are higher-order networks?

Modeling complex systems and data using the language of graphs and netwo...
research
10/23/2020

Towards Dynamic-Point Systems on Metric Graphs with Longest Stabilization Time

A dynamical system of points on a metric graph is a discrete version of ...
research
07/15/2020

Motifs for processes on networks

The study of motifs in networks can help researchers uncover links betwe...
research
01/30/2023

A PBPO+ Graph Rewriting Tutorial

We provide a tutorial introduction to the algebraic graph rewriting form...

Please sign up or login with your details

Forgot password? Click here to reset