{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T13:35:35Z","timestamp":1772717735933,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T00:00:00Z","timestamp":1661212800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T00:00:00Z","timestamp":1661212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2020R1C1C1008296"],"award-info":[{"award-number":["NRF-2020R1C1C1008296"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","award":["2019-0-00075"],"award-info":[{"award-number":["2019-0-00075"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10115-022-01739-9","type":"journal-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T04:02:41Z","timestamp":1661227361000},"page":"2883-2920","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Growth patterns and models of real-world hypergraphs"],"prefix":"10.1007","volume":"64","author":[{"given":"Jihoon","family":"Ko","sequence":"first","affiliation":[]},{"given":"Yunbum","family":"Kook","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-1526","authenticated-orcid":false,"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"1739_CR1","doi-asserted-by":"crossref","unstructured":"Akoglu L, McGlohon M, Faloutsos C (2010) Oddball: spotting anomalies in weighted graphs. In: PAKDD","DOI":"10.1007\/978-3-642-13672-6_40"},{"key":"1739_CR2","doi-asserted-by":"crossref","unstructured":"Alstott J, Bullmore DP (2014) powerlaw: a python package for analysis of heavy-tailed distributions. PloS one 9(1)","DOI":"10.1371\/journal.pone.0085777"},{"issue":"5439","key":"1739_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"48","key":"1739_CR4","doi-asserted-by":"publisher","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson AR, Abebe R, Schaub MT, Jadbabaie A, Kleinberg J (2018) Simplicial closure and higher-order link prediction. Proc Natl Acad Sci 115(48):E11221\u2013E11230","journal-title":"Proc Natl Acad Sci"},{"key":"1739_CR5","doi-asserted-by":"crossref","unstructured":"Benson AR, Kumar R, Tomkins A (2018) Sequences of sets. In: KDD","DOI":"10.1145\/3219819.3220100"},{"key":"1739_CR6","doi-asserted-by":"crossref","unstructured":"Choe M, Yoo J, Lee G, Baek W, Kang U, Shin K (2022) Midas: representative sampling from real-world hypergraphs. In: WWW","DOI":"10.1145\/3485447.3512157"},{"issue":"4","key":"1739_CR7","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset A, Shalizi CR, Newman ME (2009) Power-law distributions in empirical data. SIAM Rev 51(4):661\u2013703","journal-title":"SIAM Rev"},{"key":"1739_CR8","doi-asserted-by":"crossref","unstructured":"Do MT, Yoon Se, Hooi B, Shin K (2020) Structural patterns and generative models of real-world hypergraphs. In: KDD","DOI":"10.1145\/3394486.3403060"},{"issue":"6","key":"1739_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3369782","volume":"52","author":"M Drobyshevskiy","year":"2019","unstructured":"Drobyshevskiy M, Turdakov D (2019) Random graph modeling: a survey of the concepts. ACM Comput Surv (CSUR) 52(6):1\u201336","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"1","key":"1739_CR10","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P, R\u00e9nyi A et al (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(1):17\u201360","journal-title":"Publ Math Inst Hung Acad Sci"},{"issue":"4","key":"1739_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"M Faloutsos","year":"1999","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. ACM SIGCOMM Comput Commun Rev 29(4):251\u2013262","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"issue":"12","key":"1739_CR12","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"1739_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10115-010-0305-0","volume":"27","author":"U Kang","year":"2011","unstructured":"Kang U, Tsourakakis CE, Faloutsos C (2011) Pegasus: mining peta-scale graphs. Knowl Inf Syst 27(2):303\u2013325","journal-title":"Knowl Inf Syst"},{"key":"1739_CR14","doi-asserted-by":"crossref","unstructured":"Kook Y, Ko J, Shin K (2020) Evolution of real-world hypergraphs: patterns and models without oracles. In: ICDM","DOI":"10.1109\/ICDM50108.2020.00036"},{"key":"1739_CR15","doi-asserted-by":"crossref","unstructured":"Lee G, Shin K (2021) Thyme+: temporal hypergraph motifs and fast algorithms for exact counting. In: ICDM","DOI":"10.1109\/ICDM51629.2021.00042"},{"issue":"11","key":"1739_CR16","first-page":"2256","volume":"13","author":"G Lee","year":"2020","unstructured":"Lee G, Ko J, Shin K (2020) Hypergraph motifs: concepts, algorithms, and discoveries. PVLDB 13(11):2256\u20132269","journal-title":"PVLDB"},{"key":"1739_CR17","doi-asserted-by":"crossref","unstructured":"Lee G, Choe M, Shin K (2021) How do hyperedges overlap in real-world hypergraphs?\u2014patterns, measures, and generators. In: TheWebConf","DOI":"10.1145\/3442381.3450010"},{"key":"1739_CR18","doi-asserted-by":"crossref","unstructured":"Lee K, Ko J, Shin K (2022) Slugger: lossless hierarchical summarization of massive graphs. In: ICDE","DOI":"10.1109\/ICDE53745.2022.00040"},{"key":"1739_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: KDD","DOI":"10.1145\/1150402.1150479"},{"key":"1739_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):2\u2013es","DOI":"10.1145\/1217299.1217301"},{"key":"1739_CR21","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C, Ghahramani Z (2010) Kronecker graphs: an approach to modeling networks. J Mach Learn Res 11:985\u20131042","journal-title":"J Mach Learn Res"},{"issue":"9","key":"1739_CR22","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0136497","volume":"10","author":"R Mastrandrea","year":"2015","unstructured":"Mastrandrea R, Fournet J, Barrat A (2015) Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLoS ONE 10(9):e0136497","journal-title":"PLoS ONE"},{"issue":"3","key":"1739_CR23","first-page":"318","volume":"36","author":"GJ McLachlan","year":"1987","unstructured":"McLachlan GJ (1987) On bootstrapping the likelihood ratio test statistic for the number of components in a normal mixture. J Roy Stat Soc Ser C (Appl Stat) 36(3):318\u2013324","journal-title":"J Roy Stat Soc Ser C (Appl Stat)"},{"issue":"5663","key":"1739_CR24","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R Milo","year":"2004","unstructured":"Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen-Orr S, Ayzenshtat I, Sheffer M, Alon U (2004) Superfamilies of evolved and designed networks. Science 303(5663):1538\u20131542","journal-title":"Science"},{"key":"1739_CR25","first-page":"45","volume":"19","author":"RC Murphy","year":"2010","unstructured":"Murphy RC, Wheeler KB, Barrett BW, Ang JA (2010) Introducing the graph 500. Cray Users Group (CUG) 19:45\u201374","journal-title":"Cray Users Group (CUG)"},{"key":"1739_CR26","doi-asserted-by":"crossref","unstructured":"Sala A, Cao L, Wilson C, Zablit R, Zheng H, Zhao BY (2010) Measurement-calibrated graph models for social network experiments. In: WWW","DOI":"10.1145\/1772690.1772778"},{"issue":"39","key":"1739_CR27","doi-asserted-by":"publisher","first-page":"15224","DOI":"10.1073\/pnas.0703740104","volume":"104","author":"M Sales-Pardo","year":"2007","unstructured":"Sales-Pardo M, Guimera R, Moreira AA, Amaral LAN (2007) Extracting the hierarchical organization of complex systems. Proc Natl Acad Sci 104(39):15224\u201315229","journal-title":"Proc Natl Acad Sci"},{"key":"1739_CR28","doi-asserted-by":"crossref","unstructured":"Salihoglu S, Widom J (2013) GPS: a graph processing system. In: SSDBM","DOI":"10.1145\/2484838.2484843"},{"issue":"3","key":"1739_CR29","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s10115-017-1077-6","volume":"54","author":"K Shin","year":"2018","unstructured":"Shin K, Eliassi-Rad T, Faloutsos C (2018) Patterns and anomalies in k-cores of real-world graphs with applications. Knowl Inf Syst 54(3):677\u2013710","journal-title":"Knowl Inf Syst"},{"key":"1739_CR30","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE (2008) Fast counting of triangles in large real networks without counting: Algorithms and laws. In: ICDM, pp 608\u2013617","DOI":"10.1109\/ICDM.2008.72"},{"issue":"6684","key":"1739_CR31","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"issue":"4","key":"1739_CR32","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1111\/j.1469-1809.1972.tb00293.x","volume":"21","author":"B Woolf","year":"1957","unstructured":"Woolf B (1957) The log likelihood ratio test (the g-test). Ann Hum Genet 21(4):397\u2013409","journal-title":"Ann Hum Genet"},{"key":"1739_CR33","doi-asserted-by":"crossref","unstructured":"Zhang Y, Humbert M, Surma B, Manoharan P, Vreeken J, Backes M (2020) Towards plausible graph anonymization. In: NDSS","DOI":"10.14722\/ndss.2020.23032"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01739-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01739-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01739-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T04:04:03Z","timestamp":1663214643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01739-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,23]]},"references-count":33,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1739"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01739-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,23]]},"assertion":[{"value":"29 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}