{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:45:36Z","timestamp":1772253936115,"version":"3.50.1"},"reference-count":37,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"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":[[2024,12,29]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Activities such as the movement of passengers and goods, the transfer of physical or digital assets, web navigation and even successive passes in football, result in timestamped paths through a physical or virtual network. The need to analyse such paths has produced a new modelling paradigm in the form of higher-order networks which are able to capture temporal and topological characteristics of sequential data. This has been complemented by sequence mining approaches, a key example being sequential motifs measuring the prevalence of recurrent subsequences. Previous work on higher-order networks has focused on how to identify the optimal order for a path dataset, where the order can be thought of as the number of steps of memory encoded in the model. In this article, we build on these approaches to consider which orders are necessary to reproduce different path characteristics, from path lengths to counts of sequential motifs, viewing paths generated from different higher-order models as null models which capture features of the data up to a certain order, and randomize otherwise. Furthermore, we provide an important extension to motif counting, whereby cases with self-loops, starting nodes and ending nodes of paths are taken into consideration. Conducting a thorough analysis using path lengths and sequential motifs on a diverse range of path datasets, we show that our approach can shed light on precisely where models of different order overperform or underperform, and what this may imply about the original path data.<\/jats:p>","DOI":"10.1093\/comnet\/cnae050","type":"journal-article","created":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T05:34:26Z","timestamp":1736487266000},"source":"Crossref","is-referenced-by-count":1,"title":["Performance of higher-order networks in reconstructing sequential paths: from micro to macro scale"],"prefix":"10.1093","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3985-7569","authenticated-orcid":false,"given":"Kevin","family":"Teo","sequence":"first","affiliation":[{"name":"Network Science Institute, Northeastern University London , 58 St Katharine\u2019s Way , London E1W 1LP,","place":["United Kingdom"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naomi","family":"Arnold","sequence":"additional","affiliation":[{"name":"Network Science Institute, Northeastern University London , 58 St Katharine\u2019s Way , London E1W 1LP,","place":["United Kingdom"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Hone","sequence":"additional","affiliation":[{"name":"School of Mathematics, Statistics & Actuarial Science, University of Kent , Canterbury CT2 7NF,","place":["United Kingdom"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1473-6644","authenticated-orcid":false,"given":"Istv\u00e1n Zolt\u00e1n","family":"Kiss","sequence":"additional","affiliation":[{"name":"Network Science Institute, Northeastern University London , 58 St Katharine\u2019s Way , London E1W 1LP,","place":["United Kingdom"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2025,1,10]]},"reference":[{"key":"2025011005341822700_cnae050-B1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1038\/s41567-019-0459-y","article-title":"From networks to optimal higher-order models of complex systems","volume":"15","author":"Lambiotte","year":"2019","journal-title":"Nat Phys"},{"key":"2025011005341822700_cnae050-B2","doi-asserted-by":"crossref","first-page":"e1600028","DOI":"10.1126\/sciadv.1600028","article-title":"Representing higher-order dependencies in networks","volume":"2","author":"Xu","year":"2016","journal-title":"Sci Adv"},{"issue":"1","key":"2025011005341822700_cnae050-B3","article-title":"Higher-order network analysis takes off, fueled by old ideas and new data","volume":"21","author":"Benson","year":"2021","journal-title":"SIAM News Blog"},{"key":"2025011005341822700_cnae050-B4","doi-asserted-by":"crossref","first-page":"4630","DOI":"10.1038\/ncomms5630","article-title":"Memory in network flows and its effects on spreading dynamics and community detection","volume":"5","author":"Rosvall","year":"2014","journal-title":"Nat Commun"},{"key":"2025011005341822700_cnae050-B5","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1038\/s41467-017-00148-9","article-title":"Modelling sequences and temporal networks with dynamic community structures","volume":"8","author":"Peixoto","year":"2017","journal-title":"Nat Commun"},{"key":"2025011005341822700_cnae050-B6","doi-asserted-by":"crossref","first-page":"cnac036","DOI":"10.1093\/comnet\/cnac036","article-title":"Sequential motifs in observed walks","volume":"10","author":"LaRock","year":"2022","journal-title":"J Complex Netw"},{"key":"2025011005341822700_cnae050-B7","first-page":"1037","author":"Scholtes","year":"2017"},{"key":"2025011005341822700_cnae050-B8","doi-asserted-by":"crossref","first-page":"112","DOI":"10.3390\/a10040112","article-title":"Mapping higher-order network flows in memory and multilayer networks with infomap","volume":"10","author":"Edler","year":"2017","journal-title":"Algorithms"},{"key":"2025011005341822700_cnae050-B9","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1137\/21M1414024","article-title":"What are higher-order networks?","volume":"65","author":"Bick","year":"2023","journal-title":"SIAM Rev"},{"key":"2025011005341822700_cnae050-B10","doi-asserted-by":"crossref","first-page":"2347","DOI":"10.1007\/s10115-022-01800-7","article-title":"caSPiTa: mining statistically significant paths in time series data from an unknown network","volume":"65","author":"Tonon","year":"2023","journal-title":"Knowl Inf Syst"},{"key":"2025011005341822700_cnae050-B11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1140\/epjds\/s13688-020-00233-y","article-title":"Efficient modeling of higher-order dependencies in networks: from algorithm to application for anomaly detection","volume":"9","author":"Saebi","year":"2020","journal-title":"EPJ Data Sci"},{"key":"2025011005341822700_cnae050-B12","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1214\/aos\/1018031204","article-title":"Variable length Markov chains","volume":"27","author":"B\u00fchlmann","year":"1999","journal-title":"Ann Stat"},{"key":"2025011005341822700_cnae050-B13","first-page":"1559","author":"Petrovic","year":"2022"},{"key":"2025011005341822700_cnae050-B14","volume-title":"Predicting sequences of traversed nodes in graphs using network models with multiple higher orders","author":"Gote","year":"2020"},{"key":"2025011005341822700_cnae050-B15","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s41109-023-00596-x","article-title":"Predicting variable-length paths in networked systems using multi-order generative models","volume":"8","author":"Gote","year":"2023","journal-title":"Appl Netw Sci"},{"key":"2025011005341822700_cnae050-B16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","article-title":"On information and sufficiency","volume":"22","author":"Kullback","year":"1951","journal-title":"Ann Math Stat"},{"key":"2025011005341822700_cnae050-B17","doi-asserted-by":"publisher","volume-title":"Selected Papers of Hirotugu Akaike. Springer Series in Statistics","author":"Akaike","DOI":"10.1007\/978-1-4612-1694-0_15"},{"key":"2025011005341822700_cnae050-B18","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","article-title":"Network motifs: simple building blocks of complex networks","volume":"298","author":"Milo","year":"2002","journal-title":"Science"},{"key":"2025011005341822700_cnae050-B19","doi-asserted-by":"crossref","first-page":"P11005","DOI":"10.1088\/1742-5468\/2011\/11\/P11005","article-title":"Temporal motifs in time-dependent networks","volume":"2011","author":"Kovanen","year":"2011","journal-title":"J Stat Mech"},{"key":"2025011005341822700_cnae050-B20","first-page":"601","author":"Paranjape","year":"2017"},{"key":"2025011005341822700_cnae050-B21","volume-title":"Probability: An Introduction","author":"Grimmett","year":"2014"},{"key":"2025011005341822700_cnae050-B22","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/990301.990304","article-title":"Selective markov models for predicting web page accesses","volume":"4","author":"Deshpande","year":"2004","journal-title":"ACM Trans Intern Technol"},{"key":"2025011005341822700_cnae050-B23","volume-title":"Introduction to Probability","author":"Grinstead","year":"2012"},{"key":"2025011005341822700_cnae050-B24","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MSP.2018.2867638","article-title":"Model selection techniques: an overview","volume":"35","author":"Ding","year":"2018","journal-title":"IEEE Signal Process Mag"},{"key":"2025011005341822700_cnae050-B25","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1214\/aoms\/1177732360","article-title":"The large-sample distribution of the likelihood ratio for testing composite hypotheses","volume":"9","author":"Wilks","year":"1938","journal-title":"Ann Math Stat"},{"key":"2025011005341822700_cnae050-B26","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/wics.199","article-title":"The Bayesian information criterion: background, derivation, and applications","volume":"4","author":"Neath","year":"2012","journal-title":"Wiley Interdiscip Rev"},{"key":"2025011005341822700_cnae050-B27","doi-asserted-by":"publisher","author":"Moreira-Matias","year":"2015","DOI":"10.24432\/C55W25"},{"key":"2025011005341822700_cnae050-B28","doi-asserted-by":"publisher","volume-title":"Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2016. Lecture Notes in Computer Science()","author":"Fournier-Viger","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"2025011005341822700_cnae050-B29","author":"Powered by TfL Open Data Undefined","year":"1993"},{"key":"2025011005341822700_cnae050-B30","author":"Metro Bike Share Undefined"},{"key":"2025011005341822700_cnae050-B31","author":"Bureau of Transportation Statistics 2023 Q1 Origin and Destination Survey","year":"1993"},{"key":"2025011005341822700_cnae050-B32","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1214\/aos\/1176344136","article-title":"Estimating the dimension of a model","volume":"6","author":"Schwarz","year":"1978","journal-title":"Ann Stat"},{"key":"2025011005341822700_cnae050-B33","volume-title":"Simulation Methodology for Statisticians, Operations Analysts, and Engineers (1988).","author":"Lewis","year":"2017"},{"key":"2025011005341822700_cnae050-B34","doi-asserted-by":"crossref","DOI":"10.24926\/9781959870029","volume-title":"Statistics for Ecologists: A Frequentist and Bayesian Treatment of Modern Regression Models","author":"Fieberg","year":"2024"},{"key":"2025011005341822700_cnae050-B35","first-page":"109","author":"Gote","year":"2022"},{"key":"2025011005341822700_cnae050-B36","doi-asserted-by":"publisher","author":"Trench","DOI":"10.13140\/2.1.3374.1766"},{"key":"2025011005341822700_cnae050-B37","author":"OEIS Foundation Inc","year":"2024"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/13\/1\/cnae050\/61399620\/cnae050.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/13\/1\/cnae050\/61399620\/cnae050.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T05:34:38Z","timestamp":1736487278000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnae050\/7950925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,29]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,12,29]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnae050","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,2]]},"published":{"date-parts":[[2024,12,29]]},"article-number":"cnae050"}}