{"title":"理解复杂网络性能和脆弱性的新成果","authors":"D. Repperger","doi":"10.1109/CIRA.2007.382833","DOIUrl":null,"url":null,"abstract":"New results can be obtained about performance and vulnerability of complex networks through the common intersection of the fields of graph theory, information theory, and optimization theory. Graph theory provides a basis of architecture and also constraint relationships for key flow variables. Information theory provides measures and metrics of flow performance. The optimization of complex networks is accomplished via genetic algorithms on the flow variables. By performing a minimum flow and maximum flow optimization, a sensitivity matrix of vulnerabilities of a network can be ascertained. Thus the most vulnerable set of nodes can be determined. This procedure is first applied to a logistics network. The generalization to communication's networks and other distributed complex systems is discussed.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New Results in Understanding Performance and Vulnerability in Complex Networks\",\"authors\":\"D. Repperger\",\"doi\":\"10.1109/CIRA.2007.382833\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"New results can be obtained about performance and vulnerability of complex networks through the common intersection of the fields of graph theory, information theory, and optimization theory. Graph theory provides a basis of architecture and also constraint relationships for key flow variables. Information theory provides measures and metrics of flow performance. The optimization of complex networks is accomplished via genetic algorithms on the flow variables. By performing a minimum flow and maximum flow optimization, a sensitivity matrix of vulnerabilities of a network can be ascertained. Thus the most vulnerable set of nodes can be determined. This procedure is first applied to a logistics network. The generalization to communication's networks and other distributed complex systems is discussed.\",\"PeriodicalId\":301626,\"journal\":{\"name\":\"2007 International Symposium on Computational Intelligence in Robotics and Automation\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Symposium on Computational Intelligence in Robotics and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIRA.2007.382833\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Computational Intelligence in Robotics and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIRA.2007.382833","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New Results in Understanding Performance and Vulnerability in Complex Networks
New results can be obtained about performance and vulnerability of complex networks through the common intersection of the fields of graph theory, information theory, and optimization theory. Graph theory provides a basis of architecture and also constraint relationships for key flow variables. Information theory provides measures and metrics of flow performance. The optimization of complex networks is accomplished via genetic algorithms on the flow variables. By performing a minimum flow and maximum flow optimization, a sensitivity matrix of vulnerabilities of a network can be ascertained. Thus the most vulnerable set of nodes can be determined. This procedure is first applied to a logistics network. The generalization to communication's networks and other distributed complex systems is discussed.