流行病建模的演化加权接触网络:环和幂

James Sargant, S. Houghten, Michael Dubé
{"title":"流行病建模的演化加权接触网络:环和幂","authors":"James Sargant, S. Houghten, Michael Dubé","doi":"10.1109/CEC55065.2022.9870440","DOIUrl":null,"url":null,"abstract":"A generative evolutionary algorithm is used to evolve weighted personal contact networks that represent physical contact between individuals, and thus possible paths of infection during an epidemic. The evolutionary algorithm evolves a list of edge-editing operations applied to an initial graph. Two initial graphs are considered, a ring graph and a power-law graph. Different probabilities of infection and a wide range of weights are considered, which improve performance over other work. Modified edge operations are introduced, which also improve performance. It is shown that when trying to maximize epidemic duration, the best results are obtained when using the ring graph as the initial graph. When attempting to match a given epidemic profile, similar results are obtained when using either initial graph, but both improve performance over other work.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Evolving Weighted Contact Networks for Epidemic Modeling: the Ring and the Power\",\"authors\":\"James Sargant, S. Houghten, Michael Dubé\",\"doi\":\"10.1109/CEC55065.2022.9870440\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A generative evolutionary algorithm is used to evolve weighted personal contact networks that represent physical contact between individuals, and thus possible paths of infection during an epidemic. The evolutionary algorithm evolves a list of edge-editing operations applied to an initial graph. Two initial graphs are considered, a ring graph and a power-law graph. Different probabilities of infection and a wide range of weights are considered, which improve performance over other work. Modified edge operations are introduced, which also improve performance. It is shown that when trying to maximize epidemic duration, the best results are obtained when using the ring graph as the initial graph. When attempting to match a given epidemic profile, similar results are obtained when using either initial graph, but both improve performance over other work.\",\"PeriodicalId\":153241,\"journal\":{\"name\":\"2022 IEEE Congress on Evolutionary Computation (CEC)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Congress on Evolutionary Computation (CEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC55065.2022.9870440\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC55065.2022.9870440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

生成式进化算法用于进化加权个人接触网络,该网络代表个体之间的身体接触,从而在流行病期间可能的感染途径。进化算法演化出一系列应用于初始图的边缘编辑操作。考虑了两个初始图,一个环图和一个幂律图。考虑了不同的感染概率和广泛的权重范围,这比其他工作提高了性能。引入了改进的边缘操作,也提高了性能。结果表明,当试图使疫情持续时间最大化时,以环形图作为初始图,效果最好。当试图匹配给定的流行病概况时,使用任何初始图都可以获得类似的结果,但两者都比其他工作提高了性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Evolving Weighted Contact Networks for Epidemic Modeling: the Ring and the Power
A generative evolutionary algorithm is used to evolve weighted personal contact networks that represent physical contact between individuals, and thus possible paths of infection during an epidemic. The evolutionary algorithm evolves a list of edge-editing operations applied to an initial graph. Two initial graphs are considered, a ring graph and a power-law graph. Different probabilities of infection and a wide range of weights are considered, which improve performance over other work. Modified edge operations are introduced, which also improve performance. It is shown that when trying to maximize epidemic duration, the best results are obtained when using the ring graph as the initial graph. When attempting to match a given epidemic profile, similar results are obtained when using either initial graph, but both improve performance over other work.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信