Sergey Shvydun;Anton-David Almasan;Piet Van Mieghem
{"title":"Temporal Graph Reproduction With RWIG","authors":"Sergey Shvydun;Anton-David Almasan;Piet Van Mieghem","doi":"10.1109/TNSE.2025.3555974","DOIUrl":null,"url":null,"abstract":"We examine the Random Walkers Induced temporal Graph (RWIG) model, which generates temporal graphs based on the co-location principle of <inline-formula><tex-math>$M$</tex-math></inline-formula> independent walkers that traverse the underlying Markov graph with different transition probabilities. Given the assumption that each random walker is in the steady state, we determine the steady-state vector <inline-formula><tex-math>$\\tilde{s}$</tex-math></inline-formula> and the Markov transition matrix <inline-formula><tex-math>$P_{i}$</tex-math></inline-formula> of each walker <inline-formula><tex-math>$w_{i}$</tex-math></inline-formula> that can reproduce the observed temporal network <inline-formula><tex-math>$G_{0},{{\\ldots }},G_{K\\text{--}1}$</tex-math></inline-formula> with the lowest mean squared error. We also examine the performance of RWIG for periodic temporal graph sequences.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3015-3024"},"PeriodicalIF":6.7000,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10945668/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
We examine the Random Walkers Induced temporal Graph (RWIG) model, which generates temporal graphs based on the co-location principle of $M$ independent walkers that traverse the underlying Markov graph with different transition probabilities. Given the assumption that each random walker is in the steady state, we determine the steady-state vector $\tilde{s}$ and the Markov transition matrix $P_{i}$ of each walker $w_{i}$ that can reproduce the observed temporal network $G_{0},{{\ldots }},G_{K\text{--}1}$ with the lowest mean squared error. We also examine the performance of RWIG for periodic temporal graph sequences.
期刊介绍:
The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.