{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:47:53Z","timestamp":1771458473691,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T00:00:00Z","timestamp":1752105600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T00:00:00Z","timestamp":1752105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100020299","name":"T\u00e9l\u00e9com Paris","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100020299","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Temporal networks allow representing connections between objects while incorporating the temporal dimension. While static network models can capture unchanging topological regularities, they often fail to model the effects associated with the causal generative process of the network that occurs in time. Hence, exploiting the temporal aspect of networks has been the focus of many recent studies. In this context, we propose a new framework for generative models of continuous-time temporal networks. We assume that the activation of the edges in a temporal network is driven by a specified temporal point process. This approach allows to directly model the waiting time between events while incorporating time-varying history-based features as covariates in the predictions. Coupled with a thinning algorithm designed for the simulation of point processes, <jats:sc>SimHawNet<\/jats:sc> enables simulation of the evolution of temporal networks in continuous time. Finally, we introduce a comprehensive evaluation framework to assess the performance of such an approach, in which we demonstrate that <jats:sc>SimHawNet<\/jats:sc> successfully simulates the evolution of networks with very different generative processes and achieves performance comparable to the state of the art, while being significantly faster.<\/jats:p>","DOI":"10.1007\/s10618-025-01119-1","type":"journal-article","created":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:53:49Z","timestamp":1752141229000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SimHawNet: a modified Hawkes process for temporal network simulation"],"prefix":"10.1007","volume":"39","author":[{"given":"Mathilde","family":"Perez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rapha\u00ebl","family":"Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tijl","family":"De Bie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jefrey","family":"Lijffijt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charlotte","family":"Laclau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,10]]},"reference":[{"key":"1119_CR1","first-page":"16983","volume":"33","author":"M Arastuie","year":"2020","unstructured":"Arastuie M, Paul S, Xu KS (2020) CHIP: a Hawkes process model for continuous-time networks with scalable and consistent estimation. NeurIPS 33:16983\u201316996","journal-title":"NeurIPS"},{"issue":"214","key":"1119_CR2","first-page":"1","volume":"18","author":"E Bacry","year":"2018","unstructured":"Bacry E, Bompaire M, Deegan P et al (2018) Tick: a python library for statistical learning, with an emphasis on Hawkes processes and time-dependent models. J Mach Learn Res 18(214):1\u20135","journal-title":"J Mach Learn Res"},{"key":"1119_CR3","first-page":"238","volume":"31","author":"CD Bois","year":"2013","unstructured":"Bois CD, Butts CT, Smyth P (2013) Stochastic blockmodeling of relational event dynamics. J Mach Learn Res 31:238\u2013246","journal-title":"J Mach Learn Res"},{"issue":"2","key":"1119_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3379445","volume":"53","author":"A Bonifati","year":"2020","unstructured":"Bonifati A, Holubov\u00e1 I, Prat-P\u00e9rez A et al (2020) Graph generators: state of the art and open challenges. ACM Comput Surv 53(2):1\u201330","journal-title":"ACM Comput Surv"},{"issue":"1","key":"1119_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1111\/j.1467-9531.2008.00203.x","volume":"38","author":"CT Butts","year":"2008","unstructured":"Butts CT (2008) A relational event framework for social action. Sociol Methodol 38(1):155\u2013200","journal-title":"Sociol Methodol"},{"issue":"1","key":"1119_CR6","doi-asserted-by":"publisher","first-page":"55:1","DOI":"10.1007\/s13278-016-0368-3","volume":"6","author":"M Corneli","year":"2016","unstructured":"Corneli M, Latouche P, Rossi F (2016) Block modelling in dynamic networks with non-homogeneous Poisson processes and exact ICL. Soc Netw Anal Min 6(1):55:1-55:14","journal-title":"Soc Netw Anal Min"},{"key":"1119_CR7","unstructured":"Dai H, Wang Y, Trivedi R, et\u00a0al (2016) Deep coevolutionary network: embedding user and item features for recommendation. Preprint at arXiv:1609.03675"},{"key":"1119_CR8","unstructured":"Daley D, Vere-Jones D (2010) An introduction to the theory of point processes volume I, vol\u00a0I"},{"issue":"3","key":"1119_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","volume":"23","author":"T De Bie","year":"2011","unstructured":"De Bie T (2011) Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min Knowl Discov 23(3):407\u2013446. https:\/\/doi.org\/10.1007\/s10618-010-0209-3","journal-title":"Data Min Knowl Discov"},{"key":"1119_CR10","doi-asserted-by":"publisher","first-page":"2203","DOI":"10.1214\/16-AOAS971","volume":"10","author":"D Durante","year":"2016","unstructured":"Durante D, Dunson DB (2016) Locally adaptive dynamic networks. Ann Appl Stat 10:2203\u20132232","journal-title":"Ann Appl Stat"},{"issue":"4","key":"1119_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00779-005-0046-3","volume":"10","author":"N Eagle","year":"2006","unstructured":"Eagle N, Pentland AS (2006) Reality mining: sensing complex social systems. Personal Ubiquitous Comput 10(4):255\u2013268","journal-title":"Personal Ubiquitous Comput"},{"key":"1119_CR12","doi-asserted-by":"crossref","unstructured":"Farajtabar M, Gomez-Rodriguez M, Wang Y, et\u00a0al (2018) COEVOLVE: A joint point process model for information diffusion and network Co-evolution. J Mach Learn Res. pp 473\u2013477. arXiv:1507.02293","DOI":"10.1145\/3184558.3186236"},{"issue":"2","key":"1119_CR13","first-page":"129","volume":"2","author":"A Goldenberg","year":"2009","unstructured":"Goldenberg A, Zheng AX, Fienberg SE et al (2009) A survey of statistical network models. Sociol Methodol 2(2):129\u2013233 arXiv:0912.5410","journal-title":"Sociol Methodol"},{"issue":"1","key":"1119_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1093\/biomet\/58.1.83","volume":"58","author":"AG Hawkes","year":"1971","unstructured":"Hawkes AG (1971) Spectra of some self-exciting and mutually exciting point processes. Biometrika 58(1):83\u201390","journal-title":"Biometrika"},{"issue":"373","key":"1119_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/01621459.1981.10477598","volume":"76","author":"PW Holland","year":"1981","unstructured":"Holland PW, Leinhardt S (1981) An exponential family of probability distributions for directed graphs. J Am Stat Assoc 76(373):33\u201350. https:\/\/doi.org\/10.1080\/01621459.1981.10477598","journal-title":"J Am Stat Assoc"},{"key":"1119_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J (2012) Temporal networks. Phys Rep 519:97\u2013125","journal-title":"Phys Rep"},{"key":"1119_CR17","unstructured":"Huang Z, Soliman H, Paul S, et\u00a0al (2022) A mutually exciting latent space Hawkes process model for continuous-time networks. In: UAI, pp 863\u2013873"},{"key":"1119_CR18","doi-asserted-by":"crossref","unstructured":"Kent AD (2015) Cybersecurity data sources for dynamic network research. In: Dynamic networks in cybersecurity. Imperial College Press","DOI":"10.1142\/9781786340757_0002"},{"issue":"none","key":"1119_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1214\/18-SS121","volume":"12","author":"B Kim","year":"2018","unstructured":"Kim B, Lee KH, Xue L et al (2018) A review of dynamic network models with latent variables. Stat Surv 12(none):105\u2013135","journal-title":"Stat Surv"},{"key":"1119_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1111\/rssb.12014","volume":"76","author":"P Krivitsky","year":"2014","unstructured":"Krivitsky P, Handcock M (2014) A separable model for dynamic networks. J R Stat Soc Ser B Stat Methodol 76:29\u201346","journal-title":"J R Stat Soc Ser B Stat Methodol"},{"key":"1119_CR21","doi-asserted-by":"crossref","unstructured":"Kumar S, Zhang X, Leskovec J (2019) Predicting dynamic embedding trajectory in temporal interaction networks. In: Proceedings of the ACM SIGKDD Conference, pp 1269\u20131278","DOI":"10.1145\/3292500.3330895"},{"key":"1119_CR22","first-page":"1","volume":"8","author":"M Latapy","year":"2017","unstructured":"Latapy M, Viard T, Magnien C (2017) Stream graphs and link streams for the modeling of interactions over time. Soc Netw Anal Min 8:1\u201329","journal-title":"Soc Netw Anal Min"},{"key":"1119_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.comnet.2018.12.010","volume":"150","author":"M Latapy","year":"2019","unstructured":"Latapy M, Fiore M, Ziviani A (2019) Link streams: methods and applications. Comput Netw 150:263\u2013265","journal-title":"Comput Netw"},{"key":"1119_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2334-13-185","volume":"13","author":"A Machens","year":"2013","unstructured":"Machens A, Gesualdo F, Rizzo C et al (2013) An infectious disease model on empirical networks of human contact: bridging the gap between dynamic network data and contact matrices. BMC Infect Dis 13:1\u201315","journal-title":"BMC Infect Dis"},{"issue":"3","key":"1119_CR25","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1093\/biomet\/asy016","volume":"105","author":"C Matias","year":"2018","unstructured":"Matias C, Rebafka T, Villers F (2018) A semiparametric extension of the stochastic block model for longitudinal networks. Biometrika 105(3):665\u2013680","journal-title":"Biometrika"},{"key":"1119_CR26","unstructured":"Mikolov T, Sutskever I, Chen K, et\u00a0al (2013) Distributed representations of words and phrases and their compositionality. arXiv:1310.4546"},{"key":"1119_CR27","doi-asserted-by":"publisher","DOI":"10.1142\/q0033","volume-title":"A guide to temporal networks","author":"N Masuda","year":"2016","unstructured":"Masuda N, Lambiotte R (2016) A guide to temporal networks. World scientific, Singapore"},{"issue":"2","key":"1119_CR28","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"issue":"1","key":"1119_CR29","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1981.1056305","volume":"27","author":"Y Ogata","year":"1981","unstructured":"Ogata Y (1981) On Lewis\u2019 simulation method for point processes. IEEE Trans Inf Theory 27(1):23\u201331","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"1119_CR30","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1177\/0738894221995743","volume":"39","author":"G Palmer","year":"2022","unstructured":"Palmer G, McManus RW, D\u2019Orazio V et al (2022) The mid5 dataset, 2011\u20132014: procedures, coding rules, and description. Confl Manag Peace Sci 39(4):470\u2013482","journal-title":"Confl Manag Peace Sci"},{"issue":"5","key":"1119_CR31","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1002\/asi.21015","volume":"60","author":"P Panzarasa","year":"2009","unstructured":"Panzarasa P, Opsahl T, Carley KM (2009) Patterns and dynamics of users\u2019 behavior and interaction: network analysis of an online community. J Am Soc Inform Sci Technol 60(5):911\u2013932","journal-title":"J Am Soc Inform Sci Technol"},{"issue":"1","key":"1119_CR32","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1080\/10618600.2022.2096048","volume":"32","author":"FS Passino","year":"2023","unstructured":"Passino FS, Heard NA (2023) Mutually exciting point process graphs for modeling dynamic networks. J Comput Graph Stat 32(1):116\u2013130","journal-title":"J Comput Graph Stat"},{"issue":"5","key":"1119_CR33","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1111\/rssb.12013","volume":"75","author":"PO Perry","year":"2013","unstructured":"Perry PO, Wolfe PJ (2013) Point process modelling for directed interaction networks. J R Stat Soc Ser B Stat Methodol 75(5):821\u2013849","journal-title":"J R Stat Soc Ser B Stat Methodol"},{"issue":"4","key":"1119_CR34","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1017\/nws.2023.14","volume":"11","author":"R Rastelli","year":"2023","unstructured":"Rastelli R, Corneli M (2023) Continuous latent position models for instantaneous interactions. Netw Sci 11(4):560\u2013588","journal-title":"Netw Sci"},{"key":"1119_CR35","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.socnet.2006.08.002","volume":"29","author":"G Robins","year":"2007","unstructured":"Robins G, Pattison P, Kalish Y et al (2007) An introduction to exponential random graph (p *) models for social networks. Soc Netw 29:173\u2013191. https:\/\/doi.org\/10.1016\/j.socnet.2006.08.002","journal-title":"Soc Netw"},{"key":"1119_CR36","doi-asserted-by":"publisher","first-page":"117971","DOI":"10.1109\/ACCESS.2023.3324213","volume":"11","author":"R Romero","year":"2023","unstructured":"Romero R, Lijffijt J, Rastelli R et al (2023) Gaussian embedding of temporal networks. IEEE Access 11:117971\u2013117983","journal-title":"IEEE Access"},{"key":"1119_CR37","unstructured":"Rossi E, Chamberlain BP, Frasca F, et\u00a0al (2020) Temporal graph networks for deep learning on dynamic graphs. ArXiv arXiv:2006.10637"},{"key":"1119_CR38","doi-asserted-by":"crossref","unstructured":"Rozenshtein P, Gionis A (2019) Mining temporal networks. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery & data mining, pp 3225\u20133226","DOI":"10.1145\/3292500.3332295"},{"key":"1119_CR39","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"1","author":"H Sakoe","year":"1978","unstructured":"Sakoe H, Chiba S (1978) Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans Acoust Speech Signal Process 1:43\u201349","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"key":"1119_CR40","unstructured":"Soliman H, Zhao L, Huang Z, et\u00a0al (2022) The multivariate community Hawkes model for dependent relational events in continuous-time networks. arXiv:2205.00639"},{"key":"1119_CR41","unstructured":"Trivedi R, Farajtabar M, Biswal P, et\u00a0al (2019) Dyrep: learning representations over dynamic graphs. In: International conference on learning representations"},{"issue":"1","key":"1119_CR42","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF01074755","volume":"4","author":"TK Vintsyuk","year":"1968","unstructured":"Vintsyuk TK (1968) Speech discrimination by dynamic programming. Cybernetic 4(1):52\u201357","journal-title":"Cybernetic"},{"key":"1119_CR43","unstructured":"Vu DQ, Asuncion AU, Hunter DR, et\u00a0al (2011) Dynamic egocentric models for citation networks. Proceedings of the 28th international conference on machine learning, ICML 2011 pp 857\u2013864"},{"key":"1119_CR44","unstructured":"Wang Y, Chang Y, Liu Y, et\u00a0al (2021) Inductive representation learning in temporal networks via causal anonymous walks. In: International conference on learning representations, ICLR. OpenReview.net"},{"key":"1119_CR45","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02294547","volume":"61","author":"S Wasserman","year":"1996","unstructured":"Wasserman S, Pattison P (1996) Logit models and logistic regressions for social networks: I. An introduction to Markov graphs and p*. Psychometrika 61:401\u2013425. https:\/\/doi.org\/10.1007\/BF02294547","journal-title":"Psychometrika"},{"key":"1119_CR46","unstructured":"Xu D, Ruan C, Korpeoglu E, et\u00a0al (2020) Inductive representation learning on temporal graphs. In: Eighth international conference on learning representations"},{"key":"1119_CR47","unstructured":"Yang J, Rao VA, Neville J (2017) Decoupling homophily and reciprocity with latent space network models. In: UAI"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01119-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-025-01119-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01119-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T10:29:37Z","timestamp":1757672977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-025-01119-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,10]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["1119"],"URL":"https:\/\/doi.org\/10.1007\/s10618-025-01119-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,10]]},"assertion":[{"value":"15 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"48"}}