Spline tie-decay temporal networks

Chanon Thongprayoon, Naoki Masuda
{"title":"Spline tie-decay temporal networks","authors":"Chanon Thongprayoon, Naoki Masuda","doi":"arxiv-2408.11913","DOIUrl":null,"url":null,"abstract":"Increasing amounts of data are available on temporal, or time-varying,\nnetworks. There have been various representations of temporal network data each\nof which has different advantages for downstream tasks such as mathematical\nanalysis, visualizations, agent-based and other dynamical simulations on the\ntemporal network, and discovery of useful structure. The tie-decay network is a\nrepresentation of temporal networks whose advantages include the capability of\ngenerating continuous-time networks from discrete time-stamped contact event\ndata with mathematical tractability and a low computational cost. However, the\ncurrent framework of tie-decay networks is limited in terms of how each\ndiscrete contact event can affect the time-dependent tie strength (which we\ncall the kernel). Here we extend the tie-decay network model in terms of the\nkernel. Specifically, we use a cubic spline function for modeling short-term\nbehavior of the kernel and an exponential decay function for long-term\nbehavior, and graft them together. This spline version of tie-decay network\nenables delayed and $C^1$-continuous interaction rates between two nodes while\nit only marginally increases the computational and memory burden relative to\nthe conventional tie-decay network. We show mathematical properties of the\nspline tie-decay network and numerically showcase it with three tasks: network\nembedding, a deterministic opinion dynamics model, and a stochastic epidemic\nspreading model.","PeriodicalId":501043,"journal":{"name":"arXiv - PHYS - Physics and Society","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-21","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.11913","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Increasing amounts of data are available on temporal, or time-varying, networks. There have been various representations of temporal network data each of which has different advantages for downstream tasks such as mathematical analysis, visualizations, agent-based and other dynamical simulations on the temporal network, and discovery of useful structure. The tie-decay network is a representation of temporal networks whose advantages include the capability of generating continuous-time networks from discrete time-stamped contact event data with mathematical tractability and a low computational cost. However, the current framework of tie-decay networks is limited in terms of how each discrete contact event can affect the time-dependent tie strength (which we call the kernel). Here we extend the tie-decay network model in terms of the kernel. Specifically, we use a cubic spline function for modeling short-term behavior of the kernel and an exponential decay function for long-term behavior, and graft them together. This spline version of tie-decay network enables delayed and $C^1$-continuous interaction rates between two nodes while it only marginally increases the computational and memory burden relative to the conventional tie-decay network. We show mathematical properties of the spline tie-decay network and numerically showcase it with three tasks: network embedding, a deterministic opinion dynamics model, and a stochastic epidemic spreading model.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
样条领带衰减时空网络
有关时态网络或时变网络的数据越来越多。时态网络数据有多种表示方法,每种方法对于下游任务(如数学分析、可视化、基于代理的时态网络动态模拟和其他动态模拟)和发现有用的结构都有不同的优势。领带衰减网络是时态网络的一种表现形式,其优点包括能够从离散的时间戳接触事件数据生成连续时间网络,具有数学上的可操作性和较低的计算成本。然而,目前的领带衰减网络框架在每个离散接触事件如何影响随时间变化的领带强度(我们称之为内核)方面受到了限制。在这里,我们从内核的角度扩展了领带衰减网络模型。具体来说,我们使用三次样条函数来模拟内核的短期行为,使用指数衰减函数来模拟长期行为,并将它们嫁接在一起。这种样条曲线版本的领带衰减网络可以实现两个节点之间的延迟和 $C^1$ 连续交互率,而相对于传统的领带衰减网络,它只稍微增加了计算和内存负担。我们展示了平分线领带衰减网络的数学特性,并通过三个任务对其进行了数值展示:网络嵌入、确定性舆论动力学模型和随机流行病传播模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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