Resistance and Security Index of Networks: Structural Information Perspective of Network Security
文献类型：期刊论文
| 作者 | Li, AS ; Hu, QF ; Liu, J ; Pan, YP |
| 刊名 | SCIENTIFIC REPORTS
 |
| 出版日期 | 2016 |
| 卷号 | 6 |
| ISSN号 | 2045-2322 |
| 中文摘要 | Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure T of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one-and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written. (G), as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is R(G)= H-1(G) - H-2(G), where H-1(G) and H-2(G) are the one-and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, rho(G)= 1 - H-2(G)/H-1(G). We show that the resistance and security index are both well-defined measures for the security of the networks. |
| 英文摘要 | Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure T of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one-and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written. (G), as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is R(G)= H-1(G) - H-2(G), where H-1(G) and H-2(G) are the one-and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, rho(G)= 1 - H-2(G)/H-1(G). We show that the resistance and security index are both well-defined measures for the security of the networks. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000376984700001 |
| 公开日期 | 2016-12-09 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/17324]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Li, AS,Hu, QF,Liu, J,et al. Resistance and Security Index of Networks: Structural Information Perspective of Network Security[J]. SCIENTIFIC REPORTS,2016,6. |
| APA | Li, AS,Hu, QF,Liu, J,&Pan, YP.(2016).Resistance and Security Index of Networks: Structural Information Perspective of Network Security.SCIENTIFIC REPORTS,6. |
| MLA | Li, AS,et al."Resistance and Security Index of Networks: Structural Information Perspective of Network Security".SCIENTIFIC REPORTS 6(2016). |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。