Complexity and robustness of weighted circuit network of placement

The research on artificial networks is of great significance for understanding and im-proving the functionality of the artificial system. In this paper, we study the complexity and robustness of the weighted circuit network of the placement. The result on circuit benchmarks shows that the network behaves as a small-world property of the broad-scale class, and the large-scale circuit tends to be with a strong small-world property. The correlation between network efficiency and circuit scale presents a power-law distribution. The networks represent diverse robustness to different attack strategies due to their inherent characteristics. Especially IS (Initial Strength) attack strategy outperforms ID (Initial Degree) attack strategy for large-scale networks. (C) 2022 Elsevier B.V. All rights reserved.