Revealing Chaotic Dependence and Degree-Structure Mechanisms in Optimal Pinning Control of Complex Networks

TL;DR

The paper tackles the problem of globally optimally selecting driver nodes for pinning control to achieve synchronization in complex networks. It adopts a degree-based mean-field (annealed) framework, replacing the adjacency with an expected connection structure $\mathbf{A} = \tfrac{1}{K}\boldsymbol{d}\boldsymbol{d}^\top$ and focusing on maximizing the smallest grounded-Laplacian eigenvalue $\lambda_1(\mathcal{L}_F)$ to quantify control effectiveness. The authors derive a degree-structured optimality condition, show that the optimal pinning set follows a low-degree block plus high-degree tail with threshold $k_c^*$ that is nondecreasing in budget and can jump, producing chaotic dependence on budget $c$, and develop near-linear algorithms $\mathcal{A}_1$ and $\mathcal{A}_2$ to compute the exact optimum under the annealed model. Extensive simulations on synthetic and real networks confirm substantial performance gains over centrality-based baselines and reveal how low-degree saturation, high-degree cutoff, and the degree-exponent shape synchronizability. The work links degree heterogeneity to spectral controllability and offers practical guidelines for driver-node placement in diverse systems, with potential extensions to more realistic quenched, directed, and multi-layer networks.

Abstract

Identifying an optimal set of driver nodes to achieve synchronization via pinning control is a fundamental challenge in complex network science, limited by computational intractability and the lack of general theory. Here, leveraging a degree-based mean-field (annealed) approximation from statistical physics, we analytically reveal how the structural degree distribution systematically governs synchronization performance, and derive an analytic characterization of the globally optimal pinning set and constructive algorithms with linear complexity (dominated by degree sorting, O(N+M). The optimal configuration exhibits a chaotic dependence--a discontinuous sensitivity--on its cardinality, whereby adding a single node can trigger abrupt changes in node composition and control effectiveness. This structural transition fundamentally challenges traditional heuristics that assume monotonic performance gains with budget. Systematic experiments on synthetic and empirical networks confirm that the proposed approach consistently outperforms degree-, betweenness-, and other centrality-based baselines. Furthermore, we quantify how key degree-distribution features--low-degree saturation, high-degree cutoff, and the power-law exponent--govern achievable synchronizability and shape the form of optimal sets. These results offer a systematic understanding of how degree heterogeneity shapes the network controllability. Our work establishes a unified link between degree heterogeneity and spectral controllability, offering both mechanistic insights and practical design rules for optimal driver-node selection in diverse complex systems.

Figures (5)

• Figure 1: Validation of analytical algorithms via exhaustive enumeration on a small configuration model. The global optimum ($S_{\mathrm{opt}}$) is obtained exactly for each cardinality $c \in \{1, \dots, 9\}$. Both $\mathcal{A}_1$ and $\mathcal{A}_2$ accurately recover the optimum across nearly all values of $c$, whereas all three centrality-based heuristics (DC/BC/CR) fail to consistently match optimal performance.
• Figure 2: Representative degree distributions illustrating two common deviations from an ideal power-law: low-degree saturation and high-degree cutoff.
• Figure 3: Effect of low-degree saturation on pinning performance for configuration networks with $k_{\text{sat}}=20,40,60,80,100,120$. The horizontal axis shows the pinned-node fraction $p$ (0–0.3). Curves show $1/\lambda_1(L_{N(1-p)})$ for various strategies (BC: Betweenness Centrality, CC: Coreness Centrality, DC: Degree Centrality, CR: Cycle Ratio, BFG: brute-force greedy strategy, $\mathcal{A}_1$, $\mathcal{A}_2$); smaller values indicate better synchronizability.
• Figure 4: Effect of high-degree cutoff on pinning performance for configuration networks with $k_{\text{cut}}=100,200,300,400,500,600$.
• Figure 5: Pinning control performance in three empirical networks. The proposed algorithms $\mathcal{A}_1$ and $\mathcal{A}_2$ consistently achieve lower $1/\lambda_1(L_{N(1-p)})$ curves than all baselines across the entire pinning fraction $p$, indicating superior synchronizability after pinning.

Theorems & Definitions (12)

• Theorem 1
• Lemma 1
• Theorem 2
• Corollary 1
• Corollary 2
• Corollary 3
• Lemma 2
• Proposition 1
• Corollary 4
• Corollary 5