{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:25:16Z","timestamp":1777573516138,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,4,19]]},"DOI":"10.1145\/3442381.3450102","type":"proceedings-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T19:03:16Z","timestamp":1622746996000},"page":"718-729","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["DYMOND: DYnamic MOtif-NoDes Network Generative Model"],"prefix":"10.1145","author":[{"given":"Giselle","family":"Zeno","sequence":"first","affiliation":[{"name":"Purdue University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy","family":"La Fond","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer","family":"Neville","sequence":"additional","affiliation":[{"name":"Purdue University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.042806"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132952.1132954"},{"key":"e_1_3_2_1_4_1","volume-title":"The average distances in random graphs with given expected degrees.Proceedings of the National Academy of Sciences of the United States of America 99, 25","author":"Chung Fan","year":"2002","unstructured":"Fan Chung and Linyuan Lu. 2002. The average distances in random graphs with given expected degrees.Proceedings of the National Academy of Sciences of the United States of America 99, 25 ( 2002 ), 15879\u201315882. https:\/\/doi.org\/10.1073\/pnas.252631999 10.1073\/pnas.252631999 Fan Chung and Linyuan Lu. 2002. The average distances in random graphs with given expected degrees.Proceedings of the National Academy of Sciences of the United States of America 99, 25 (2002), 15879\u201315882. https:\/\/doi.org\/10.1073\/pnas.252631999"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erd\u00f6s P","year":"1959","unstructured":"P Erd\u00f6s and a R\u00e9nyi. 1959 . On random graphs . Publicationes Mathematicae 6 (1959), 290 \u2013 297 . https:\/\/doi.org\/10.2307\/1999405 arxiv:1205.2923 10.2307\/1999405 P Erd\u00f6s and a R\u00e9nyi. 1959. On random graphs. Publicationes Mathematicae 6 (1959), 290\u2013297. https:\/\/doi.org\/10.2307\/1999405 arxiv:1205.2923","journal-title":"Publicationes Mathematicae"},{"key":"e_1_3_2_1_6_1","volume-title":"Epidemiologically Optimal Static Networks from Temporal Network Data. PLoS Computational Biology 9, 7","author":"Holme Petter","year":"2013","unstructured":"Petter Holme . 2013. Epidemiologically Optimal Static Networks from Temporal Network Data. PLoS Computational Biology 9, 7 ( 2013 ). https:\/\/doi.org\/10.1371\/journal.pcbi.1003142 10.1371\/journal.pcbi.1003142 Petter Holme. 2013. Epidemiologically Optimal Static Networks from Temporal Network Data. PLoS Computational Biology 9, 7 (2013). https:\/\/doi.org\/10.1371\/journal.pcbi.1003142"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2015-60657-4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv227"},{"key":"e_1_3_2_1_9_1","volume-title":"Random graph models for directed acyclic networks. Physical Review E","author":"Karrer Brian","year":"2009","unstructured":"Brian Karrer and M.\u00a0E.\u00a0 J. Newman . 2009. Random graph models for directed acyclic networks. Physical Review E ( 2009 ). https:\/\/doi.org\/10.1103\/PhysRevE.80.046110 arxiv:0907.4346 10.1103\/PhysRevE.80.046110 Brian Karrer and M.\u00a0E.\u00a0J. Newman. 2009. Random graph models for directed acyclic networks. Physical Review E (2009). https:\/\/doi.org\/10.1103\/PhysRevE.80.046110 arxiv:0907.4346"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30115-8_22"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2015-60481-x"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756039"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Jure Leskovec Jon Kleinberg and Christos Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD) 1 1(2007) 2.  Jure Leskovec Jon Kleinberg and Christos Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD) 1 1(2007) 2.","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_15_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_16_1","volume-title":"Properties , and Implications. 2","author":"Li Lun","year":"2006","unstructured":"Lun Li , David Alderson , John\u00a0 C Doyle , and Walter Willinger . 2006. Towards a Theory of Scale-Free Graphs : Definition , Properties , and Implications. 2 ( 2006 ), 431\u2013523. Lun Li, David Alderson, John\u00a0C Doyle, and Walter Willinger. 2006. Towards a Theory of Scale-Free Graphs : Definition , Properties , and Implications. 2 (2006), 431\u2013523."},{"key":"#cr-split#-e_1_3_2_1_17_1.1","doi-asserted-by":"crossref","unstructured":"R. Milo S. Shen-Orr S. Itzkovitz N. Kashtan D. Chklovskii and U. Alon. 2002. Network motifs: Simple building blocks of complex networks. Science 298 5594 (2002) 824-827. https:\/\/doi.org\/10.1126\/science.298.5594.824 10.1126\/science.298.5594.824","DOI":"10.1126\/science.298.5594.824"},{"key":"#cr-split#-e_1_3_2_1_17_1.2","doi-asserted-by":"crossref","unstructured":"R. Milo S. Shen-Orr S. Itzkovitz N. Kashtan D. Chklovskii and U. Alon. 2002. Network motifs: Simple building blocks of complex networks. Science 298 5594 (2002) 824-827. https:\/\/doi.org\/10.1126\/science.298.5594.824","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.114.108701"},{"key":"e_1_3_2_1_19_1","volume-title":"An Investigation of the Distributional Characteristics of Generative Graph Models. Win","author":"Moreno Sebastian","year":"2009","unstructured":"Sebastian Moreno and Jennifer Neville . 2009. An Investigation of the Distributional Characteristics of Generative Graph Models. Win ( 2009 ). Sebastian Moreno and Jennifer Neville. 2009. An Investigation of the Distributional Characteristics of Generative Graph Models. Win (2009)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753208735"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1543767.1543769"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep00469"},{"key":"e_1_3_2_1_24_1","unstructured":"Rene Pickhardt. 2016. Extracting 2 social network graphs from the Democratic National Committee Email Corpus on Wikileaks. https:\/\/www.rene-pickhardt.de\/extracting-2-social-network-graphs-from-the-democratic-national-committee-email-corpus-on-wikileaks\/. [Online; accessed 14-October-2016].  Rene Pickhardt. 2016. Extracting 2 social network graphs from the Democratic National Committee Email Corpus on Wikileaks. https:\/\/www.rene-pickhardt.de\/extracting-2-social-network-graphs-from-the-democratic-national-committee-email-corpus-on-wikileaks\/. [Online; accessed 14-October-2016]."},{"key":"e_1_3_2_1_25_1","unstructured":"Julia Preusse J\u00e9r\u00f4me Kunegis Matthias Thimm Steffen Staab and Thomas Gottron. 2013. Structural Dynamics of Knowledge Networks.ICWSM 17(2013) 18.  Julia Preusse J\u00e9r\u00f4me Kunegis Matthias Thimm Steffen Staab and Thomas Gottron. 2013. Structural Dynamics of Knowledge Networks.ICWSM 17(2013) 18."},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 14th International Workshop on Mining and Learning with Graphs","author":"Purohit Sumit","year":"2018","unstructured":"Sumit Purohit , Lawrence\u00a0 B Holder , and George Chin . 2018 . Temporal Graph Generation Based on a Distribution of Temporal Motifs . Proceedings of the 14th International Workshop on Mining and Learning with Graphs (2018), 7. Sumit Purohit, Lawrence\u00a0B Holder, and George Chin. 2018. Temporal Graph Generation Based on a Distribution of Temporal Motifs. Proceedings of the 14th International Workshop on Mining and Learning with Graphs (2018), 7."},{"key":"e_1_3_2_1_27_1","volume-title":"Bursts of Vertex Activation and Epidemics in Evolving Networks. PLoS Computational Biology 9, 3","author":"Rocha E.C.","year":"2013","unstructured":"Luis\u00a0 E.C. Rocha and Vincent\u00a0 D. Blondel . 2013. Bursts of Vertex Activation and Epidemics in Evolving Networks. PLoS Computational Biology 9, 3 ( 2013 ). https:\/\/doi.org\/10.1371\/journal.pcbi.1002974 10.1371\/journal.pcbi.1002974 Luis\u00a0E.C. Rocha and Vincent\u00a0D. Blondel. 2013. Bursts of Vertex Activation and Epidemics in Evolving Networks. PLoS Computational Biology 9, 3 (2013). https:\/\/doi.org\/10.1371\/journal.pcbi.1002974"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.92.022811"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.042805"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294547"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/108\/58001"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871694"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403082"}],"event":{"name":"WWW '21: The Web Conference 2021","location":"Ljubljana Slovenia","acronym":"WWW '21","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the Web Conference 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3450102","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442381.3450102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:27Z","timestamp":1750195467000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3450102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":35,"alternative-id":["10.1145\/3442381.3450102","10.1145\/3442381"],"URL":"https:\/\/doi.org\/10.1145\/3442381.3450102","relation":{},"subject":[],"published":{"date-parts":[[2021,4,19]]},"assertion":[{"value":"2021-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}