{"title":"降低风险传染的进化最优网络设计","authors":"Takanori Komatsu, A. Namatame","doi":"10.1109/ICNC.2011.6022536","DOIUrl":null,"url":null,"abstract":"Many real-world networks increase interdependencies and this creates challenges for handling network risks like cascading failure. In this paper, we propose an evolutionary approach for designing optimal networks to mitigate network risks. In general there is usually a trade-off between risk contagion and risk sharing, and optimizing a network requires the selection of a proper fitness function. We use the maximum eigenvalue of the adjacency matrix of a network to control risk contagion. The evolutionary optimized networks are characterized as homogeneous networks where all nodes have, roughly speaking, the same degree. We also show that maximum eigenvalue can be used as the index of robustness against cascading failure. The network with smaller maximum eigenvalue has better robustness against cascading failure.","PeriodicalId":299503,"journal":{"name":"2011 Seventh International Conference on Natural Computation","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An evolutionary optimal network design to mitigate risk contagion\",\"authors\":\"Takanori Komatsu, A. Namatame\",\"doi\":\"10.1109/ICNC.2011.6022536\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many real-world networks increase interdependencies and this creates challenges for handling network risks like cascading failure. In this paper, we propose an evolutionary approach for designing optimal networks to mitigate network risks. In general there is usually a trade-off between risk contagion and risk sharing, and optimizing a network requires the selection of a proper fitness function. We use the maximum eigenvalue of the adjacency matrix of a network to control risk contagion. The evolutionary optimized networks are characterized as homogeneous networks where all nodes have, roughly speaking, the same degree. We also show that maximum eigenvalue can be used as the index of robustness against cascading failure. The network with smaller maximum eigenvalue has better robustness against cascading failure.\",\"PeriodicalId\":299503,\"journal\":{\"name\":\"2011 Seventh International Conference on Natural Computation\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Seventh International Conference on Natural Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2011.6022536\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Seventh International Conference on Natural Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2011.6022536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An evolutionary optimal network design to mitigate risk contagion
Many real-world networks increase interdependencies and this creates challenges for handling network risks like cascading failure. In this paper, we propose an evolutionary approach for designing optimal networks to mitigate network risks. In general there is usually a trade-off between risk contagion and risk sharing, and optimizing a network requires the selection of a proper fitness function. We use the maximum eigenvalue of the adjacency matrix of a network to control risk contagion. The evolutionary optimized networks are characterized as homogeneous networks where all nodes have, roughly speaking, the same degree. We also show that maximum eigenvalue can be used as the index of robustness against cascading failure. The network with smaller maximum eigenvalue has better robustness against cascading failure.