{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T11:32:11Z","timestamp":1785238331124,"version":"3.55.0"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T00:00:00Z","timestamp":1591747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T00:00:00Z","timestamp":1591747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EPJ Data Sci."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width. Graph methods which then generalize to hypergraphs include connected component analyses, graph distance-based metrics such as closeness centrality, and motif-based measures such as clustering coefficients. We apply high-order analogs of these methods to real world hypernetworks, and show they reveal nuanced and interpretable structure that cannot be detected by graph-based methods. Lastly, we apply three generative models to the data and find that basic hypergraph properties, such as density and degree distributions, do not necessarily control these new structural measurements. Our work demonstrates how analyses of hypergraph-structured data are richer when utilizing tools tailored to capture hypergraph-native phenomena, and suggests one possible avenue towards that end.<\/jats:p>","DOI":"10.1140\/epjds\/s13688-020-00231-0","type":"journal-article","created":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T09:03:04Z","timestamp":1591779784000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":144,"title":["Hypernetwork science via high-order hypergraph walks"],"prefix":"10.1140","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3466-3334","authenticated-orcid":false,"given":"Sinan G.","family":"Aksoy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5923-5547","authenticated-orcid":false,"given":"Cliff","family":"Joslyn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8302-1322","authenticated-orcid":false,"given":"Carlos","family":"Ortiz\u00a0Marrero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1344-0497","authenticated-orcid":false,"given":"Brenda","family":"Praggastis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2069-5594","authenticated-orcid":false,"given":"Emilie","family":"Purvine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,10]]},"reference":[{"key":"231_CR1","volume-title":"Network science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si AL (2016) Network science. Cambridge University Press, Cambridge"},{"issue":"5","key":"231_CR2","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00493-005-0032-4","volume":"25","author":"I Dinur","year":"2005","unstructured":"Dinur I, Regev O, Smyth C (2005) The hardness of 3-uniform hypergraph coloring. Combinatorica 25(5):519\u2013535","journal-title":"Combinatorica"},{"issue":"1","key":"231_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0196-6774(03)00077-4","volume":"49","author":"M Krivelevich","year":"2003","unstructured":"Krivelevich M, Sudakov B (2003) Approximate coloring of uniform hypergraphs. J\u00a0Algorithms 49(1):2\u201312","journal-title":"J\u00a0Algorithms"},{"key":"231_CR4","series-title":"DIMACS series","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/dimacs\/010\/03","volume-title":"Expanding graphs","author":"F Chung","year":"1993","unstructured":"Chung F (1993) The Laplacian of a hypergraph. In: Expanding graphs. DIMACS series, pp\u00a021\u201336"},{"issue":"9","key":"231_CR5","doi-asserted-by":"publisher","first-page":"3268","DOI":"10.1016\/j.laa.2011.11.018","volume":"436","author":"J Cooper","year":"2012","unstructured":"Cooper J, Dutle A (2012) Spectra of uniform hypergraphs. Linear Algebra Appl 436(9):3268\u20133292","journal-title":"Linear Algebra Appl"},{"issue":"1","key":"231_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01787474","volume":"6","author":"N Alon","year":"1990","unstructured":"Alon N (1990) Transversal numbers of uniform hypergraphs. Graphs Comb 6(1):1\u20134","journal-title":"Graphs Comb"},{"issue":"1","key":"231_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20017","volume":"25","author":"V R\u00f6dl","year":"2004","unstructured":"R\u00f6dl V, Skokan J (2004) Regularity lemma for k-uniform hypergraphs. Random Struct Algorithms 25(1):1\u201342","journal-title":"Random Struct Algorithms"},{"key":"231_CR8","doi-asserted-by":"publisher","DOI":"10.24166\/im.03.2018","author":"M Dewar","year":"2018","unstructured":"Dewar M, Healy J, P\u00e9rez-Gim\u00e9nez X, Pra\u0142at P, Proos J, Reiniger B, Ternovsky K (2018) Subhypergraphs in non-uniform random hypergraphs. Internet Math. https:\/\/doi.org\/10.24166\/im.03.2018","journal-title":"Internet Math"},{"issue":"2","key":"231_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/comnet\/cnx039","volume":"6","author":"S Kirkland","year":"2017","unstructured":"Kirkland S (2017) Two-mode networks exhibiting data loss. J\u00a0Complex Netw 6(2):297\u2013316. https:\/\/doi.org\/10.1093\/comnet\/cnx039","journal-title":"J\u00a0Complex Netw"},{"key":"231_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0","volume-title":"Hypergraph theory","author":"A Bretto","year":"2013","unstructured":"Bretto A (2013) Hypergraph theory. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-319-00080-0"},{"key":"231_CR11","series-title":"North-Holland mathematical library","volume-title":"Hypergraphs: combinatorics of finite sets","author":"C Berge","year":"1984","unstructured":"Berge C (1984) Hypergraphs: combinatorics of finite sets. North-Holland mathematical library. North-Holland, Amsterdam"},{"key":"231_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-94-010-1826-5_11","volume-title":"Combinatorics","author":"GOH Katona","year":"1975","unstructured":"Katona GOH (1975) Extremal problems for hypergraphs. In: Combinatorics. Springer, Amsterdam, pp\u00a0215\u2013244. https:\/\/doi.org\/10.1007\/978-94-010-1826-5_11"},{"issue":"1","key":"231_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/bf01224952","volume":"34","author":"W D\u00f6rfler","year":"1980","unstructured":"D\u00f6rfler W, Waller DA (1980) A\u00a0category-theoretical approach to hypergraphs. Arch Math 34(1):185\u2013192. https:\/\/doi.org\/10.1007\/bf01224952","journal-title":"Arch Math"},{"key":"231_CR14","doi-asserted-by":"crossref","unstructured":"Fong B, Spivak DI (2019) Hypergraph categories. arXiv:1806.08304v3","DOI":"10.1016\/j.jpaa.2019.02.014"},{"key":"231_CR15","unstructured":"Schmidt M (2019) Functorial approach to graph and hypergraph theory. arXiv:1907.02574v1"},{"issue":"6","key":"231_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.76.066102","volume":"76","author":"MJ Barber","year":"2007","unstructured":"Barber MJ (2007) Modularity and community detection in bipartite networks. Phys Rev\u00a0E 76(6):066102. https:\/\/doi.org\/10.1103\/physreve.76.066102","journal-title":"Phys Rev\u00a0E"},{"issue":"1","key":"231_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.90.012805","volume":"90","author":"DB Larremore","year":"2014","unstructured":"Larremore DB, Clauset A, Jacobs AZ (2014) Efficiently inferring community structure in bipartite networks. Phys Rev\u00a0E 90(1):012805. https:\/\/doi.org\/10.1103\/physreve.90.012805","journal-title":"Phys Rev\u00a0E"},{"issue":"1","key":"231_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.socnet.2007.04.006","volume":"30","author":"M Latapy","year":"2008","unstructured":"Latapy M, Magnien C, Vecchio ND (2008) Basic notions for the analysis of large two-mode networks. Soc Netw 30(1):31\u201348. https:\/\/doi.org\/10.1016\/j.socnet.2007.04.006","journal-title":"Soc Netw"},{"key":"231_CR19","unstructured":"Praggastis B, Arendt D, Joslyn C, Purvine E, Aksoy S, Monson K (2019) HyperNetX. https:\/\/github.com\/pnnl\/HyperNetX"},{"key":"231_CR20","unstructured":"Hagberg A, Swart P, Chult DS (2008) Exploring network structure, dynamics, and function using networkx. Technical report, Los Alamos National Lab. (LANL), Los Alamos, NM (United States)"},{"key":"231_CR21","unstructured":"Naik RN (2018) Recent advances on intersection graphs of hypergraphs: a survey. arXiv preprint. arXiv:1809.08472"},{"issue":"2","key":"231_CR22","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/s0195-6698(82)80029-2","volume":"3","author":"RN Naik","year":"1982","unstructured":"Naik RN, Rao SB, Shrikhande SS, Singhi NM (1982) Intersection graphs of k-uniform linear hypergraphs. Eur J Comb 3(2):159\u2013172. https:\/\/doi.org\/10.1016\/s0195-6698(82)80029-2","journal-title":"Eur J Comb"},{"issue":"2","key":"231_CR23","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.socnet.2012.05.004","volume":"35","author":"MG Everett","year":"2013","unstructured":"Everett MG, Borgatti SP (2013) The dual-projection approach for two-mode networks. Soc Netw 35(2):204\u2013210. https:\/\/doi.org\/10.1016\/j.socnet.2012.05.004","journal-title":"Soc Netw"},{"issue":"1","key":"231_CR24","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H Whitney","year":"1932","unstructured":"Whitney H (1932) Congruent graphs and the connectivity of graphs. Am J Math 54(1):150. https:\/\/doi.org\/10.2307\/2371086","journal-title":"Am J Math"},{"key":"231_CR25","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159678","volume-title":"Proceedings of the eleventh ACM international conference on web search and data mining\u2014WSDM\u201918","author":"AE Sar\u0131y\u00fcce","year":"2018","unstructured":"Sar\u0131y\u00fcce AE, Pinar A (2018) Peeling bipartite networks for dense subgraph discovery. In: Proceedings of the eleventh ACM international conference on web search and data mining\u2014WSDM\u201918. ACM, London. https:\/\/doi.org\/10.1145\/3159652.3159678"},{"issue":"4","key":"231_CR26","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U von Luxburg","year":"2007","unstructured":"von Luxburg U (2007) A\u00a0tutorial on spectral clustering. Stat Comput 17(4):395\u2013416. https:\/\/doi.org\/10.1007\/s11222-007-9033-z","journal-title":"Stat Comput"},{"key":"231_CR27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.10","volume-title":"Proceedings of the 2012 SIAM international conference on data mining","author":"D Kuang","year":"2012","unstructured":"Kuang D, Ding C, Park H (2012) Symmetric nonnegative matrix factorization for graph clustering. In: Proceedings of the 2012 SIAM international conference on data mining. Society for Industrial and Applied Mathematics, Philadelphia. https:\/\/doi.org\/10.1137\/1.9781611972825.10"},{"key":"231_CR28","first-page":"1601","volume-title":"Advances in neural information processing systems","author":"D Zhou","year":"2007","unstructured":"Zhou D, Huang J, Sch\u00f6lkopf B (2007) Learning with hypergraphs: clustering, classification, and embedding. In: Advances in neural information processing systems, pp\u00a01601\u20131608"},{"issue":"1","key":"231_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/03081080290011692","volume":"50","author":"JA Rodriguez","year":"2002","unstructured":"Rodriguez JA (2002) On the Laplacian eigenvalues and metric parameters of hypergraphs. Linear Multilinear Algebra 50(1):1\u201314. https:\/\/doi.org\/10.1080\/03081080290011692","journal-title":"Linear Multilinear Algebra"},{"issue":"1\u20133","key":"231_CR30","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0012-365x(93)90322-k","volume":"117","author":"M Bolla","year":"1993","unstructured":"Bolla M (1993) Spectra, Euclidean representations and clusterings of hypergraphs. Discrete Math 117(1\u20133):19\u201339. https:\/\/doi.org\/10.1016\/0012-365x(93)90322-k","journal-title":"Discrete Math"},{"key":"231_CR31","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143847","volume-title":"Proceedings of the 23rd international conference on machine learning\u2014ICML\u201906","author":"S Agarwal","year":"2006","unstructured":"Agarwal S, Branson K, Belongie S (2006) Higher order learning with graphs. In: Proceedings of the 23rd international conference on machine learning\u2014ICML\u201906. ACM, New York. https:\/\/doi.org\/10.1145\/1143844.1143847"},{"key":"231_CR32","unstructured":"Chitra U, Raphael BJ (2019) Random walks on hypergraphs with edge-dependent vertex weights. arXiv preprint. arXiv:1905.08287"},{"issue":"3","key":"231_CR33","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(77)90127-3","volume":"18","author":"J-C Bermond","year":"1977","unstructured":"Bermond J-C, Heydemann M-C, Sotteau D (1977) Line graphs of hypergraphs\u00a0I. Discrete Math 18(3):235\u2013241","journal-title":"Discrete Math"},{"key":"231_CR34","first-page":"14","volume-title":"WAW","author":"L Lu","year":"2011","unstructured":"Lu L, Peng X (2011) High-ordered random walks and generalized Laplacians on hypergraphs. In: WAW. Springer, Berlin, pp\u00a014\u201325"},{"issue":"3","key":"231_CR35","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.jctb.2009.10.002","volume":"100","author":"H H\u00e0n","year":"2010","unstructured":"H\u00e0n H, Schacht M (2010) Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J\u00a0Comb Theory, Ser\u00a0B 100(3):332\u2013346","journal-title":"J\u00a0Comb Theory, Ser\u00a0B"},{"issue":"3","key":"231_CR36","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O","volume":"30","author":"GY Katona","year":"1999","unstructured":"Katona GY, Kierstead HA (1999) Hamiltonian chains in hypergraphs. J\u00a0Graph Theory 30(3):205\u2013212","journal-title":"J\u00a0Graph Theory"},{"issue":"1","key":"231_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02872044","volume":"42","author":"J Wang","year":"1999","unstructured":"Wang J, Lee TT (1999) Paths and cycles of hypergraphs. Sci China Ser\u00a0A, Math 42(1):1\u201312","journal-title":"Sci China Ser\u00a0A, Math"},{"key":"231_CR38","doi-asserted-by":"crossref","unstructured":"Cooley O, Fang W, Del Giudice N, Kang M (2018) Subcritical random hypergraphs, high-order components, and hypertrees. arXiv preprint. arXiv:1810.08107","DOI":"10.1137\/1.9781611975505.12"},{"key":"231_CR39","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.endm.2015.06.077","volume":"49","author":"O Cooley","year":"2015","unstructured":"Cooley O, Kang M, Koch C (2015) Evolution of high-order connected components in random hypergraphs. Electron Notes Discrete Math 49:569\u2013575. https:\/\/doi.org\/10.1016\/j.endm.2015.06.077","journal-title":"Electron Notes Discrete Math"},{"key":"231_CR40","first-page":"2","volume":"23","author":"O Cooley","year":"2016","unstructured":"Cooley O, Kang M, Koch C (2016) Threshold and hitting time for high-order connectedness in random hypergraphs. Electron J Comb 23:2\u201348","journal-title":"Electron J Comb"},{"key":"231_CR41","volume-title":"HICSS 2019 symposium on cybersecurity big data analytics","author":"C Joslyn","year":"2019","unstructured":"Joslyn C, Aksoy S, Arendt D, Jenkins L, Praggastis B, Purvine E, Zalewski M (2019) High performance hypergraph analytics of domain name system relationships. In: HICSS 2019 symposium on cybersecurity big data analytics"},{"key":"231_CR42","first-page":"90","volume-title":"International conference on human interface and the management of information","author":"E Purvine","year":"2018","unstructured":"Purvine E, Aksoy S, Joslyn C, Nowak K, Praggastis B, Robinson M (2018) A\u00a0topological approach to representational data models. In: International conference on human interface and the management of information. Springer, Berlin, pp\u00a090\u2013109"},{"key":"231_CR43","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.546963","author":"MJ Conyon","year":"2004","unstructured":"Conyon MJ, Muldoon MR (2004) The small world network structure of boards of directors. SSRN Electron\u00a0J. https:\/\/doi.org\/10.2139\/ssrn.546963","journal-title":"SSRN Electron\u00a0J"},{"issue":"2","key":"231_CR44","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.64.026118","volume":"64","author":"MEJ Newman","year":"2001","unstructured":"Newman MEJ, Strogatz SH, Watts DJ (2001) Random graphs with arbitrary degree distributions and their applications. Phys Rev\u00a0E 64(2):026118. https:\/\/doi.org\/10.1103\/physreve.64.026118","journal-title":"Phys Rev\u00a0E"},{"issue":"23\u201324","key":"231_CR45","doi-asserted-by":"publisher","first-page":"4636","DOI":"10.1016\/j.physa.2011.06.073","volume":"390","author":"JC Nacher","year":"2011","unstructured":"Nacher JC, Akutsu T (2011) On the degree distribution of projected networks mapped from bipartite networks. Phys\u00a0A, Stat Mech Appl 390(23\u201324):4636\u20134651. https:\/\/doi.org\/10.1016\/j.physa.2011.06.073","journal-title":"Phys\u00a0A, Stat Mech Appl"},{"issue":"2","key":"231_CR46","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.socnet.2011.07.001","volume":"35","author":"T Opsahl","year":"2013","unstructured":"Opsahl T (2013) Triadic closure in two-mode networks: redefining the global and local clustering coefficients. Soc Netw 35(2):159\u2013167. https:\/\/doi.org\/10.1016\/j.socnet.2011.07.001","journal-title":"Soc Netw"},{"key":"231_CR47","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/B978-0-12-352550-5.50022-5","volume-title":"Perspectives on social network research","author":"JH Levine","year":"1979","unstructured":"Levine JH, Roy WS (1979) A\u00a0study of interlocking directorates: vital concepts of organization. In: Perspectives on social network research. Elsevier, Bedford, pp\u00a0349\u2013378"},{"issue":"1","key":"231_CR48","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/b:cmot.0000032580.12184.c0","volume":"10","author":"G Robins","year":"2004","unstructured":"Robins G, Alexander M (2004) Small worlds among interlocking directors: network structure and distance in bipartite graphs. Comput Math Organ Theory 10(1):69\u201394. https:\/\/doi.org\/10.1023\/b:cmot.0000032580.12184.c0","journal-title":"Comput Math Organ Theory"},{"issue":"21","key":"231_CR49","doi-asserted-by":"publisher","first-page":"8685","DOI":"10.1073\/pnas.0701361104","volume":"104","author":"K-I Goh","year":"2007","unstructured":"Goh K-I, Cusick ME, Valle D, Childs B, Vidal M, Barabasi A-L (2007) The human disease network. Proc Natl Acad Sci 104(21):8685\u20138690. https:\/\/doi.org\/10.1073\/pnas.0701361104","journal-title":"Proc Natl Acad Sci"},{"issue":"suppl_1","key":"231_CR50","first-page":"514","volume":"33","author":"A Hamosh","year":"2005","unstructured":"Hamosh A, Scott AF, Amberger JS, Bocchini CA, McKusick VA (2005) Online Mendelian inheritance in man (omim), a knowledgebase of human genes and genetic disorders. Nucleic Acids Res 33(suppl_1):514\u2013517","journal-title":"Nucleic Acids Res"},{"issue":"5","key":"231_CR51","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt S, Haus U-U, Theis F (2009) Hypergraphs and cellular networks. PLoS Comput Biol 5(5):1000385. https:\/\/doi.org\/10.1371\/journal.pcbi.1000385","journal-title":"PLoS Comput Biol"},{"key":"231_CR52","volume-title":"The Stanford GraphBase: a platform for combinatorial computing","author":"DE Knuth","year":"1993","unstructured":"Knuth DE (1993) The Stanford GraphBase: a platform for combinatorial computing. ACM, New York"},{"issue":"1","key":"231_CR53","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10115-010-0319-7","volume":"28","author":"GC Garriga","year":"2010","unstructured":"Garriga GC, Junttila E, Mannila H (2010) Banded structure in binary matrices. Knowl Inf Syst 28(1):197\u2013226. https:\/\/doi.org\/10.1007\/s10115-010-0319-7","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"231_CR54","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev\u00a0E 69(2):026113. https:\/\/doi.org\/10.1103\/physreve.69.026113","journal-title":"Phys Rev\u00a0E"},{"issue":"1","key":"231_CR55","doi-asserted-by":"publisher","DOI":"10.1038\/srep17095","volume":"5","author":"AJ Alvarez-Socorro","year":"2015","unstructured":"Alvarez-Socorro AJ, Herrera-Almarza GC, Gonz\u00e1lez-D\u00edaz LA (2015) Eigencentrality based on dissimilarity measures reveals central nodes in complex networks. Sci Rep 5(1):17095. https:\/\/doi.org\/10.1038\/srep17095","journal-title":"Sci Rep"},{"key":"231_CR56","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-319-34139-2_19","volume-title":"Association for women in mathematics series","author":"C Joslyn","year":"2016","unstructured":"Joslyn C, Purvine E (2016) Information measures of frequency distributions with an application to labeled graphs. In: Association for women in mathematics series. Springer, Berlin, Santa Clara University, pp\u00a0379\u2013400. https:\/\/doi.org\/10.1007\/978-3-319-34139-2_19"},{"issue":"2","key":"231_CR57","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. https:\/\/doi.org\/10.1137\/s003614450342480","journal-title":"SIAM Rev"},{"issue":"19","key":"231_CR58","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.87.198701","volume":"87","author":"V Latora","year":"2001","unstructured":"Latora V, Marchiori M (2001) Efficient behavior of small-world networks. Phys Rev Lett 87(19):198701. https:\/\/doi.org\/10.1103\/physrevlett.87.198701","journal-title":"Phys Rev Lett"},{"key":"231_CR59","unstructured":"Rochat Y (2009) Closeness centrality extended to unconnected graphs: the harmonic centrality index. Technical report"},{"issue":"3","key":"231_CR60","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239. https:\/\/doi.org\/10.1016\/0378-8733(78)90021-7","journal-title":"Soc Netw"},{"key":"231_CR61","series-title":"Wiley series in probability and statistics book","volume-title":"Analysis of ordinal categorical data","author":"A Agresti","year":"2012","unstructured":"Agresti A (2012) Analysis of ordinal categorical data. Wiley series in probability and statistics book, vol\u00a0656. Wiley, New York, University of Michigan"},{"issue":"6684","key":"231_CR62","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. https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"key":"231_CR63","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.physa.2005.12.002","volume":"364","author":"E Estrada","year":"2006","unstructured":"Estrada E, Rodr\u00edguez-Vel\u00e1zquez JA (2006) Subgraph centrality and clustering in complex hyper-networks. Phys\u00a0A, Stat Mech Appl 364:581\u2013594. https:\/\/doi.org\/10.1016\/j.physa.2005.12.002","journal-title":"Phys\u00a0A, Stat Mech Appl"},{"issue":"1","key":"231_CR64","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-132","volume":"12","author":"W Zhou","year":"2011","unstructured":"Zhou W, Nakhleh L (2011) Properties of metabolic graphs: biological organization or representation artifacts? BMC Bioinform 12(1):132. https:\/\/doi.org\/10.1186\/1471-2105-12-132","journal-title":"BMC Bioinform"},{"issue":"4","key":"231_CR65","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/comnet\/cnx001","volume":"5","author":"SG Aksoy","year":"2017","unstructured":"Aksoy SG, Kolda TG, Pinar A (2017) Measuring and modeling bipartite graphs with community structure. J\u00a0Complex Netw 5(4):581\u2013603. https:\/\/doi.org\/10.1093\/comnet\/cnx001","journal-title":"J\u00a0Complex Netw"},{"key":"231_CR66","series-title":"Monograph American Bar Association, section of antitrust law","volume-title":"Interlocking directorates under Section\u00a08 of the Clayton act","author":"SM Axinn","year":"1984","unstructured":"Axinn SM, Proger PA, Yoerg N (1984) Interlocking directorates under Section\u00a08 of the Clayton act. Monograph American Bar Association, section of antitrust law, vol\u00a010. Amer Bar Assn, Chicago"},{"key":"231_CR67","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.endm.2015.06.083","volume":"49","author":"O Parczyk","year":"2015","unstructured":"Parczyk O, Person Y (2015) On spanning structures in random hypergraphs. Electron Notes Discrete Math 49:611\u2013619. https:\/\/doi.org\/10.1016\/j.endm.2015.06.083","journal-title":"Electron Notes Discrete Math"},{"key":"231_CR68","doi-asserted-by":"crossref","unstructured":"Chodrow PS (2019) Configuration models of random hypergraphs and their applications. arXiv preprint. arXiv:1902.09302","DOI":"10.1093\/comnet\/cnaa018"},{"issue":"1A","key":"231_CR69","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1214\/105051604000000567","volume":"15","author":"RWR Darling","year":"2005","unstructured":"Darling RWR, Norris JR (2005) Structure of large random hypergraphs. Ann Appl Probab 15(1A):125\u2013152. https:\/\/doi.org\/10.1214\/105051604000000567","journal-title":"Ann Appl Probab"},{"issue":"6","key":"231_CR70","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.79.066118","volume":"79","author":"G Ghoshal","year":"2009","unstructured":"Ghoshal G, Zlati\u0107 V, Caldarelli G, Newman MEJ (2009) Random hypergraphs and their applications. Phys Rev\u00a0E 79(6):066118. https:\/\/doi.org\/10.1103\/physreve.79.066118","journal-title":"Phys Rev\u00a0E"},{"key":"231_CR71","doi-asserted-by":"crossref","unstructured":"Kaminski B, Poulin V, Pralat P, Szufel P, Theberge F (2018) Clustering via hypergraph modularity. arXiv preprint. arXiv:1810.04816","DOI":"10.1371\/journal.pone.0224307"},{"issue":"1","key":"231_CR72","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P, R\u00e9nyi A (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"},{"key":"231_CR73","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/107","volume-title":"Complex graphs and networks","author":"F Chung","year":"2006","unstructured":"Chung F (2006) Complex graphs and networks, vol\u00a0107. Am. Math. Soc., Providence"},{"issue":"5","key":"231_CR74","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/130914218","volume":"36","author":"TG Kolda","year":"2014","unstructured":"Kolda TG, Pinar A, Plantenga T, Seshadhri C (2014) A\u00a0scalable generative graph model with community structure. SIAM J Sci Comput 36(5):424\u2013452. https:\/\/doi.org\/10.1137\/130914218","journal-title":"SIAM J Sci Comput"},{"issue":"5","key":"231_CR75","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.85.056109","volume":"85","author":"C Seshadhri","year":"2012","unstructured":"Seshadhri C, Kolda TG, Pinar A (2012) Community structure and scale-free collections of Erd\u0151s\u2013R\u00e9nyi graphs. Phys Rev\u00a0E 85(5):056109. https:\/\/doi.org\/10.1103\/physreve.85.056109","journal-title":"Phys Rev\u00a0E"},{"key":"231_CR76","first-page":"1","volume-title":"2018 IEEE high performance extreme computing conference (HPEC)","author":"L Jenkins","year":"2018","unstructured":"Jenkins L, Bhuiyan T, Harun S, Lightsey C, Mentgen D, Aksoy S, Stavcnger T, Zalewski M, Medal H, Joslyn C (2018) Chapel hypergraph library (chgl). In: 2018 IEEE high performance extreme computing conference (HPEC). IEEE, pp\u00a01\u20136"},{"key":"231_CR77","unstructured":"Jenkins L, Stavenger T, Zalewski M, Joslyn C, Aksoy S, Medal H. pnnl\/chgl. https:\/\/github.com\/pnnl\/chgl"},{"issue":"1","key":"231_CR78","doi-asserted-by":"publisher","DOI":"10.1038\/srep36648","volume":"6","author":"J-L Guo","year":"2016","unstructured":"Guo J-L, Zhu X-Y, Suo Q, Forrest J (2016) Non-uniform evolving hypergraphs and weighted evolving hypergraphs. Sci Rep 6(1):36648. https:\/\/doi.org\/10.1038\/srep36648","journal-title":"Sci Rep"},{"issue":"1","key":"231_CR79","doi-asserted-by":"publisher","DOI":"10.1038\/srep33651","volume":"6","author":"J-L Guo","year":"2016","unstructured":"Guo J-L, Suo Q, Shen A-Z, Forrest J (2016) The evolution of hyperedge cardinalities and Bose\u2013Einstein condensation in hypernetworks. Sci Rep 6(1):33651. https:\/\/doi.org\/10.1038\/srep33651","journal-title":"Sci Rep"},{"key":"231_CR80","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220097","volume-title":"Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining\u2014KDD\u201918","author":"S-V Sanei-Mehri","year":"2018","unstructured":"Sanei-Mehri S-V, Sariyuce AE, Tirthapura S (2018) Butterfly counting in bipartite networks. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining\u2014KDD\u201918. ACM, London. https:\/\/doi.org\/10.1145\/3219819.3220097"},{"key":"231_CR81","doi-asserted-by":"crossref","unstructured":"Wang K, Lin X, Qin L, Zhang W, Zhang Y (2018) Vertex priority based butterfly counting for large-scale bipartite networks. arXiv preprint. arXiv:1812.00283","DOI":"10.14778\/3339490.3339497"}],"container-title":["EPJ Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-020-00231-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1140\/epjds\/s13688-020-00231-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-020-00231-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T23:13:07Z","timestamp":1623280387000},"score":1,"resource":{"primary":{"URL":"https:\/\/epjdatascience.springeropen.com\/articles\/10.1140\/epjds\/s13688-020-00231-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,10]]},"references-count":81,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["231"],"URL":"https:\/\/doi.org\/10.1140\/epjds\/s13688-020-00231-0","relation":{},"ISSN":["2193-1127"],"issn-type":[{"value":"2193-1127","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,10]]},"assertion":[{"value":"2 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"16"}}