Achieving Network Stability via Optimal Pinning Control in Weighted Complex Networks

被引:0
作者
Jafarizadeh, Saber [1 ]
机构
[1] Rakuten Mobile Inc, Setagaya Ku, Tokyo 1580094, Japan
来源
IEEE ACCESS | 2024年 / 12卷
关键词
Controllability; Complex networks; Optimization; Laplace equations; Topology; Synchronization; Gain measurement; Eigenvalues and eigenfunctions; Weight measurement; Stability criteria; dynamical networks; Pareto frontier; scale-free networks; semidefinite programming; synchronization; MIXING MARKOV-CHAIN; OPTIMAL SYNCHRONIZABILITY; CONVERGENCE RATE; CONTROLLABILITY; TOPOLOGIES; CONSENSUS; AVERAGE; NODES;
D O I
10.1109/ACCESS.2024.3520735
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Interconnected systems forming complex networks are ubiquitous in many man-made and natural phenomena. When individual systems are aligned towards a desired trajectory, their synchronization's stability depends on the network's controllability, often achieved through pinning control. When optimizing controllability, unweighted Laplacian and uniform feedback gains are conventionally used for the pinned nodes, ignoring the significance of link weights, usually leading to suboptimal results. This study improves local stability of the synchronous state by addressing the controllability problem using weighted Laplacian matrices and nonuniform feedback gains. Using the master-stability function method, direct optimization of the controllability measure is formulated as a multi-objective optimization problem with a Pareto frontier and multiple optimal points. This multi-objective optimization problem is simplified into a spectral radius minimization problem, where reformulating it as a semidefinite programming (SDP) problem has led to a unique optimal point on its Pareto frontier. Many interesting analytical results have been established for different families of networks and subnetworks, including the criteria for optimal zero weights that can divide the network or optimal controllability measure of an arbitrary network and its mirrored networks. Additionally, for deterministic scale-free networks, it is demonstrated how the network can break down into smaller replicas and ultimately form a collection of path networks. Numerical simulations using the R & ouml;ssler model illustrate the feasible region and, interestingly, show that the Pareto frontier of the deterministic scale-free networks is independent of its size.
引用
收藏
页码:195256 / 195278
页数:23
相关论文
共 100 条
  • [71] Jafarizadeh S., Veitch D., Robust weighted-average continuous-time consensus with communication time delay, IEEE Trans. Cybern., 53, 4, pp. 2074-2086, (2023)
  • [72] Jafarizadeh S., Jamalipour A., Fastest distributed consensus problem on fusion of two star sensor networks, IEEE Sensors J., 11, 10, pp. 2494-2506, (2011)
  • [73] Boyd S., Diaconis P., Parrilo P., Xiao L., Fastest mixing Markov chain on graphs with symmetries, SIAM J. Optim., 20, 2, pp. 792-819, (2009)
  • [74] Jafarizadeh S., Fastest mixing reversible Markov chain on friendship graph: Trade-off between transition probabilities among friends and convergence rate, Syst. Control Lett., 130, pp. 13-22, (2019)
  • [75] Olesker-Taylor S., Zanetti L., Geometric bounds on the fastest mixing Markov chain, Probab. Theory Rel. Fields, 188, 3-4, pp. 1017-1062, (2024)
  • [76] Jafarizadeh S., Jamalipour A., Fastest mixing Markov chain on symmetric K-partite sensor networks, Proc. 7th Int. Wireless Commun. Mobile Comput. Conf., pp. 1883-1888, (2011)
  • [77] Jafarizadeh S., Fastest mixing reversible Markov chain: Clique lifted graphs and subgraphs, IEEE Trans. Signal Inf. Process. Over Netw., 6, pp. 88-104, (2020)
  • [78] Zhang A., Feng Z., Cao Z., Gao S., Qi X., Specific target pinning control of complex dynamical networks based on semidefinite programming strategy, Phys. D, Nonlinear Phenomena, 467, (2024)
  • [79] Jafarizadeh S., Undirected weighted network topologies with best possible pinning controllability, IEEE Trans. Autom. Control, 69, 9, pp. 6285-6292, (2024)
  • [80] Jafarizadeh S., Pinning control of dynamical networks with optimal convergence rate, IEEE Trans. Syst., Man, Cybern., Syst., 52, 11, pp. 7160-7172, (2022)