Minimization of ambiguity in parametric fault diagnosis of analog circuits: A complex network approach

Tan, Honglin; Peng, Minfang

doi:10.1016/j.amc.2012.06.033

Cited by 9 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And if multi-fault is taken into account, the one is (2) in which i is multiplicity of fault, 2   i n and i n C is combinatorial operations.…”

Section: Creation Of Nodementioning

confidence: 99%

Simulation for Analog Circuit Fault Propagation with Complex Networks

Shen¹,

Peng²,

He³

et al. 2013

IJMO

Self Cite

View full text Add to dashboard Cite

Abstract-Based on complex network theory, the simulation method for analog circuit fault propagation behavior and its internal mechanism is proposed and the modeling approach for fault propagation networks is described. Taken the international standards circuit under test as an example, the network degree, clustering coefficient, average path length and other statistical parameters in the model are calculated. The small-world and scale-free properties of the analog circuit fault propagation network are verified. Therefore, efficient diagnosis information can be obtained from the constructed the network.

show abstract

“…And if multi-fault is taken into account, the one is (2) in which i is multiplicity of fault, 2   i n and i n C is combinatorial operations.…”

Section: Creation Of Nodementioning

confidence: 99%

Simulation for Analog Circuit Fault Propagation with Complex Networks

Shen¹,

Peng²,

He³

et al. 2013

IJMO

Self Cite

View full text Add to dashboard Cite

show abstract

“…These infrastructures are critical and have a great impact on our living [3][4][5]. Measuring robustness of interconnected network is an increasingly important area in the study of networks topological structure.…”

Section: Introductionmentioning

confidence: 99%

Measuring cascade effects in coupled networks using algebraic connectivity

Tauch

Liu

Pears

2014

2014 Australasian Telecommunication Networks and Applications Conference (ATNAC)

View full text Add to dashboard Cite

Understanding how the underlying network structure and interconnectivity impact on robustness of the coupled networks is a major challenge in complex networks studies. There are some existing metrics that can be used to measure network robustness. However, different metrics such as the average node degree, interpret different characteristic of network topological structure, especially less metrics have been identified to effectively measure the cascade performance in coupled networks. In this paper, we propose to use a combined Laplacian matrix to model the coupled networks and their interconnectivity, and then use its algebraic connectivity metric as a measure to its cascading behavior. Moreover, we have conducted extensive comparative studies among different metrics such as the average node degree, and the proposed algebraic connectivity. We have found that the algebraic connectivity metric can describe more accurate and finer characteristics on topological structure of coupled networks than other metrics widely adapted by the existing research studies for measuring the cascading performance in coupled networks.

show abstract