{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T04:06:10Z","timestamp":1771560370545,"version":"3.50.1"},"reference-count":38,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T00:00:00Z","timestamp":1571875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/100006129","name":"FCT","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006129","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundao para a Ci\u0142ncia e Tecnologia","award":["UID\/Multi\/04466\/2019"],"award-info":[{"award-number":["UID\/Multi\/04466\/2019"]}]},{"name":"Fundao para a Ci\u0142ncia e Tecnologia","award":["UID\/EEA\/50008\/2019"],"award-info":[{"award-number":["UID\/EEA\/50008\/2019"]}]},{"name":"Instituto de Telecomunicaes"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the last few years, the study of temporal networks has progressed markedly. The evolution of clusters of nodes (or communities) is one of the major focus of these studies. However, the time dimension increases complexity, introducing new constructs and requiring novel and enhanced algorithms. In spite of recent improvements, the relative scarcity of timestamped representations of empiric networks, with known ground truth, hinders algorithm validation. A few approaches have been proposed to generate synthetic temporal networks that conform to static topological specifications while in general adopting an ad hoc approach to temporal evolution. We believe there is still a need for a principled synthetic network generator that conforms to problem domain topological specifications from a static as well as temporal perspective. Here, we present such a system. The unique attributes of our system include accepting arbitrary node degree and cluster size distributions and temporal evolution under user control, while supporting tunable joint distribution and temporal correlation of node degrees. Theoretical contributions include the analysis of conditions for graphic sequences of inter- and intracluster node degrees and cluster sizes and the development of a heuristic to search for the cluster membership of nodes that minimizes the shared information distance between clusterings. Our work shows that this system is capable of generating networks under user controlled topology with up to thousands of nodes and hundreds of clusters with strong topology adherence. Much larger networks are possible with relaxed requirements. The generated networks support algorithm validation as well as problem domain analysis.<\/jats:p>","DOI":"10.1093\/comnet\/cnz039","type":"journal-article","created":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T06:11:15Z","timestamp":1569391875000},"source":"Crossref","is-referenced-by-count":3,"title":["Syntgen: a system to generate temporal networks with user-specified topology"],"prefix":"10.1093","volume":"8","author":[{"given":"Luis Ramada","family":"Pereira","sequence":"first","affiliation":[{"name":"ISTAR, ISCTE-Instituto Universit\u00e1rio de Lisboa, Lisbon, Portugal"}]},{"given":"Rui J","family":"Lopes","sequence":"additional","affiliation":[{"name":"IT-IUL Instituto de Telecomunica\u00e7\u00f5es, ISCTE-Instituto Universit\u00e1rio de Lisboa, Lisbon, Portugal"}]},{"given":"Jorge","family":"Lou\u00e7\u00e3","sequence":"additional","affiliation":[{"name":"ISTAR, ISCTE-Instituto Universit\u00e1rio de Lisboa, Lisbon, Portugal"}]}],"member":"286","published-online":{"date-parts":[[2019,10,24]]},"reference":[{"key":"2020102320003752600_B1","first-page":"128","article-title":"Solutio problematis ad geometrian situs pertinentis","volume":"8","author":"Euler,","year":"1736","journal-title":"Coment. Acad. Sci. Petropol."},{"key":"2020102320003752600_B2","first-page":"1","article-title":"Algorithms for graph partitioning: a survey","volume":"6","author":"Newman,","year":"2004","journal-title":"Soc. Netw."},{"key":"2020102320003752600_B3","doi-asserted-by":"crossref","first-page":"962","DOI":"10.2307\/2315277","article-title":"No graph is perfect","volume":"74","author":"Behzad,","year":"1967","journal-title":"Am. Math. Monthly"},{"key":"2020102320003752600_B4","doi-asserted-by":"crossref","first-page":"026118","DOI":"10.1103\/PhysRevE.64.026118","article-title":"Random graphs with arbitrary degree distributions and their applications","volume":"64","author":"Newman,","year":"2000","journal-title":"Phys. Rev. E"},{"key":"2020102320003752600_B5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","article-title":"Community detection in networks: a user guide","volume":"659","author":"Fortunato,","year":"2016","journal-title":"Phys. Rep."},{"key":"2020102320003752600_B6","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti,","year":"2008","journal-title":"Phys. Rev. E"},{"key":"2020102320003752600_B7","first-page":"1","article-title":"The scale-free property","volume-title":"Network Science","author":"Barab\u00e1si,","year":"2015"},{"key":"2020102320003752600_B8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1103\/PhysRevE.80.056117","article-title":"Community detection algorithms: a comparative analysis","volume":"80","author":"Lancichinetti,","year":"2009","journal-title":"Phys. Rev. E"},{"key":"2020102320003752600_B9","doi-asserted-by":"crossref","first-page":"30750","DOI":"10.1038\/srep30750","article-title":"A comparative analysis of community detection algorithms on artificial networks","volume":"6","author":"Yang,","year":"2016","journal-title":"Sci. Rep."},{"key":"2020102320003752600_B10","first-page":"1","article-title":"Comparing clusterings\u2014an Overview","volume":"4769","author":"Wagner,","year":"2007","journal-title":"KITopen"},{"key":"2020102320003752600_B11","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.jmva.2006.11.013","article-title":"Comparing clusterings\u2014an information based distance","volume":"98","author":"Meil,","year":"2007","journal-title":"J. Multivar. Anal."},{"key":"2020102320003752600_B12","first-page":"35:1","article-title":"Community discovery in dynamic networks: a survey","volume":"51-2","author":"Rossetti,","year":"2018","journal-title":"ACM Comput. Surv."},{"key":"2020102320003752600_B13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1103\/PhysRevE.92.012805","article-title":"Benchmark model to assess community structure in evolving networks","volume":"92","author":"Granell,","year":"2015","journal-title":"Phys. Rev. E"},{"key":"2020102320003752600_B14","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/ASONAM.2010.17","article-title":"Tracking the evolution of communities in dynamic social networks","author":"Greene,","year":"2010","journal-title":"Proceedings of the 2010 International Conference on Advances in Social Network Analysis and Mining"},{"key":"2020102320003752600_B15","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1093\/comnet\/cnx016","article-title":"RD YN : graph benchmark handling community dynamics","volume":"5","author":"Rossetti,","year":"2017","journal-title":"J. Complex Netw."},{"key":"2020102320003752600_B16","article-title":"Generative benchmark models for mesoscale structure in multilayer networks","author":"Bazzi,","year":"2016"},{"key":"2020102320003752600_B17","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1109\/ICDM.2017.51","article-title":"Benchmark generator for dynamic overlapping communities in networks","volume-title":"2017 IEEE International Conference on Data Mining (ICDM)","author":"Sengupta,","year":"2017"},{"key":"2020102320003752600_B18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-319-05401-8_19","article-title":"Distributed generation of billion-node social graphs with overlapping community structure","volume":"549","author":"Chykhradze,","year":"2014","journal-title":"Stud. Comput. Intell."},{"key":"2020102320003752600_B19","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/070710111","article-title":"Power-law distributions in empirical data","volume":"51","author":"Clauset,","year":"2009","journal-title":"SIAM Rev."},{"key":"2020102320003752600_B20","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1038\/nature05670","article-title":"Quantifying social group evolution","volume":"446","author":"Palla,","year":"2007","journal-title":"Nature"},{"key":"2020102320003752600_B21","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1103\/PhysRevE.67.026126","article-title":"Mixing patterns in networks","volume":"67","author":"Newman,","year":"2003","journal-title":"Phys. Rev. E"},{"key":"2020102320003752600_B22","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks: An Introduction","author":"Newman,","year":"2018","edition":"2nd edn"},{"key":"2020102320003752600_B23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1017\/S0004972700002872","article-title":"A simple proof of the Erdos-Gallai theorem on graph sequences","volume":"33","author":"Choudum,","year":"1986","journal-title":"Bull. Aust. Math. Soc."},{"key":"2020102320003752600_B24","first-page":"264","article-title":"Gr\u00e1fok el\u0151\u00edrt fok\u00fa pontokkal","volume":"11","author":"Erd\u00f6s,","year":"1960","journal-title":"Matematikai Lapok"},{"key":"2020102320003752600_B25","first-page":"1","article-title":"Prescribed joint degree distribution","volume":"abs\/1103.4","author":"Stanton,","year":"2011","journal-title":"CoRR"},{"key":"2020102320003752600_B26","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1016\/j.disc.2009.09.023","article-title":"A short constructive proof of the Erd\u00f6s-Gallai characterization of graphic lists","volume":"310","author":"Tripathi,","year":"2010","journal-title":"Discrete Math."},{"key":"2020102320003752600_B27","first-page":"361","article-title":"Gephi: an open source software for exploring and manipulating networks","volume-title":"Third International AAAI Conference on Weblogs and Social Media","author":"Bastian,","year":"2009"},{"key":"2020102320003752600_B28","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1140\/epjb\/e2004-00038-8","article-title":"Cut-offs and finite size effects in scale-free networks","volume":"38","author":"Boguna,","year":"2004","journal-title":"A. Eur. Phys. J. B"},{"key":"2020102320003752600_B29","article-title":"Hierarchical Clustering Based on Mutual Information","author":"Kraskov,","year":"2003"},{"key":"2020102320003752600_B30","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s00591-005-0094-9","article-title":"The many aspects of counting lattice points in polytopes","volume":"52","author":"Loera,","year":"2005","journal-title":"Math. Semesterber."},{"key":"2020102320003752600_B31","first-page":"1","article-title":"An algorithmic theory of lattice points in polyhedra","volume":"38","author":"Barvinok,","year":"1999","journal-title":"New Perspect. Algebr. Comb."},{"key":"2020102320003752600_B32","article-title":"A user \u2019s guide for LattE integrale v1.7.2","author":"Baldoni,","year":"2014"},{"key":"2020102320003752600_B33","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(98)00086-1","article-title":"A complete anytime algorithm for number partitioning","volume":"106","author":"Korf,","year":"1998","journal-title":"Artif. Intell."},{"key":"2020102320003752600_B34","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-319-55471-6_2","article-title":"Community structures evaluation in complex networks: a descriptive approach","volume-title":"3rd International Winter School and Conference on Network Science. Springer Proceedings in Complexity","author":"Dao,","year":"2017"},{"key":"2020102320003752600_B35","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel,","year":"2008","journal-title":"J. Stat. Mech. Theory Exp"},{"key":"2020102320003752600_B36","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","article-title":"Resolution limit in community detection","volume":"104","author":"Fortunato,","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2020102320003752600_B37","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1111\/j.1469-8137.1912.tb05611.x","article-title":"The distribution of the flora in the alpine zone","volume":"11","author":"Jaccard,","year":"1912","journal-title":"New Phytolog."},{"key":"2020102320003752600_B38","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1080\/00018730110112519","article-title":"Evolution of networks","volume":"51","author":"Dorogovtsev,","year":"2002","journal-title":"Adv. Phys."}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/8\/4\/cnz039\/33858457\/cnz039.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/8\/4\/cnz039\/33858457\/cnz039.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T20:38:19Z","timestamp":1664483899000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnz039\/5606577"}},"subtitle":[],"editor":[{"given":"Jose","family":"Mendes","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,10,24]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10,9]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnz039","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2020,8]]},"published":{"date-parts":[[2019,10,24]]},"article-number":"cnz039"}}