{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T04:28:22Z","timestamp":1772080102688,"version":"3.50.1"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T00:00:00Z","timestamp":1748822400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T00:00:00Z","timestamp":1748822400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJAP2328"],"award-info":[{"award-number":["JPMJAP2328"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Nakajima Foundation"},{"name":"TMU local 5G research support"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Hypergraphs provide a fundamental framework for representing complex systems involving interactions among three or more entities. As empirical hypergraphs grow in size, characterizing their structural properties becomes increasingly challenging due to computational complexity and, in some cases, restricted access to complete data, requiring efficient sampling methods. Random walks offer a practical approach to hypergraph sampling, as they rely solely on local neighborhood information from nodes and hyperedges. In this study, we investigate methods for simultaneously sampling nodes and hyperedges via random walks on large hypergraphs. First, we compare three existing random walks in the context of hypergraph sampling and identify an advantage of the so-called higher-order random walk. Second, by extending an established technique for graphs to the case of hypergraphs, we present a non-backtracking variant of the higher-order random walk. We discuss the convergence of estimators based on the non-backtracking higher-order random walk and validate them through numerical simulations on large empirical hypergraphs. Third, we apply the non-backtracking higher-order random walk to a large hypergraph of co-authorships indexed in the OpenAlex database, where full access to the data is not readily available. Despite the relatively small sample size, our estimates largely align with previous findings on author productivity, team size, and the prevalence of open-access publications. Our findings contribute to the development of analysis methods for large hypergraphs, offering insights into sampling strategies and estimation techniques applicable to real-world complex systems.<\/jats:p>","DOI":"10.1007\/s41109-025-00704-z","type":"journal-article","created":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T16:05:10Z","timestamp":1748880310000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sampling nodes and hyperedges via random walks on large hypergraphs"],"prefix":"10.1007","volume":"10","author":[{"given":"Kazuki","family":"Nakajima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masanao","family":"Kodakari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaki","family":"Aida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,2]]},"reference":[{"key":"704_CR1","first-page":"1","volume":"8","author":"NK Ahmed","year":"2013","unstructured":"Ahmed NK, Neville J, Kompella R (2013) Network sampling: from static to streaming graphs. ACM Trans Knowl Dis Data 8:1\u201356","journal-title":"ACM Trans Knowl Dis Data"},{"key":"704_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1140\/epjds\/s13688-020-00231-0","volume":"9","author":"SG Aksoy","year":"2020","unstructured":"Aksoy SG, Joslyn C, Ortiz Marrero C et al. (2020) Hypernetwork science via high-order hypergraph walks. EPJ Data Sci 9:16","journal-title":"EPJ Data Sci"},{"key":"704_CR3","first-page":"706","volume":"2020","author":"I Amburg","year":"2020","unstructured":"Amburg I, Veldt N, Benson A (2020) Clustering in graphs and hypergraphs with categorical edge labels. Proc Web Conf 2020:706\u2013717","journal-title":"Proc Web Conf"},{"key":"704_CR4","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.laa.2020.01.012","volume":"614","author":"A Banerjee","year":"2021","unstructured":"Banerjee A (2021) On the spectrum of hypergraphs. Linear Algebra Appl 614:82\u2013110","journal-title":"Linear Algebra Appl"},{"key":"704_CR5","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0265545","volume":"17","author":"I Basson","year":"2022","unstructured":"Basson I, Simard MA, Ouangr\u00e9 ZA et al. (2022) The effect of data sources on the measurement of open access: a comparison of dimensions and the web of science. PLoS ONE 17:e0265545","journal-title":"PLoS ONE"},{"key":"704_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2020.05.004","volume":"874","author":"F Battiston","year":"2020","unstructured":"Battiston F, Cencetti G, Iacopini I et al. (2020) Networks beyond pairwise interactions: structure and dynamics. Phys Rep 874:1\u201392","journal-title":"Phys Rep"},{"key":"704_CR7","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1038\/s41567-021-01371-4","volume":"17","author":"F Battiston","year":"2021","unstructured":"Battiston F, Amico E, Barrat A et al. (2021) The physics of higher-order interactions in complex systems. Nat Phys 17:1093\u20131098","journal-title":"Nat Phys"},{"key":"704_CR8","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 et al. (2018) Simplicial closure and higher-order link prediction. Proc Natl Acad Sci 115:E11221\u2013E11230","journal-title":"Proc Natl Acad Sci"},{"key":"704_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2023.04.002","volume":"1018","author":"S Boccaletti","year":"2023","unstructured":"Boccaletti S, De Lellis P, del Genio C et al. (2023) The structure and dynamics of networks with higher order interactions. Phys Rep 1018:1\u201364","journal-title":"Phys Rep"},{"key":"704_CR10","unstructured":"Bosman J, Frantsv\u00e5g JE, Kramer B, et al. (2021) OA Diamond Journals Study. Part 1: Findings. 10.5281\/zenodo.4558704"},{"key":"704_CR11","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","volume":"30","author":"U Brandes","year":"2008","unstructured":"Brandes U (2008) On variants of shortest-path betweenness centrality and their generic computation. Soc Netw 30:136\u2013145","journal-title":"Soc Netw"},{"key":"704_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.101.022308","volume":"101","author":"T Carletti","year":"2020","unstructured":"Carletti T, Battiston F, Cencetti G et al. (2020) Random walks on hypergraphs. Phys Rev E 101:022308","journal-title":"Phys Rev E"},{"key":"704_CR13","volume":"2","author":"T Carletti","year":"2021","unstructured":"Carletti T, Fanelli D, Lambiotte R (2021) Random walks and community detection in hypergraphs. J Phys: Complexity 2:015011","journal-title":"J Phys: Complexity"},{"key":"704_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.14778\/3021924.3021940","volume":"10","author":"X Chen","year":"2016","unstructured":"Chen X, Li Y, Wang P et al. (2016) A general framework for estimating graphlet statistics via random walk. Proc VLDB Endowment 10:253\u2013264","journal-title":"Proc VLDB Endowment"},{"key":"704_CR15","unstructured":"Chitra U, Raphael B (2019) Random walks on hypergraphs with edge-dependent vertex weights. In: Chaudhuri K, Salakhutdinov R (eds) Proceedings of the 36th International conference on machine learning, pp 1172\u20131181"},{"key":"704_CR16","first-page":"1080","volume":"2022","author":"M Choe","year":"2022","unstructured":"Choe M, Yoo J, Lee G et al. (2022) MiDaS: representative sampling from real-world hypergraphs. Proc ACM Web Conf 2022:1080\u20131092","journal-title":"Proc ACM Web Conf"},{"key":"704_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3653306","volume":"18","author":"M Choe","year":"2024","unstructured":"Choe M, Yoo J, Lee G et al. (2024) Representative and back-in-time sampling from real-world hypergraphs. ACM Trans Knowl Dis Data 18:1\u201348","journal-title":"ACM Trans Knowl Dis Data"},{"key":"704_CR18","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s12109-021-09814-9","volume":"37","author":"M Demeter","year":"2021","unstructured":"Demeter M, Jele A, Major ZB (2021) The international development of open access publishing: a comparative empirical analysis over seven world regions and nine academic disciplines. Publ Res Q 37:364\u2013383","journal-title":"Publ Res Q"},{"key":"704_CR19","doi-asserted-by":"crossref","unstructured":"Do MT, Yoon Se, Hooi B, et al. (2020) Structural patterns and generative models of real-world hypergraphs. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp 176\u2013186","DOI":"10.1145\/3394486.3403060"},{"key":"704_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/s42005-021-00634-z","volume":"4","author":"A Eriksson","year":"2021","unstructured":"Eriksson A, Edler D, Rojas A et al. (2021) How choosing random-walk model and network representation matters for flow-based community detection in hypergraphs. Commun Phys 4:133","journal-title":"Commun Phys"},{"key":"704_CR21","doi-asserted-by":"publisher","first-page":"17201","DOI":"10.1109\/ACCESS.2022.3149887","volume":"10","author":"M Fukuda","year":"2022","unstructured":"Fukuda M, Nakajima K, Shudo K (2022) Estimating the bot population on twitter via random walk based sampling. IEEE Access 10:17201\u201317211","journal-title":"IEEE Access"},{"key":"704_CR22","doi-asserted-by":"crossref","unstructured":"Gjoka M, Kurant M, Butts CT, et al. (2010) Walking in facebook: A case study of unbiased sampling of osns. In: 2010 Proceedings IEEE INFOCOM, pp 1\u20139","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"704_CR23","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/JSAC.2011.111011","volume":"29","author":"M Gjoka","year":"2011","unstructured":"Gjoka M, Kurant M, Butts CT et al. (2011) Practical recommendations on crawling online social networks. IEEE J Sel Areas Commun 29:1872\u20131892","journal-title":"IEEE J Sel Areas Commun"},{"key":"704_CR24","doi-asserted-by":"crossref","unstructured":"Hardiman SJ, Katzir L (2013) Estimating clustering coefficients and size of social networks via random walk. In: Proceedings of the 22nd International Conference on World Wide Web, pp 539\u2013550","DOI":"10.1145\/2488388.2488436"},{"key":"704_CR25","doi-asserted-by":"crossref","unstructured":"Hayashi K, Aksoy SG, Park CH, et al. (2020) Hypergraph random walks, laplacians, and clustering. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp 495\u2013504","DOI":"10.1145\/3340531.3412034"},{"key":"704_CR26","doi-asserted-by":"publisher","first-page":"4609","DOI":"10.1073\/pnas.1914221117","volume":"117","author":"J Huang","year":"2020","unstructured":"Huang J, Gates AJ, Sinatra R et al. (2020) Historical comparison of gender inequality in scientific careers across countries and disciplines. Proc Natl Acad Sci 117:4609\u20134616","journal-title":"Proc Natl Acad Sci"},{"key":"704_CR27","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1214\/154957804100000051","volume":"1","author":"GL Jones","year":"2004","unstructured":"Jones GL (2004) On the Markov chain central limit theorem. Probab Surv 1:299\u2013320","journal-title":"Probab Surv"},{"key":"704_CR28","doi-asserted-by":"publisher","unstructured":"Kodakari M, Nakajima K, Aida M (2025a) Estimating Hyperedge Size Distribution via Random Walk on Hypergraphs. In: Proceedings of The 13th international conference on complex networks and their applications, pp. 68\u201376. https:\/\/doi.org\/10.1007\/978-3-031-82431-9_6","DOI":"10.1007\/978-3-031-82431-9_6"},{"key":"704_CR280","doi-asserted-by":"crossref","unstructured":"Kodakari M, Nakajima K, Aida M (2025b) Estimating node degree distribution via random walk in hypergraphs. In: IEICE Proceedings Series (to appear)","DOI":"10.1007\/978-3-031-82431-9_6"},{"key":"704_CR29","first-page":"1323","volume":"66","author":"V Larivi\u00e8re","year":"2015","unstructured":"Larivi\u00e8re V, Gingras Y, Sugimoto CR et al. (2015) Team size matters: collaboration and scientific impact since 1900. J Am Soc Inf Sci 66:1323\u20131332","journal-title":"J Am Soc Inf Sci"},{"key":"704_CR30","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:31\u201348","journal-title":"Soc Netw"},{"key":"704_CR31","doi-asserted-by":"crossref","unstructured":"Lee CH, Xu X, Eun DY (2012) Beyond random walk and metropolis-hastings samplers: Why you should not backtrack for unbiased graph sampling. In: Proceedings of the 12th ACM SIGMETRICS\/PERFORMANCE joint international conference on measurement and modeling of computer systems, pp 319\u2013330","DOI":"10.1145\/2254756.2254795"},{"key":"704_CR32","first-page":"3396","volume":"2021","author":"G Lee","year":"2021","unstructured":"Lee G, Choe M, Shin K (2021) How do hyperedges overlap in real-world hypergraphs? - patterns, measures, and generators. Proc Web Conf 2021:3396\u20133407","journal-title":"Proc Web Conf"},{"key":"704_CR33","doi-asserted-by":"crossref","unstructured":"Lee G, Bu F, Eliassi-Rad T, et al. (2025) A survey on hypergraph mining: Patterns, tools, and generators. 2401.08878","DOI":"10.1145\/3719002"},{"key":"704_CR34","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, pp 631\u2013636","DOI":"10.1145\/1150402.1150479"},{"key":"704_CR35","doi-asserted-by":"crossref","unstructured":"Levin DA, Peres Y (2017) Markov chains and mixing times, vol 107. American Mathematical Society","DOI":"10.1090\/mbk\/107"},{"key":"704_CR36","doi-asserted-by":"crossref","unstructured":"Li RH, Yu JX, Qin L, et al. (2015) On random walk based graph sampling. In: 2015 IEEE 31st international conference on data engineering, pp 927\u2013938","DOI":"10.1109\/ICDE.2015.7113345"},{"key":"704_CR37","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00607-023-01230-5","volume":"106","author":"QF Lotito","year":"2024","unstructured":"Lotito QF, Musciotto F, Battiston F et al. (2024) Exact and sampling methods for mining higher-order motifs in large hypergraphs. Computing 106:475\u2013494","journal-title":"Computing"},{"key":"704_CR38","first-page":"1","volume":"2","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz L (1993) Random walks on graphs: a survey. Combinatorics, Paul Erd\u0151s is Eighty 2:1\u201346","journal-title":"Combinatorics, Paul Erd\u0151s is Eighty"},{"key":"704_CR39","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s11280-024-01253-8","volume":"27","author":"Q Luo","year":"2024","unstructured":"Luo Q, Xie Z, Liu Y et al. (2024) Sampling hypergraphs via joint unbiased random walk. World Wide Web 27:15","journal-title":"World Wide Web"},{"key":"704_CR40","doi-asserted-by":"publisher","first-page":"20220043","DOI":"10.1098\/rsif.2022.0043","volume":"19","author":"S Majhi","year":"2022","unstructured":"Majhi S, Perc M, Ghosh D (2022) Dynamics on higher-order networks: a review. J R Soc Interface 19:20220043","journal-title":"J R Soc Interface"},{"key":"704_CR41","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1038\/s41467-024-55506-1","volume":"16","author":"F Malizia","year":"2025","unstructured":"Malizia F, Lamata-Ot\u00edn S, Frasca M et al. (2025) Hyperedge overlap drives explosive transitions in systems with higher-order interactions. Nat Commun 16:555","journal-title":"Nat Commun"},{"key":"704_CR42","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:e0136497","journal-title":"PLoS ONE"},{"key":"704_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2017.07.007","volume":"716\u2013717","author":"N Masuda","year":"2017","unstructured":"Masuda N, Porter MA, Lambiotte R (2017) Random walks and diffusion on networks. Phys Rep 716\u2013717:1\u201358","journal-title":"Phys Rep"},{"key":"704_CR44","doi-asserted-by":"crossref","unstructured":"Mislove A, Marcon M, Gummadi KP, et al. (2007) Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp 29\u201342","DOI":"10.1145\/1298306.1298311"},{"key":"704_CR45","doi-asserted-by":"crossref","unstructured":"Nagasato K, Takabe S, Shudo K (2023) Hypergraph embedding based on random walk with adjusted transition probabilities. In: Big data analytics and knowledge discovery, pp 91\u2013100","DOI":"10.1007\/978-3-031-39831-5_8"},{"key":"704_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3561388","volume":"17","author":"K Nakajima","year":"2023","unstructured":"Nakajima K, Shudo K (2023) Random walk sampling in social networks involving private nodes. ACM Trans Knowl Dis Data 17:1\u201328","journal-title":"ACM Trans Knowl Dis Data"},{"key":"704_CR47","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1109\/TNSE.2021.3133380","volume":"9","author":"K Nakajima","year":"2022","unstructured":"Nakajima K, Shudo K, Masuda N (2022) Randomizing hypergraphs preserving degree correlation and local clustering. IEEE Trans Netw Sci Eng 9:1139\u20131153","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"704_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2023.101460","volume":"17","author":"K Nakajima","year":"2023","unstructured":"Nakajima K, Liu R, Shudo K et al. (2023) Quantifying gender imbalance in east asian academia: Research career and citation practice. J Informet 17:101460","journal-title":"J Informet"},{"key":"704_CR49","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"M Newman","year":"2018","unstructured":"Newman M (2018) Networks, 2nd edn. Oxford University Press, Oxford","edition":"2"},{"key":"704_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjds\/s13688-017-0114-8","volume":"6","author":"A Patania","year":"2017","unstructured":"Patania A, Petri G, Vaccarino F (2017) The shape of collaborations. EPJ Data Sci 6:1\u201316","journal-title":"EPJ Data Sci"},{"key":"704_CR51","doi-asserted-by":"publisher","DOI":"10.7717\/peerj.4375","volume":"6","author":"H Piwowar","year":"2018","unstructured":"Piwowar H, Priem J, Larivi\u00e8re V et al. (2018) The state of oa: a large-scale analysis of the prevalence and impact of open access articles. PeerJ 6:e4375","journal-title":"PeerJ"},{"key":"704_CR52","unstructured":"Priem J, Piwowar H, Orr R (2022) OpenAlex: A fully-open index of scholarly works, authors, venues, institutions, and concepts. arXiv preprint arXiv:2205.01833"},{"key":"704_CR53","doi-asserted-by":"crossref","unstructured":"Ribeiro B, Towsley D (2010) Estimating and sampling graphs with multidimensional random walks. In: Proceedings of the 10th ACM SIGCOMM conference on internet measurement, pp 390\u2013403","DOI":"10.1145\/1879141.1879192"},{"key":"704_CR54","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1214\/154957804100000024","volume":"1","author":"GO Roberts","year":"2004","unstructured":"Roberts GO, Rosenthal JS (2004) General state space Markov chains and MCMC algorithms. Probab Surv 1:20\u201371","journal-title":"Probab Surv"},{"key":"704_CR55","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s11192-020-03647-7","volume":"125","author":"G Rogers","year":"2020","unstructured":"Rogers G, Szomszor M, Adams J (2020) Sample size in bibliometric analysis. Scientometrics 125:777\u2013794","journal-title":"Scientometrics"},{"key":"704_CR56","doi-asserted-by":"publisher","first-page":"eadg9159","DOI":"10.1126\/sciadv.adg9159","volume":"9","author":"N Ruggeri","year":"2023","unstructured":"Ruggeri N, Contisciani M, Battiston F et al. (2023) Community detection in large hypergraphs. Sci Adv 9:eadg9159","journal-title":"Sci Adv"},{"key":"704_CR57","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1111\/j.0081-1750.2004.00152.x","volume":"34","author":"MJ Salganik","year":"2004","unstructured":"Salganik MJ, Heckathorn DD (2004) Sampling and estimation in hidden populations using respondent-driven sampling. Sociol Methodol 34:193\u2013240","journal-title":"Sociol Methodol"},{"key":"704_CR58","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0272730","volume":"17","author":"MA Simard","year":"2022","unstructured":"Simard MA, Ghiasi G, Mongeon P et al. (2022) National differences in dissemination and use of open access literature. PLoS ONE 17:e0272730","journal-title":"PLoS ONE"},{"key":"704_CR59","doi-asserted-by":"crossref","unstructured":"Simard MA, Basson I, Hare M, et al. (2024) The value of a diamond: Understanding global coverage of diamond open access journals in web of science, scopus, and openalex to support an open future. Proceedings of the Annual Conference of CAIS \/ Actes du congres annuel de l\u2019ACSI","DOI":"10.29173\/cais1845"},{"key":"704_CR60","doi-asserted-by":"crossref","unstructured":"Sinha A, Shen Z, Song Y, et al. (2015) An overview of microsoft academic service (MAS) and applications. In: Proceedings of the 24th international conference on world wide web","DOI":"10.1145\/2740908.2742839"},{"key":"704_CR61","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0023176","volume":"6","author":"J Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9 J, Voirin N, Barrat A et al. (2011) High-resolution measurements of face-to-face contact patterns in a primary school. PLoS ONE 6:e23176","journal-title":"PLoS ONE"},{"issue":"5","key":"704_CR62","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.109.054309","volume":"109","author":"P Traversa","year":"2024","unstructured":"Traversa P, de Arruda GF, Moreno Y (2024) From unbiased to maximal-entropy random walks on hypergraphs. Phys Rev E 109(5):054309","journal-title":"Phys Rev E"},{"key":"704_CR63","first-page":"1","volume":"9","author":"P Wang","year":"2014","unstructured":"Wang P, Lui JCS, Ribeiro B et al. (2014) Efficiently estimating motif statistics of large networks. ACM Trans Knowl Dis Data 9:1\u201327","journal-title":"ACM Trans Knowl Dis Data"},{"key":"704_CR64","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1126\/science.1136099","volume":"316","author":"S Wuchty","year":"2007","unstructured":"Wuchty S, Jones BF, Uzzi B (2007) The increasing dominance of teams in production of knowledge. Science 316:1036\u20131039","journal-title":"Science"},{"key":"704_CR65","doi-asserted-by":"crossref","unstructured":"Zhang L, Zhang Z, Wang G, et al. (2023) Efficiently sampling and estimating hypergraphs by hybrid random walk. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp 1273\u20131285","DOI":"10.1109\/ICDE55515.2023.00102"},{"key":"704_CR66","doi-asserted-by":"crossref","unstructured":"Zhou D, Huang J, Sch\u00f6lkopf B (2006) Learning with hypergraphs: Clustering, classification, and embedding. In: Sch\u00f6lkopf B, Platt J, Hoffman T (eds) Advances in Neural Information Processing Systems","DOI":"10.7551\/mitpress\/7503.003.0205"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00704-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00704-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00704-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T17:02:46Z","timestamp":1748883766000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-025-00704-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,2]]},"references-count":67,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["704"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00704-z","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,2]]},"assertion":[{"value":"26 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"19"}}