Higher-Order Temporal Network Prediction and Interpretation

H. A. Bart Peters, Alberto Ceria, Huijuan Wang
{"title":"Higher-Order Temporal Network Prediction and Interpretation","authors":"H. A. Bart Peters, Alberto Ceria, Huijuan Wang","doi":"arxiv-2408.05165","DOIUrl":null,"url":null,"abstract":"A social interaction (so-called higher-order event/interaction) can be\nregarded as the activation of the hyperlink among the corresponding\nindividuals. Social interactions can be, thus, represented as higher-order\ntemporal networks, that record the higher-order events occurring at each time\nstep over time. The prediction of higher-order interactions is usually\noverlooked in traditional temporal network prediction methods, where a\nhigher-order interaction is regarded as a set of pairwise interactions. The\nprediction of future higher-order interactions is crucial to forecast and\nmitigate the spread the information, epidemics and opinion on higher-order\nsocial contact networks. In this paper, we propose novel memory-based models\nfor higher-order temporal network prediction. By using these models, we aim to\npredict the higher-order temporal network one time step ahead, based on the\nnetwork observed in the past. Importantly, we also intent to understand what\nnetwork properties and which types of previous interactions enable the\nprediction. The design and performance analysis of these models are supported\nby our analysis of the memory property of networks, e.g., similarity of the\nnetwork and activity of a hyperlink over time respectively. Our models assume\nthat a target hyperlink's future activity (active or not) depends the past\nactivity of the target link and of all or selected types of hyperlinks that\noverlap with the target. We then compare the performance of both models with a\nbaseline utilizing a pairwise temporal network prediction method. In eight\nreal-world networks, we find that both models consistently outperform the\nbaseline and the refined model tends to perform the best. Our models also\nreveal how past interactions of the target hyperlink and different types of\nhyperlinks that overlap with the target contribute to the prediction of the\ntarget's future activity.","PeriodicalId":501043,"journal":{"name":"arXiv - PHYS - Physics and Society","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - PHYS - Physics and Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.05165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A social interaction (so-called higher-order event/interaction) can be regarded as the activation of the hyperlink among the corresponding individuals. Social interactions can be, thus, represented as higher-order temporal networks, that record the higher-order events occurring at each time step over time. The prediction of higher-order interactions is usually overlooked in traditional temporal network prediction methods, where a higher-order interaction is regarded as a set of pairwise interactions. The prediction of future higher-order interactions is crucial to forecast and mitigate the spread the information, epidemics and opinion on higher-order social contact networks. In this paper, we propose novel memory-based models for higher-order temporal network prediction. By using these models, we aim to predict the higher-order temporal network one time step ahead, based on the network observed in the past. Importantly, we also intent to understand what network properties and which types of previous interactions enable the prediction. The design and performance analysis of these models are supported by our analysis of the memory property of networks, e.g., similarity of the network and activity of a hyperlink over time respectively. Our models assume that a target hyperlink's future activity (active or not) depends the past activity of the target link and of all or selected types of hyperlinks that overlap with the target. We then compare the performance of both models with a baseline utilizing a pairwise temporal network prediction method. In eight real-world networks, we find that both models consistently outperform the baseline and the refined model tends to perform the best. Our models also reveal how past interactions of the target hyperlink and different types of hyperlinks that overlap with the target contribute to the prediction of the target's future activity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
高阶时态网络预测与解释
社会互动(所谓的高阶事件/互动)可视为相应个体之间超链接的激活。因此,社会互动可以用高阶时态网络来表示,它记录了随着时间推移在每个时间步发生的高阶事件。在传统的时态网络预测方法中,高阶互动被视为一组配对互动,而高阶互动的预测通常被忽视。预测未来的高阶交互对于预测和缓解高阶社会接触网络中的信息传播、流行病和舆论至关重要。在本文中,我们提出了基于记忆的新型高阶时态网络预测模型。通过使用这些模型,我们旨在根据过去观察到的网络,提前一个时间步预测高阶时态网络。重要的是,我们还希望了解是哪些网络属性和哪些类型的先前交互促成了预测。这些模型的设计和性能分析得益于我们对网络记忆特性的分析,例如网络的相似性和超链接随时间变化的活动性。我们的模型假设目标超链接的未来活动(活跃与否)取决于目标链接以及与目标链接重叠的所有或选定类型超链接的过去活动性。然后,我们利用成对时态网络预测方法将这两种模型的性能与基准线进行了比较。在八个真实世界的网络中,我们发现这两个模型的性能始终优于基准线,而改进后的模型往往表现最佳。我们的模型还揭示了目标超链接和与目标重叠的不同类型超链接过去的交互如何有助于预测目标的未来活动。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Continuity equation and fundamental diagram of pedestrians Anomalous behavior of Replicator dynamics for the Prisoner's Dilemma on diluted lattices Quantifying the role of supernatural entities and the effect of missing data in Irish sagas Crossing the disciplines -- a starter toolkit for researchers who wish to explore early Irish literature Female representation across mythologies
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1