Jianhong Mou, Bitao Dai, Suoyi Tan, P. Holme, Sune Lehmann, Fredrik Liljeros, Xin Lu
{"title":"网络流行病学建模的主轴近似法","authors":"Jianhong Mou, Bitao Dai, Suoyi Tan, P. Holme, Sune Lehmann, Fredrik Liljeros, Xin Lu","doi":"10.1088/1367-2630/ad4050","DOIUrl":null,"url":null,"abstract":"\n Understanding the dynamics of spreading and diffusion on networks is of critical importance for a variety of processes in real life. However, predicting the temporal evolution of diffusion on networks remains challenging as the process is shaped by network topology, spreading non-linearities, and heterogeneous adaptation behavior. In this study, we propose the spindle vector, a new network topological feature, which shapes nodes according to the distance from the root node. The spindle vector captures the relative order of nodes in diffusion propagation, thus allowing us to approximate the spatiotemporal evolution of diffusion dynamics on networks. The approximation simplifies the detailed connections of node pairs by only focusing on the nodal count within individual layers and the interlayer connections, seeking a compromise between efficiency and complexity. Through experiments on various networks, we show that our method outperforms the state-of-the-art on BA networks with an average improvement of 38.6% on the Mean Absolute Error (MAE). Additionally, the predictive accuracy of our method exhibits a notable convergence with the Pairwise Approximation (PA) approach with the increasing presence of quadrangles and pentagons in WS networks. The new metric provides a general and computationally efficient approach to predict network diffusion problems and is of potential for a large range of network applications.","PeriodicalId":508829,"journal":{"name":"New Journal of Physics","volume":" 11","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Spindle Approximation of Network Epidemiological Modeling\",\"authors\":\"Jianhong Mou, Bitao Dai, Suoyi Tan, P. Holme, Sune Lehmann, Fredrik Liljeros, Xin Lu\",\"doi\":\"10.1088/1367-2630/ad4050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n Understanding the dynamics of spreading and diffusion on networks is of critical importance for a variety of processes in real life. However, predicting the temporal evolution of diffusion on networks remains challenging as the process is shaped by network topology, spreading non-linearities, and heterogeneous adaptation behavior. In this study, we propose the spindle vector, a new network topological feature, which shapes nodes according to the distance from the root node. The spindle vector captures the relative order of nodes in diffusion propagation, thus allowing us to approximate the spatiotemporal evolution of diffusion dynamics on networks. The approximation simplifies the detailed connections of node pairs by only focusing on the nodal count within individual layers and the interlayer connections, seeking a compromise between efficiency and complexity. Through experiments on various networks, we show that our method outperforms the state-of-the-art on BA networks with an average improvement of 38.6% on the Mean Absolute Error (MAE). Additionally, the predictive accuracy of our method exhibits a notable convergence with the Pairwise Approximation (PA) approach with the increasing presence of quadrangles and pentagons in WS networks. The new metric provides a general and computationally efficient approach to predict network diffusion problems and is of potential for a large range of network applications.\",\"PeriodicalId\":508829,\"journal\":{\"name\":\"New Journal of Physics\",\"volume\":\" 11\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"New Journal of Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1088/1367-2630/ad4050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"New Journal of Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/1367-2630/ad4050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
了解网络传播和扩散的动态对现实生活中的各种过程至关重要。然而,由于网络拓扑结构、传播的非线性以及异质适应行为等因素影响着传播过程,因此预测网络传播的时间演化仍具有挑战性。在本研究中,我们提出了一种新的网络拓扑特征--主轴向量,它根据节点与根节点的距离来塑造节点。主轴向量捕捉了扩散传播中节点的相对顺序,从而使我们能够近似网络扩散动力学的时空演化。这种近似方法简化了节点对的详细连接,只关注单个层内的节点数和层间连接,在效率和复杂性之间寻求折中。通过对各种网络的实验,我们发现在 BA 网络上,我们的方法优于最先进的方法,平均绝对误差(MAE)平均提高了 38.6%。此外,随着 WS 网络中四边形和五边形的增加,我们方法的预测准确性与配对逼近(PA)方法有明显的趋同性。新指标为预测网络扩散问题提供了一种通用且计算效率高的方法,具有广泛的网络应用潜力。
The Spindle Approximation of Network Epidemiological Modeling
Understanding the dynamics of spreading and diffusion on networks is of critical importance for a variety of processes in real life. However, predicting the temporal evolution of diffusion on networks remains challenging as the process is shaped by network topology, spreading non-linearities, and heterogeneous adaptation behavior. In this study, we propose the spindle vector, a new network topological feature, which shapes nodes according to the distance from the root node. The spindle vector captures the relative order of nodes in diffusion propagation, thus allowing us to approximate the spatiotemporal evolution of diffusion dynamics on networks. The approximation simplifies the detailed connections of node pairs by only focusing on the nodal count within individual layers and the interlayer connections, seeking a compromise between efficiency and complexity. Through experiments on various networks, we show that our method outperforms the state-of-the-art on BA networks with an average improvement of 38.6% on the Mean Absolute Error (MAE). Additionally, the predictive accuracy of our method exhibits a notable convergence with the Pairwise Approximation (PA) approach with the increasing presence of quadrangles and pentagons in WS networks. The new metric provides a general and computationally efficient approach to predict network diffusion problems and is of potential for a large range of network applications.