{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:45:58Z","timestamp":1773153958559,"version":"3.50.1"},"reference-count":35,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2017,9,30]],"date-time":"2017-09-30T00:00:00Z","timestamp":1506729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Swedish research Council","doi-asserted-by":"publisher","award":["2016-00796"],"award-info":[{"award-number":["2016-00796"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Comprehending complex systems by simplifying and highlighting important dynamical patterns requires modeling and mapping higher-order network flows. However, complex systems come in many forms and demand a range of representations, including memory and multilayer networks, which in turn call for versatile community-detection algorithms to reveal important modular regularities in the flows. Here we show that various forms of higher-order network flows can be represented in a unified way with networks that distinguish physical nodes for representing a complex system\u2019s objects from state nodes for describing flows between the objects. Moreover, these so-called sparse memory networks allow the information-theoretic community detection method known as the map equation to identify overlapping and nested flow modules in data from a range of different higher-order interactions such as multistep, multi-source, and temporal data. We derive the map equation applied to sparse memory networks and describe its search algorithm Infomap, which can exploit the flexibility of sparse memory networks. Together they provide a general solution to reveal overlapping modular patterns in higher-order flows through complex systems.<\/jats:p>","DOI":"10.3390\/a10040112","type":"journal-article","created":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T13:10:05Z","timestamp":1506949805000},"page":"112","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":84,"title":["Mapping Higher-Order Network Flows in Memory and Multilayer Networks with Infomap"],"prefix":"10.3390","volume":"10","author":[{"given":"Daniel","family":"Edler","sequence":"first","affiliation":[{"name":"Integrated Science Lab, Department of Physics, Ume\u00e5 University, SE-901 87 Ume\u00e5, Sweden"}]},{"given":"Ludvig","family":"Bohlin","sequence":"additional","affiliation":[{"name":"Integrated Science Lab, Department of Physics, Ume\u00e5 University, SE-901 87 Ume\u00e5, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7181-9940","authenticated-orcid":false,"given":"Martin","family":"Rosvall","sequence":"additional","affiliation":[{"name":"Integrated Science Lab, Department of Physics, Ume\u00e5 University, SE-901 87 Ume\u00e5, Sweden"}]}],"member":"1968","published-online":{"date-parts":[[2017,9,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual Web search engine","volume":"30","author":"Brin","year":"1998","journal-title":"Comput. Netw. ISDN"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","article-title":"A measure of betweenness centrality based on random walks","volume":"27","author":"Newman","year":"2005","journal-title":"Soc. Netw."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Lordan, O., Florido, J., Sallan, J.M., Fernandez, V., Simo, P., and Gonzalez-Prieto, D. (2015). Study of the robustness of the European air routes network. LISS 2014, Springer.","DOI":"10.2139\/ssrn.2401696"},{"key":"ref_4","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":"ref_5","doi-asserted-by":"crossref","unstructured":"Belik, V., Geisel, T., and Brockmann, D. (2011). Natural human mobility patterns and spatial spread of infectious diseases. Phys. Rev. X, 1.","DOI":"10.1103\/PhysRevX.1.011001"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Pfitzner, R., Scholtes, I., Garas, A., Tessone, C.J., and Schweitzer, F. (2013). Betweenness preference: Quantifying correlations in the topological dynamics of temporal networks. Phys. Rev. Lett., 110.","DOI":"10.1103\/PhysRevLett.110.198701"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.jtbi.2013.08.032","article-title":"Human mobility and time spent at destination: Impact on spatial epidemic spreading","volume":"338","author":"Poletto","year":"2013","journal-title":"J. Theor. Biol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1126\/science.1184819","article-title":"Community structure in time-dependent, multiscale, and multiplex networks","volume":"328","author":"Mucha","year":"2010","journal-title":"Science"},{"key":"ref_9","first-page":"203","article-title":"Multilayer Networks","volume":"2","author":"Arenas","year":"2014","journal-title":"J. Comput. Netw."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2014.07.001","article-title":"The structure and dynamics of multilayer networks","volume":"544","author":"Boccaletti","year":"2014","journal-title":"Phys. Rep."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"De Domenico, M., Lancichinetti, A., Arenas, A., and Rosvall, M. (2015). Identifying modular flows on multilayer networks reveals highly overlapping organization in interconnected systems. Phys. Rev. X, 5.","DOI":"10.1103\/PhysRevX.5.011027"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","article-title":"Link communities reveal multiscale complexity in networks","volume":"466","author":"Ahn","year":"2010","journal-title":"Nature"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Peixoto, T.P., and Rosvall, M. (arXiv, 2017). Modeling sequences and temporal networks with dynamic community structures, arXiv.","DOI":"10.1038\/s41467-017-00148-9"},{"key":"ref_14","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."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Scholtes, I. (arXiv, 2017). When is a network a network? Multi-order graphical model selection in pathways and temporal networks, arXiv.","DOI":"10.1145\/3097983.3098145"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"De Domenico, M., Sol\u00e9-Ribalta, A., Cozzo, E., Kivel\u00e4, M., Moreno, Y., Porter, M.A., G\u00f3mez, S., and Arenas, A. (2013). Mathematical formulation of multilayer networks. Phys. Rev. X, 3.","DOI":"10.1103\/PhysRevX.3.041022"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Wehmuth, K., Fleury, \u00c9., and Ziviani, A. (2017). MultiAspect Graphs: Algebraic representation and algorithms. Algorithms, 10.","DOI":"10.3390\/a10010001"},{"key":"ref_18","unstructured":"Persson, C., Bohlin, L., Edler, D., and Rosvall, M. (arXiv, 2016). Maps of sparse Markov chains efficiently reveal community structure in network flows with memory, arXiv."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Albert","year":"1999","journal-title":"Science"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3747","DOI":"10.1073\/pnas.0400087101","article-title":"The architecture of complex weighted networks","volume":"101","author":"Barrat","year":"2004","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","article-title":"Complex networks: Structure and dynamics","volume":"424","author":"Boccaletti","year":"2006","journal-title":"Phys. Rep."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Lambiotte, R., and Rosvall, M. (2012). Ranking and clustering of nodes in networks with smart teleportation. Phys. Rev. E, 85.","DOI":"10.1103\/PhysRevE.85.056107"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1126\/science.1177170","article-title":"Limits of predictability in human mobility","volume":"327","author":"Song","year":"2010","journal-title":"Science"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Meiss, M.R., Menczer, F., Fortunato, S., Flammini, A., and Vespignani, A. (2008, January 11\u201312). Ranking web sites with real user traffic. Proceedings of the International Conference on Web Search and Web Data Mining, Palo Alto, CA, USA.","DOI":"10.1145\/1341531.1341543"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Raghavan, P., and Sarl\u00f3s, T. (2012, January 16\u201320). Are web users really Markovian?. Proceedings of the 21st International Conference on World Wide Web, Lyon, France.","DOI":"10.1145\/2187836.2187919"},{"key":"ref_26","unstructured":"Singer, P., Helic, D., Taraghi, B., and Strohmaier, M. (arXiv, 2014). Memory and Structure in Human Navigation Patterns, arXiv."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Takaguchi, T., Nakamura, M., Sato, N., Yano, K., and Masuda, N. (2011). Predictability of conversation partners. Phys. Rev. X, 1.","DOI":"10.1103\/PhysRevX.1.011008"},{"key":"ref_28","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":"ref_29","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","article-title":"Maps of random walks on complex networks reveal community structure","volume":"105","author":"Rosvall","year":"2008","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A Mathematical Theory of Communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Rosvall, M., and Bergstrom, C. (2011). Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. PLoS ONE, 6.","DOI":"10.1371\/journal.pone.0018209"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Kawamoto, T., and Rosvall, M. (2015). Estimating the resolution limit of the map equation in community detection. Phys. Rev. E, 91.","DOI":"10.1103\/PhysRevE.91.012809"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Bae, S.H., and Howe, B. (2015, January 15\u201320). GossipMap: A distributed community detection algorithm for billion-edge directed graphs. Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, Austin, TX, USA.","DOI":"10.1145\/2807591.2807668"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., and Lefebvre, E. (2008). Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp., 2008.","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"ref_35","unstructured":"(2017, September 01). We Have Compiled the Network from the Airline Origin and Destination Survey (DB1B), which Is a 10% Aample of Airline Tickets from Reporting Carriers Made Public by the Research and Innovative Technology Administration (RITA). Data from 2011, Available online: transtats.bts.gov."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/10\/4\/112\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:46:22Z","timestamp":1760208382000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/10\/4\/112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,30]]},"references-count":35,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,12]]}},"alternative-id":["a10040112"],"URL":"https:\/\/doi.org\/10.3390\/a10040112","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,30]]}}}