Novel Resistive Distance Descriptors on Complex Network
Open Access
- 31 January 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 14548-14563
Abstract
Large-scale complex network data poses significant challenges for the analytic ideas and tools to monitor and analyze complex networks. As classical structure descriptors, average path length ( $L$ ), global and local network efficiency ( $E_{glob}$ and $E_{loc}$ ), general and loop clustering coefficient ( $C_{3}$ and $D$ ), play significant roles in complex network analysis. In this paper, we make use of resistive distance instead of the shortest path distance to suggest resistive distance descriptors, i.e., $L_{r}$ , $\Omega _{glob}$ and $\Omega _{loc}$ , $\Omega _{3}$ and $D_{r}$ . We investigate all the resistive descriptors on classical WS, BA and ER models and find some interesting phenomenons. On one hand, $L_{r}$ and $\Omega _{3}$ (resp., $\Omega _{glob}$ and $\Omega _{loc}$ ) can be used to characterize the features of small-word networks. On the other hand, $L_{r}$ , $\Omega _{3}$ , and $\Omega _{glob}$ can be utilized to measure network invulnerability. To access the effectiveness of the resistive distance descriptors, we conduct extensive numerical simulations on synthetic and real networks. In comparison with the baselines, the proposed metrics show competitive performance on classical network models and are more efficient for networks with small and medium size.Keywords
Funding Information
- National Natural Science Foundation of China (61977016, 61572010)
- Natural Science Foundation of Fujian Province (2020J01164, 2017J01738)
- Education and Scientific Research Project for Young and Middle-aged Teachers of Fujian Province (JAT191119)
This publication has 44 references indexed in Scilit:
- Error and attack tolerance of small-worldness in complex networksJournal of Informetrics, 2011
- Finding community structure in networks using the eigenvectors of matricesPhysical Review E, 2006
- Network community structure and loop coefficient methodPhysical Review E, 2006
- Cycles and clustering in bipartite networksPhysical Review E, 2005
- Cyclic topology in complex networksPhysical Review E, 2005
- Efficient Behavior of Small-World NetworksPhysical Review Letters, 2001
- Error and attack tolerance of complex networksNature, 2000
- The electrical resistance of a graph captures its commute and cover timescomputational complexity, 1996
- Resistance distanceJournal of Mathematical Chemistry, 1993
- Structural Determination of Paraffin Boiling PointsJournal of the American Chemical Society, 1947