📝 SummarXiv

Abstract

Many real-world complex systems can be modeled as multiplex networks, where each layer represents a distinct set of interactions among the same entities. Controlling such systems-steering them toward desired states using external inputs-is crucial across many domains. However, existing network control theory largely focuses on single-layer networks, and applying separate controls to each layer of a multiplex system often leads to redundant sets of driver nodes, increasing cost and complexity. To address this challenge, we formulate the Universal Minimum Union Driver Set (MinUDS) problem for duplex networks. The goal is to find the smallest set of driver nodes that can simultaneously control both layers. We propose a novel algorithm, Shortest Cross-Layer Augmenting Path Search (CLAP-S). This method introduces the concept of a Cross-Layer Augmenting Path (CLAP) and efficiently explores the combinatorial space of control configurations. CLAP-S iteratively realigns each layer's Minimum Driver Set (MDS) to maximize their overlap. We prove the algorithm's global optimality and demonstrate its efficiency on both synthetic networks and real-world multiplex systems. The results show that CLAP-S consistently outperforms baseline approaches by significantly reducing the number of required driver nodes and cutting computational time by an order of magnitude. This work provides a powerful, general-purpose tool for optimizing control strategies in multi-layer networks, enabling more economical interventions in diverse fields.