{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T01:03:16Z","timestamp":1769562196392,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["824115"],"award-info":[{"award-number":["824115"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004955","name":"\u00d6sterreichische Forschungsf\u00f6rderungsgesellschaft","doi-asserted-by":"publisher","award":["COMET"],"award-info":[{"award-number":["COMET"]}],"id":[{"id":"10.13039\/501100004955","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Complex systems, abstractly represented as networks, are ubiquitous in everyday life. Analyzing and understanding these systems requires, among others, tools for community detection. As no single best community detection algorithm can exist, robustness across a wide variety of problem settings is desirable. In this work, we present Synwalk, a random walk-based community detection method. Synwalk builds upon a solid theoretical basis and detects communities by synthesizing the random walk induced by the given network from a class of candidate random walks. We thoroughly validate the effectiveness of our approach on synthetic and empirical networks, respectively, and compare Synwalk\u2019s performance with the performance of Infomap and Walktrap (also random walk-based), Louvain (based on modularity maximization) and stochastic block model inference. Our results indicate that Synwalk performs robustly on networks with varying mixing parameters and degree distributions. We outperform Infomap on networks with high mixing parameter, and Infomap and Walktrap on networks with many small communities and low average degree. Our work has a potential to inspire further development of community detection via synthesis of random walks and we provide concrete ideas for future research.<\/jats:p>","DOI":"10.1007\/s10618-021-00809-w","type":"journal-article","created":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T08:02:52Z","timestamp":1641801772000},"page":"739-780","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Synwalk: community detection via random walk modelling"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0552-2874","authenticated-orcid":false,"given":"Christian","family":"Toth","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0725-7450","authenticated-orcid":false,"given":"Denis","family":"Helic","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3257-743X","authenticated-orcid":false,"given":"Bernhard C.","family":"Geiger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,10]]},"reference":[{"issue":"7","key":"809_CR1","doi-asserted-by":"publisher","first-page":"3068","DOI":"10.1109\/TAC.2019.2945891","volume":"65","author":"RA Amjad","year":"2020","unstructured":"Amjad RA, Blochl C, Geiger BC (2020) A generalized framework for Kullback\u2013Leibler Markov aggregation. IEEE Trans Autom Control 65(7):3068\u20133075. https:\/\/doi.org\/10.1109\/TAC.2019.2945891","journal-title":"IEEE Trans Autom Control"},{"key":"809_CR2","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 10:P10008. https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"J Stat Mech Theory Exp"},{"issue":"2","key":"809_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M, Nikoloski Z, Wagner D (2008) On modularity clustering. IEEE Trans Knowl Data Eng 20(2):172\u2013188. https:\/\/doi.org\/10.1109\/TKDE.2007.190689","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"809_CR4","doi-asserted-by":"crossref","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. In: Seventh International World-Wide Web Conference (WWW 1998)","DOI":"10.1016\/S0169-7552(98)00110-X"},{"issue":"6","key":"809_CR5","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111. https:\/\/doi.org\/10.1103\/PhysRevE.70.066111","journal-title":"Phys Rev E"},{"key":"809_CR6","volume-title":"Elements of information theory (Wiley series in telecommunications and signal processing)","author":"TM Cover","year":"2006","unstructured":"Cover TM, Thomas JA (2006) Elements of information theory (Wiley series in telecommunications and signal processing), 2nd edn. Wiley-Interscience, New York","edition":"2"},{"key":"809_CR7","first-page":"1","volume":"1695","author":"G Csardi","year":"2006","unstructured":"Csardi G, Nepusz T (2006) The igraph software package for complex network research. InterJournal Complex Syst 1695:1\u20139","journal-title":"InterJournal Complex Syst"},{"issue":"12","key":"809_CR8","doi-asserted-by":"publisher","first-page":"2793","DOI":"10.1109\/TAC.2011.2141350","volume":"56","author":"K Deng","year":"2011","unstructured":"Deng K, Mehta PG, Meyn SP (2011) Optimal Kullback\u2013Leibler aggregation via spectral theory of Markov chains. IEEE Trans Autom Control 56(12):2793\u20132808. https:\/\/doi.org\/10.1109\/TAC.2011.2141350","journal-title":"IEEE Trans Autom Control"},{"key":"809_CR9","doi-asserted-by":"crossref","unstructured":"Faccin M, Schaub MT, Delvenne JC (2020) State aggregations in Markov chains and block models of networks. arXiv:2005.00337 [physics.soc-ph]","DOI":"10.1103\/PhysRevLett.127.078301"},{"key":"809_CR10","volume-title":"WordNet: an electronic lexical database","year":"1998","unstructured":"Fellbaum C (ed) (1998) WordNet: an electronic lexical database. MIT Press, Cambridge"},{"issue":"3\u20135","key":"809_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174. https:\/\/doi.org\/10.1016\/j.physrep.2009.11.002","journal-title":"Phys Rep"},{"key":"809_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659:1\u201344. https:\/\/doi.org\/10.1016\/j.physrep.2016.09.002","journal-title":"Phys Rep"},{"key":"809_CR13","doi-asserted-by":"publisher","unstructured":"Ghasemi M, Hashemi A, Vikalo H, Topcu U (2020) Identifying sparse low-dimensional structures in Markov chains: a nonnegative matrix factorization approach. In: American Control Conf. (ACC), pp 1093\u20131098. https:\/\/doi.org\/10.23919\/ACC45564.2020.9147586","DOI":"10.23919\/ACC45564.2020.9147586"},{"issue":"12","key":"809_CR14","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826. https:\/\/doi.org\/10.1073\/pnas.122653799","journal-title":"Proc Natl Acad Sci"},{"key":"809_CR15","doi-asserted-by":"publisher","unstructured":"Hurley N, Duriakova E (2015) Reformulations of the map equation for community finding and blockmodelling. In: Proc. IEEE\/ACM Int. Conf. on Advances in Social Networks Analysis and Mining (ASONAM), Paris, France, pp 1606\u20131607. https:\/\/doi.org\/10.1145\/2808797.2809356","DOI":"10.1145\/2808797.2809356"},{"key":"809_CR16","doi-asserted-by":"publisher","unstructured":"Hurley N, Duriakova E (2016) An information theoretic approach to generalised blockmodelling for the identification of meso-scale structure in networks. In: Proc. IEEE\/ACM Int. Conf. on Advances in Social Networks Analysis and Mining (ASONAM), San Francisco, CA, pp 319\u2013322. https:\/\/doi.org\/10.1109\/ASONAM.2016.7752252","DOI":"10.1109\/ASONAM.2016.7752252"},{"issue":"3","key":"809_CR17","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1109\/18.256516","volume":"39","author":"G Kesidis","year":"1993","unstructured":"Kesidis G, Walrand J (1993) Relative entropy between Markov transition rate matrices. IEEE Trans Inf Theory 39(3):1056\u20131057. https:\/\/doi.org\/10.1109\/18.256516","journal-title":"IEEE Trans Inf Theory"},{"key":"809_CR18","doi-asserted-by":"publisher","unstructured":"Kunegis J (2013) KONECT. In: Proc. Int. Conf. on World Wide Web\u2014WWW \u201913 Companion, New York, NY, USA, pp 1343\u20131350. https:\/\/doi.org\/10.1145\/2487788.2488173","DOI":"10.1145\/2487788.2488173"},{"issue":"2","key":"809_CR19","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/TNSE.2015.2391998","volume":"1","author":"R Lambiotte","year":"2014","unstructured":"Lambiotte R, Delvenne JC, Barahona M (2014) Random walks, Markov processes and the multiscale modular organization of complex networks. IEEE Trans Netw Sci Eng 1(2):76\u201390. https:\/\/doi.org\/10.1109\/TNSE.2015.2391998","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"1","key":"809_CR20","doi-asserted-by":"publisher","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S (2009a) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80(1):016118. https:\/\/doi.org\/10.1103\/PhysRevE.80.016118","journal-title":"Phys Rev E"},{"issue":"5","key":"809_CR21","doi-asserted-by":"publisher","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S (2009b) Community detection algorithms: a comparative analysis. Phys Rev E 80(5):056117. https:\/\/doi.org\/10.1103\/PhysRevE.80.056117","journal-title":"Phys Rev E"},{"issue":"4","key":"809_CR22","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110. https:\/\/doi.org\/10.1103\/PhysRevE.78.046110","journal-title":"Phys Rev E"},{"key":"809_CR23","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"issue":"1","key":"809_CR24","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2008","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2008) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123","journal-title":"Internet Math"},{"key":"809_CR25","doi-asserted-by":"publisher","unstructured":"Leskovec J, Lang KJ, Mahoney M (2010) Empirical comparison of algorithms for network community detection. In: Proc. Int. Conf. on World Wide Web\u2014WWW \u201910, New York, NY, USA, p 631. https:\/\/doi.org\/10.1145\/1772690.1772755","DOI":"10.1145\/1772690.1772755"},{"key":"809_CR26","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. https:\/\/doi.org\/10.1016\/j.physrep.2017.07.007","journal-title":"Phys Rep"},{"issue":"23","key":"809_CR27","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582. https:\/\/doi.org\/10.1073\/pnas.0601602103","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"809_CR28","doi-asserted-by":"publisher","first-page":"026113","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 E 69(2):026113. https:\/\/doi.org\/10.1103\/PhysRevE.69.026113","journal-title":"Phys Rev E"},{"key":"809_CR29","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-04747-3_20","volume-title":"Discovery science","author":"GK Orman","year":"2009","unstructured":"Orman GK, Labatut V (2009) A comparison of community detection algorithms on artificial networks. In: Gama J, Costa VS, Jorge AM, Brazdil PB (eds) Discovery science. Springer, Berlin, pp 242\u2013256"},{"issue":"5","key":"809_CR30","doi-asserted-by":"publisher","first-page":"e1602548","DOI":"10.1126\/sciadv.1602548","volume":"3","author":"L Peel","year":"2017","unstructured":"Peel L, Larremore DB, Clauset A (2017) The ground truth about metadata and community detection in networks. Sci Adv 3(5):e1602548. https:\/\/doi.org\/10.1126\/sciadv.1602548","journal-title":"Sci Adv"},{"issue":"1","key":"809_CR31","doi-asserted-by":"publisher","first-page":"012804","DOI":"10.1103\/PhysRevE.89.012804","volume":"89","author":"TP Peixoto","year":"2014","unstructured":"Peixoto TP (2014a) Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models. Phys Rev E 89(1):012804. https:\/\/doi.org\/10.1103\/PhysRevE.89.012804","journal-title":"Phys Rev E"},{"key":"809_CR32","doi-asserted-by":"publisher","DOI":"10.6084\/m9.figshare.1164194","author":"TP Peixoto","year":"2014","unstructured":"Peixoto TP (2014b) The graph-tool python library. figshare. https:\/\/doi.org\/10.6084\/m9.figshare.1164194","journal-title":"figshare"},{"issue":"582","key":"809_CR33","first-page":"1","volume":"8","author":"TP Peixoto","year":"2017","unstructured":"Peixoto TP, Rosvall M (2017) Modelling sequences and temporal networks with dynamic community structures. Nat Commun 8(582):1\u201312","journal-title":"Nat Commun"},{"issue":"11","key":"809_CR34","doi-asserted-by":"publisher","first-page":"27028","DOI":"10.1371\/journal.pone.0027028","volume":"6","author":"C Piccardi","year":"2011","unstructured":"Piccardi C (2011) Finding and testing network communities by lumped Markov chains. PLoS ONE 6(11):27028. https:\/\/doi.org\/10.1371\/journal.pone.0027028","journal-title":"PLoS ONE"},{"key":"809_CR35","doi-asserted-by":"publisher","unstructured":"Pons P, Latapy M (2005) In: Yolum P, G\u00fcng\u00f6r T, G\u00fcrgen F, \u00d6zturan C (ed) Computing communities in large networks using random walks. Computer and Information Sciences, ISCIS, Istanbul, Turkey. https:\/\/doi.org\/10.1007\/11569596_31","DOI":"10.1007\/11569596_31"},{"issue":"5","key":"809_CR36","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/TIT.2004.826687","volume":"50","author":"Z Rached","year":"2004","unstructured":"Rached Z, Alajaji F, Campbell L (2004) The Kullback\u2013Leibler divergence rate between Markov sources. IEEE Trans Inf Theory 50(5):917\u2013921. https:\/\/doi.org\/10.1109\/TIT.2004.826687","journal-title":"IEEE Trans Inf Theory"},{"issue":"9","key":"809_CR37","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F Radicchi","year":"2004","unstructured":"Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D, Paris D (2004) Defining and identifying communities in networks. Proc Natl Acad Sci 101(9):2658\u20132663. https:\/\/doi.org\/10.1073\/pnas.0400054101","journal-title":"Proc Natl Acad Sci"},{"key":"809_CR38","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76:036106. https:\/\/doi.org\/10.1103\/PhysRevE.76.036106","journal-title":"Phys Rev E"},{"key":"809_CR39","doi-asserted-by":"publisher","first-page":"016110","DOI":"10.1103\/PhysRevE.74.016110","volume":"74","author":"J Reichardt","year":"2006","unstructured":"Reichardt J, Bornholdt S (2006) Statistical mechanics of community detection. Phys Rev E 74:016110. https:\/\/doi.org\/10.1103\/PhysRevE.74.016110","journal-title":"Phys Rev E"},{"issue":"4","key":"809_CR40","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118\u20131123. https:\/\/doi.org\/10.1073\/pnas.0706851105","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"809_CR41","doi-asserted-by":"publisher","first-page":"e8694","DOI":"10.1371\/journal.pone.0008694","volume":"5","author":"M Rosvall","year":"2010","unstructured":"Rosvall M, Bergstrom CT (2010) Mapping change in large networks. PLoS ONE 5(1):e8694. https:\/\/doi.org\/10.1371\/journal.pone.0008694","journal-title":"PLoS ONE"},{"issue":"1","key":"809_CR42","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall M, Axelsson D, Bergstrom CT (2009) The map equation. Eur Phys J Spec Top 178(1):13\u201323. https:\/\/doi.org\/10.1140\/epjst\/e2010-01179-1","journal-title":"Eur Phys J Spec Top"},{"key":"809_CR43","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/9781119483298.ch4","volume-title":"Advances in network clustering and blockmodeling","author":"M Rosvall","year":"2019","unstructured":"Rosvall M, Delvenne JC, Schaub MT, Lambiotte R (2019) Different approaches to community detection. In: Doreian P, Batagelj V, Ferligoj A (eds) Advances in network clustering and blockmodeling. Wiley, Hoboken, pp 105\u2013119. https:\/\/doi.org\/10.1002\/9781119483298.ch4"},{"key":"809_CR44","doi-asserted-by":"publisher","unstructured":"Rozemberczki B, Sarkar R (2020) Characteristic functions on graphs: birds of a feather, fromstatistical descriptors to parametric models. In: d\u2019Aquin M, Dietze S, Hauff C, Curry E, Cudr\u00e9-Mauroux P (eds) CIKM \u201920: the 29th ACM Int. Conf. on Information and Knowledge Management, Virtual Event, Ireland, pp 1325\u20131334. https:\/\/doi.org\/10.1145\/3340531.3411866","DOI":"10.1145\/3340531.3411866"},{"key":"809_CR45","unstructured":"Rozemberczki B, Allen C, Sarkar R (2019) Multi-scale attributed node embedding. CoRR, arXiv:1909.13021"},{"key":"809_CR46","doi-asserted-by":"publisher","unstructured":"Toth C (2020) Synthesizing Infomap. Master\u2019s thesis, Graz University of Technology. https:\/\/doi.org\/10.5281\/zenodo.4446856","DOI":"10.5281\/zenodo.4446856"},{"key":"809_CR47","doi-asserted-by":"publisher","unstructured":"Toth C (2021) A collection of LFR benchmark graphs. https:\/\/doi.org\/10.5281\/zenodo.4450167","DOI":"10.5281\/zenodo.4450167"},{"key":"809_CR48","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh NX, Epps J, Bailey J (2010) Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J Mach Learn Res 11:2837\u20132854","journal-title":"J Mach Learn Res"},{"issue":"1","key":"809_CR49","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213. https:\/\/doi.org\/10.1007\/s10115-013-0693-z","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"809_CR50","doi-asserted-by":"publisher","first-page":"30750","DOI":"10.1038\/srep30750","volume":"6","author":"Z Yang","year":"2016","unstructured":"Yang Z, Algesheimer R, Tessone CJ (2016) A comparative analysis of community detection algorithms on artificial networks. Sci Rep 6(1):30750. https:\/\/doi.org\/10.1038\/srep30750","journal-title":"Sci Rep"},{"issue":"5","key":"809_CR51","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1109\/TIT.2019.2956737","volume":"66","author":"A Zhang","year":"2020","unstructured":"Zhang A, Wang M (2020) Spectral state compression of Markov processes. IEEE Trans Inf Theory 66(5):3202\u20133231","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00809-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-021-00809-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00809-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T09:56:21Z","timestamp":1648547781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-021-00809-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,10]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["809"],"URL":"https:\/\/doi.org\/10.1007\/s10618-021-00809-w","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,10]]},"assertion":[{"value":"22 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","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 have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The implementation of our community detection method is available at . The source code of our evaluation framework is available at .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}