Institutional Repository
| Resistance and Security Index of Networks: Structural Information Perspective of Network Security | |
| Li, AS; Hu, QF; Liu, J; Pan, YP | |
| 2016 | |
| Source | SCIENTIFIC REPORTS
 |
| ISSN | 2045-2322 |
| Volume | 6 |
| English Abstract | 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. |
| Indexed Type | SCI |
| Department | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China. Univ Chinese Acad Sci, Beijing, Peoples R China. |
| Language | 英语 |
| WOS ID | WOS:000376984700001 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/17324 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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). |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| srep26810.pdf（2338KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment