daohang fenxiangbox searchbox qikanlogonew daohangnew searchboxnew navrightzone footerzone paper

Degree dependence entropy descriptor for complex networks AITranslate

Department of Information Operation and Command Training, NDU of PLA;Department of Information Operation and Command Training, NDU of PLA;Department of Information Operation and Command Training, NDU of PLA
AITranslate
Publisher: Springer Nature
Share Citation Information Add to Favorites

    Scan to share on WeChat or Moments

Use WeChat scan.
Share with WeChat friends or Moments

Abstract AITranslate

In order to supply better accordance for modeling and simulation of complex networks, a new degree dependence entropy (DDE) descriptor is proposed to describe the degree dependence relationship and corresponding characteristic in this paper. First of all, degrees of vertices and the shortest path lengths between all pairs of vertices are computed. Then the degree dependence matrices under different shortest path lengths are constructed. At last the DDEs are extracted from the degree dependence matrices. Simulation results show that the DDE descriptor can reflect the complexity of degree dependence relationship in complex networks; high DDE indicates complex degree dependence relationship; low DDE indicates the opposite one. The DDE can be seen as a quantitative statistical characteristic, which is meaningful for networked modeling and simulation.

KeyWords AITranslate

Degree dependence matrix Degree dependence entropy (DDE) Entropy Complex networks
No data

Basic Information:

DOI:https://doi.org/10.1007/s40436-013-0034-1

Chinese Library Classification Number:

Citation Information:

In order to supply better accordance for modeling and simulation of complex networks, a new degree dependence entropy (DDE) descriptor is proposed to describe the degree dependence relationship and corresponding characteristic in this paper. First of all, degrees of vertices and the shortest path lengths between all pairs of vertices are computed. Then the degree dependence matrices under different shortest path lengths are constructed. At last the DDEs are extracted from the degree dependence matrices. Simulation results show that the DDE descriptor can reflect the complexity of degree dependence relationship in complex networks; high DDE indicates complex degree dependence relationship; low DDE indicates the opposite one. The DDE can be seen as a quantitative statistical characteristic, which is meaningful for networked modeling and simulation.

quote

GB/T 7714-2015 [1] XiangLi Xu, XiaoFeng Hu, XiaoYuan He. Advances in Manufacturing, 2013(1). DOI:10.1007/s40436-013-0034-1.
MLA [1] XiangLi Xu, et al., Advances in Manufacturing, no. 1, 2013, https://doi.org/10.1007/s40436-013-0034-1.
APA [1] XiangLi Xu, XiaoFeng Hu, & XiaoYuan He. (2013). Advances in Manufacturing(1). https://doi.org/10.1007/s40436-013-0034-1
IEEE [1] XiangLi Xu, XiaoFeng Hu, and XiaoYuan He, Advances in Manufacturing, no. 1, 2013, doi: 10.1007/s40436-013-0034-1. keywords: {Degree dependence matrix;Degree dependence entropy (DDE);Entropy;Complex networks}