Optimal pinning control of directed hypergraphs

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Della Rossa, Fabio, Liuzza, Davide, Iudice, Francesco Lo, De Lellis, Pietro
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912966099599360
author Della Rossa, Fabio
Liuzza, Davide
Iudice, Francesco Lo
De Lellis, Pietro
author_facet Della Rossa, Fabio
Liuzza, Davide
Iudice, Francesco Lo
De Lellis, Pietro
contents Identifying the nodes that must be directly controlled to steer a network along a desired trajectory remains an open problem for digraphs, and even more so for hypergraphs. In this manuscript, we investigate network systems coupled via directed hypergraphs and consider a broad class of individual dynamics and coupling configurations, extending the definition of type II networks originally formulated for digraphs. For this class of networks with higher-order interactions, we establish necessary and sufficient conditions under which a pinning selection locally ensures successful control. Building on these analytical results, we propose a greedy heuristic for pinning control selection, which demonstrably outperforms existing methods.
format Preprint
id arxiv_https___arxiv_org_abs_2603_13881
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Optimal pinning control of directed hypergraphs
Della Rossa, Fabio
Liuzza, Davide
Iudice, Francesco Lo
De Lellis, Pietro
Mathematical Physics
Adaptation and Self-Organizing Systems
Identifying the nodes that must be directly controlled to steer a network along a desired trajectory remains an open problem for digraphs, and even more so for hypergraphs. In this manuscript, we investigate network systems coupled via directed hypergraphs and consider a broad class of individual dynamics and coupling configurations, extending the definition of type II networks originally formulated for digraphs. For this class of networks with higher-order interactions, we establish necessary and sufficient conditions under which a pinning selection locally ensures successful control. Building on these analytical results, we propose a greedy heuristic for pinning control selection, which demonstrably outperforms existing methods.
title Optimal pinning control of directed hypergraphs
topic Mathematical Physics
Adaptation and Self-Organizing Systems
url https://arxiv.org/abs/2603.13881