Complexity and robustness of weighted circuit network of placement
Tingyuan Nie,
Bo Fan and
Zhenhao Wang
Physica A: Statistical Mechanics and its Applications, 2022, vol. 598, issue C
Abstract:
The research on artificial networks is of great significance for understanding and improving 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.
Keywords: Complex network; Complexity; Robustness; Physical design; Placement (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437122002722
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:598:y:2022:i:c:s0378437122002722
DOI: 10.1016/j.physa.2022.127346
Access Statistics for this article
Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis
More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().