{"title":"样条领带衰减时空网络","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":"{\"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}","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}
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.