arXiv · 2603.13881
Optimal pinning control of directed hypergraphs
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Fabio Della Rossa, Davide Liuzza, Francesco Lo Iudice, Pietro De Lellis. 2026-03-14. Optimal pinning control of directed hypergraphs. https://arxiv.org/abs/2603.13881
Cite the original work for its findings. Save a collection to share your selection of sources.