| تعداد نشریات | 21 |
| تعداد شمارهها | 701 |
| تعداد مقالات | 10,097 |
| تعداد مشاهده مقاله | 71,305,690 |
| تعداد دریافت فایل اصل مقاله | 63,029,075 |
LifeSage: Existence-aware temporal graphs with multi-interval Lifespans | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقالات آماده انتشار، اصلاح شده برای چاپ، انتشار آنلاین از تاریخ 20 اردیبهشت 1405 اصل مقاله (415.32 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2026.40365.5630 | ||
| نویسندگان | ||
| Mohamadali Berahman؛ Amirhossein Sobhani* ؛ Madjid Eshaghi Gordji | ||
| Department of Mathematics, Statistics and Computer Science, Semnan University, Semnan, Iran | ||
| تاریخ دریافت: 03 بهمن 1404، تاریخ پذیرش: 07 اردیبهشت 1405 | ||
| چکیده | ||
| Classical temporal graph models represent dynamics by allowing edges to appear and disappear over time while implicitly assuming that the underlying vertex set remains fixed. This assumption conflates fundamentally different phenomena, namely behavioral inactivity and structural non-existence of entities, and may lead to inaccurate representations in systems where vertices temporarily or permanently disappear and later reappear. In this work, we introduce LifeSage, an existence-aware temporal graph framework in which vertex existence is treated as a time-dependent quantity. Each vertex is associated with a multi-interval lifespan, enabling explicit modeling of intermittent, cyclic, and irreversible presence patterns. Temporal snapshots are interpreted as projections onto the set of existentially valid vertices, leading to masked adjacency representations in which non-existing entities are structurally excluded rather than treated as inactive. We further distinguish between continuous flows, which require simultaneous existence of both endpoints, and discrete (transit) flows, which may persist independently of endpoint existence. This distinction allows temporal snapshots to violate the classical incidence condition and motivates an existence-aware masking perspective. We also discuss snapshot equivalence, event times, and representative generator snapshots arising from structural transitions in the graph. Finally, we outline how the proposed framework may support existence-aware temporal representations and learning settings on dynamic systems with evolving entity sets. | ||
| کلیدواژهها | ||
| temporal graphs؛ dynamic networks؛ vertex existence؛ multi-interval lifespans؛ masked adjacency؛ existence-aware modeling؛ temporal snapshots | ||
| مراجع | ||
|
[1] A. Barrat, M. Barthelemy, and A. Vespignani, Dynamical Processes on Complex Networks, Cambridge University Press, 2008.
[2] D.S. Bassett and O. Sporns, Network neuroscience, Nat. Neurosci. 20 (2017), 353–364.
[3] M. Batty, The New Science of Cities, MIT Press, 2013.
[4] Ma. Eshaghi and A. Jabbari, On the algebraic and topological structure of temporal graphs: A unified framework for homomorphisms and spatio-temporal flows, Int. J. Nonlinear Anal. Appl. In Press, doi: 10.22075/ijnaa.2025.10333.
[5] M.C. Gonzalez, C.A. Hidalgo, and A.L. Barabasi, Understanding individual human mobility patterns, Nature 453 (2008), 779–782.
[6] P. Holme, Modern temporal network theory, Eur. Phys. J. B 88 (2015), 234.
[7] P. Holme and J. Saramäki, Temporal networks, Phys. Rep. 519 (2012), 97–125.
[8] S.M. Kazemi, R. Goel, K. Jain, I. Kobyzev, A. Sethi, P. Forsyth, and P. Poupart, Representation learning for dynamic graphs, J. Mach. Learn. Res. 21 (2020), 1–73.
[9] D. Kempe, J. Kleinberg, and A. Kumar, Connectivity and inference problems for temporal networks, J. Comput. Syst. Sci. 64 (2002), 820–842.
[10] Mikko Kivela, A. Arenas, M. Barthelemy, J.P. Gleeson, Y. Moreno, M.A. Porter, Multilayer networks, J. Complex Netw. 2 (2014), 203–271.
[11] N. Masuda and P. Holme, A Guide to Temporal Networks, World Scientific, 2016.
[12] V. Nicosia, J. Tang, C. Mascolo, M. Musolesi, G. Russo, and V. Latora, Graph metrics for temporal networks, Temporal Networks, Springer, 2013, pp. 15–40.
[13] E. Rossi, B. Chamberlain, F. Frasca, D. Eynard, F. Monti, and M. Bronstein, Temporal graph networks for deep learning on dynamic graphs, arXiv:2006.10637 (2020).
[14] M. Starnini, A. Baronchelli, A. Barrat, and R. Pastor-Satorras, Random walks on temporal networks, Phys. Rev. E 85 (2012), 056115.
[15] D.Xu, C. Ruan, E. Korpeoglu, S. Kumar, and K. Achan, Inductive representation learning on temporal graphs, Proc. Int. Conf. Learn. Represent. (ICLR), 2020. | ||
|
آمار تعداد مشاهده مقاله: 4 تعداد دریافت فایل اصل مقاله: 3 |
||