{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T11:45:46Z","timestamp":1753875946715,"version":"3.41.2"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T00:00:00Z","timestamp":1746489600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Hypergraphs have been a recent focus of study in mathematical data science as a tool to understand complex networks with high-order connections. One question of particular relevance\u2014how to leverage information carried in hypergraph attributions when doing walk-based techniques. In this work, we focus on a new generalization of a walk in a network that recovers previous approaches and allows for a description of permissible walks in hypergraphs. Permissible walk graphs are constructed by intersecting the attributed s-line graph of a hypergraph with a relation respecting graph. The attribution of the hypergraph\u2019s line graph commonly carries over information from categorical and temporal attributions of the original hypergraph. To demonstrate this approach on a temporally attributed example, we apply our framework to a Reddit data set composed of hyperedges as threads and authors as nodes where post times are tracked.<\/jats:p>","DOI":"10.1093\/comnet\/cnaf010","type":"journal-article","created":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T22:12:19Z","timestamp":1751148739000},"source":"Crossref","is-referenced-by-count":0,"title":["Understanding high-order network structure using permissible walks on attributed hypergraphs"],"prefix":"10.1093","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6268-9227","authenticated-orcid":false,"given":"Audun","family":"Myers","sequence":"first","affiliation":[{"name":"Pacific Northwest National Laboratory , 3335 Innovation Blvd , Richland, Washington, 99354,","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7053-5666","authenticated-orcid":false,"given":"Enzo","family":"Battistella","sequence":"additional","affiliation":[{"name":"Network Science Institute, Northeastern University 177 Huntington Ave , Boston, Massachusetts, 02115,","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"English","sequence":"additional","affiliation":[{"name":"University of North Carolina Wilmington , 601 College Rd, Wilmington, North Carolina, 28403,","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Green","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory , 3335 Innovation Blvd , Richland, Washington, 99354,","place":["United States"]},{"name":"State University of New York at Albany , 353 Broadway , Albany, New York, 12207,","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cliff","family":"Joslyn","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory , 3335 Innovation Blvd , Richland, Washington, 99354,","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evgeniya","family":"Lagoda","sequence":"additional","affiliation":[{"name":"Freie Universit\u00e4t Berlin and Berlin Mathematical School , Berlin,","place":["Germany"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van","family":"Magnan","sequence":"additional","affiliation":[{"name":"University of Vermont , Burlington, Vermont, 05405,","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evan D","family":"Nash","sequence":"additional","affiliation":[{"name":"Center for Naval Analyses , Arlington, Virginia, 22201,","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Robinson","sequence":"additional","affiliation":[{"name":"American University , Washington, DC,","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2025,6,21]]},"reference":[{"key":"2025062818121331000_cnaf010-B1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.laa.2020.01.012","article-title":"On the spectrum of hypergraphs","volume":"614","author":"Banerjee","year":"2021","journal-title":"Linear Algebra Appl"},{"key":"2025062818121331000_cnaf010-B2","doi-asserted-by":"crossref","first-page":"3268","DOI":"10.1016\/j.laa.2011.11.018","article-title":"Spectra of uniform hypergraphs","volume":"436","author":"Cooper","year":"2012","journal-title":"Linear Algebra Appl"},{"first-page":"495","year":"2020","author":"Hayashi","key":"2025062818121331000_cnaf010-B3"},{"first-page":"1172","year":"2019","author":"Chitra","key":"2025062818121331000_cnaf010-B4"},{"first-page":"855","year":"2016","author":"Grover","key":"2025062818121331000_cnaf010-B5"},{"key":"2025062818121331000_cnaf010-B6","doi-asserted-by":"crossref","first-page":"022308","DOI":"10.1103\/PhysRevE.101.022308","article-title":"Random walks on hypergraphs","volume":"101","author":"Carletti","year":"2020","journal-title":"Phys Rev E"},{"key":"2025062818121331000_cnaf010-B7","doi-asserted-by":"crossref","first-page":"015011","DOI":"10.1088\/2632-072X\/abe27e","article-title":"Random walks and community detection in hypergraphs","volume":"2","author":"Carletti","year":"2021","journal-title":"J Phys Complex"},{"key":"2025062818121331000_cnaf010-B8","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1140\/epjds\/s13688-020-00231-0","article-title":"Hypernetwork science via high-order hypergraph walks","volume":"9","author":"Aksoy","year":"2020","journal-title":"EPJ Data Sci"},{"first-page":"1085","year":"2018","author":"Nguyen","key":"2025062818121331000_cnaf010-B9"},{"year":"2020","author":"Baumgartner","key":"2025062818121331000_cnaf010-B10"},{"key":"2025062818121331000_cnaf010-B11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","article-title":"Temporal networks","volume":"519","author":"Holme","year":"2012","journal-title":"Phys Rep"},{"key":"2025062818121331000_cnaf010-B12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41109-023-00555-6","article-title":"Attributed Stream Hypergraphs: temporal modeling of node-attributed high-order interactions","volume":"8","author":"Failla","year":"2023","journal-title":"Appl Netw Sci"},{"volume-title":"Modeling Dynamic Transportation Networks","year":"2012","author":"David Boyce","key":"2025062818121331000_cnaf010-B13"},{"year":"2023","author":"Bernardoni","key":"2025062818121331000_cnaf010-B14"},{"key":"2025062818121331000_cnaf010-B15","doi-asserted-by":"crossref","first-page":"012052","DOI":"10.1088\/1742-6596\/1255\/1\/012052","article-title":"Modeling the transmission of infectious disease in a dynamic network","volume":"1255","author":"Husein","year":"2019","journal-title":"J Phys Conf Ser"},{"key":"2025062818121331000_cnaf010-B16","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s11083-016-9411-2","article-title":"Interval-valued rank in finite ordered sets","volume":"34","author":"Joslyn","year":"2017","journal-title":"Order"},{"year":"2023","author":"Battistella","key":"2025062818121331000_cnaf010-B17"},{"year":"2021","author":"Ostroski","key":"2025062818121331000_cnaf010-B18"},{"author":"Ostroski","key":"2025062818121331000_cnaf010-B19"},{"year":"2021","author":"Ostroski","key":"2025062818121331000_cnaf010-B20"},{"key":"2025062818121331000_cnaf010-B21","first-page":"9:1","volume-title":"Engineering Design Reliability Handbook","author":"Joslyn","year":"2005"},{"key":"2025062818121331000_cnaf010-B22","doi-asserted-by":"crossref","first-page":"9340","DOI":"10.1073\/pnas.97.16.9340","article-title":"A dynamic model of social network formation","volume":"97","author":"Skyrms","year":"2000","journal-title":"Proc Natl Acad Sci USA"},{"key":"2025062818121331000_cnaf010-B23","doi-asserted-by":"crossref","first-page":"056115","DOI":"10.1103\/PhysRevE.85.056115","article-title":"Random walks on temporal networks","volume":"85","author":"Starnini","year":"2012","journal-title":"Phys Rev E Stat Nonlin Soft Matter Phys"},{"key":"2025062818121331000_cnaf010-B24","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1017\/S0269888900007797","article-title":"Ontologies: principles, methods and applications","volume":"11","author":"Uschold","year":"1996","journal-title":"Knowledge Eng Rev"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/13\/3\/cnaf010\/63542913\/cnaf010.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/13\/3\/cnaf010\/63542913\/cnaf010.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T22:12:21Z","timestamp":1751148741000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnaf010\/8171344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5,6]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnaf010","relation":{},"ISSN":["2051-1329"],"issn-type":[{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2025,6]]},"published":{"date-parts":[[2025,5,6]]},"article-number":"cnaf010"}}