{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:34:17Z","timestamp":1772120057963,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"International Center for Research and Postgraduate Training in Mathematics","award":["ICRTM04-2021.01."],"award-info":[{"award-number":["ICRTM04-2021.01."]}]},{"name":"International Center for Research and Postgraduate Training in Mathematics","award":["ICRTM04-2021.01."],"award-info":[{"award-number":["ICRTM04-2021.01."]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"DOI":"10.1007\/s13278-023-01080-1","type":"journal-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T13:03:32Z","timestamp":1682514212000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Community detection in directed graphs using stationary distribution and hitting times methods"],"prefix":"10.1007","volume":"13","author":[{"given":"Tien Dat","family":"Dang","sequence":"first","affiliation":[]},{"given":"Duy Hieu","family":"Do","sequence":"additional","affiliation":[]},{"given":"Thi Ha Duong","family":"Phan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,26]]},"reference":[{"key":"1080_CR1","doi-asserted-by":"crossref","unstructured":"Adamic LA, Glance N (2005) The political blogosphere and the 2004 US Election. In: Proceedings of the WWW-2005 workshop on the weblogging ecosystem","DOI":"10.1145\/1134271.1134277"},{"issue":"1815","key":"1080_CR2","doi-asserted-by":"publisher","first-page":"20151429","DOI":"10.1098\/rspb.2015.1429","volume":"282","author":"JS Adelman","year":"2015","unstructured":"Adelman JS, Moyers SC, Farine DR, Hawley DM (2015) Feeder use predicts both acquisition and transmission of a contagious pathogen in a North American songbird. Proc R Soc B 282(1815):20151429","journal-title":"Proc R Soc B"},{"issue":"6","key":"1080_CR3","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1088\/1367-2630\/9\/6\/176","volume":"9","author":"A Arenas","year":"2007","unstructured":"Arenas A, Duch J, Fern\u00e1ndez A, G\u00f3mez S (2007) Size reduction of complex networks preserving modularity. New J Phys 9(6):176","journal-title":"New J Phys"},{"key":"1080_CR4","unstructured":"Aldenderfer MS, Blashfleld RK (1984) Cluster Analysis. Number 07-044 in Sage University Paper Series on Quantitative Applications in the Social Sciences. Sage, Beverly Hills"},{"issue":"42","key":"1080_CR5","doi-asserted-by":"publisher","first-page":"046108","DOI":"10.1103\/PhysRevE.72.046108","volume":"72","author":"J Bagrow","year":"2005","unstructured":"Bagrow J, Bollt E (2005) A local method for detecting communities. Phys Rev E 72(42):046108","journal-title":"Phys Rev E"},{"key":"1080_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45982-6","volume-title":"Markov chains: Gibbs fields, Monte Carlo simulation and queues (Texts in applied mathematics)","author":"P Bremaud","year":"2020","unstructured":"Bremaud P (2020) Markov chains: Gibbs fields, Monte Carlo simulation and queues (Texts in applied mathematics), 2nd edn. Springer, Berlin","edition":"2"},{"issue":"1\u20137","key":"1080_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"issue":"2\u20134","key":"1080_CR8","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.physa.2004.12.050","volume":"352","author":"A Capoccia","year":"2005","unstructured":"Capoccia A, Servedioa VDP, Caldarellia G, Colaiori F (2005) Detecting communities in large networks. Phys Stat Mech Appl 352(2\u20134):669\u2013676","journal-title":"Phys Stat Mech Appl"},{"key":"1080_CR9","unstructured":"Chung F (1997) Spectral graph theory. American Mathematical Society. ISBN 978-0821803158. [1992]"},{"key":"1080_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-005-0237-z","volume":"9","author":"F Chung","year":"2005","unstructured":"Chung F (2005) Laplacians and the Cheeger inequality for directed graphs. Ann Comb 9:1\u201319","journal-title":"Ann Comb"},{"key":"1080_CR11","unstructured":"Costa L da F (2004) Hub-based community flnding, arXiv:cond-mat\/0405022"},{"key":"1080_CR12","doi-asserted-by":"crossref","unstructured":"Cohen MB, Kelner J, Peebles J, Peng R, Sidford A, Vladu A (2016) Faster algorithms for computing the stationary distribution, simulating random walks, and more. In: Annual IEEE symposium on foundations of computer science, pp 583\u2013592","DOI":"10.1109\/FOCS.2016.69"},{"key":"1080_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.026132","volume":"72","author":"A Clauset","year":"2005","unstructured":"Clauset A (2005) Finding local community structure in networks. Phys Rev E 72:026132","journal-title":"Phys Rev E"},{"key":"1080_CR14","doi-asserted-by":"publisher","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:066111","journal-title":"Phys Rev E"},{"key":"1080_CR43","unstructured":"Data website: http:\/\/www-personal.umich.edu\/~mejn\/netdata\/"},{"key":"1080_CR15","unstructured":"Dongen SV (2000) Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht"},{"issue":"29","key":"1080_CR16","doi-asserted-by":"publisher","first-page":"12755","DOI":"10.1073\/pnas.0903215107","volume":"107","author":"JC Delvenne","year":"2010","unstructured":"Delvenne JC, Yaliraki SN, Barahona M (2010) Stability of graph communities across time scales. Proc Natl Acad Sci U S A. 107(29):12755\u201360. https:\/\/doi.org\/10.1073\/pnas.0903215107. (Epub 2010 Jun 30. PMID: 20615936; PMCID: PMC2919907)","journal-title":"Proc Natl Acad Sci U S A."},{"key":"1080_CR17","unstructured":"Dugu\u00e9 N, Perez A (2015) Directed Louvain: maximizing modularity in directed networks. [Research Report] Universit\u00e9 d\u2019Orl\u00e9ans"},{"key":"1080_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.102.052135","volume":"102","author":"L Enzhi","year":"2020","unstructured":"Enzhi L, Zhengyi L (2020) Frustrated random walks: a faster algorithm to evaluate node distances on connected and undirected graphs. Phys Rev E 102:052135","journal-title":"Phys Rev E"},{"key":"1080_CR19","volume-title":"Cluster analysis","author":"BS Everitt","year":"2001","unstructured":"Everitt BS, Landau S, Leese M (2001) Cluster analysis, 4th edn. Hodder Arnold, London","edition":"4"},{"key":"1080_CR20","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:75\u2013174","journal-title":"Phys Rep"},{"key":"1080_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J Classif 2:193\u2013218","journal-title":"J Classif"},{"issue":"2","key":"1080_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1111\/j.1469-8137.1912.tb05611.x","volume":"11","author":"P Jaccard","year":"1912","unstructured":"Jaccard P (1912) The Distribution of the Flora in the Alpine Zone. New Phytol 11(2):37\u201350","journal-title":"New Phytol"},{"key":"1080_CR23","unstructured":"Khan BS, Niazi MA (2017) Network community detection: a review and visual survey. arXiv preprint arXiv:1708.00977"},{"key":"1080_CR24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.066122","volume":"84","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti A, Fortunato S (2011) Limits of modularity maximization in community detection. Phys Rev E 84:066122","journal-title":"Phys Rev E"},{"key":"1080_CR25","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1016\/j.physa.2010.02.014","volume":"389","author":"D Lai","year":"2010","unstructured":"Lai D, Lu H, Nardini C (2010) Finding communities in directed networks by pagerank random walk induced network embedding. Phys A 389:2443\u20132454","journal-title":"Phys A"},{"key":"1080_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.118703","volume":"100","author":"EA Leicht","year":"2008","unstructured":"Leicht EA, Newman MEJ (2008) Community structure in directed networks. Phys Rev Lett 100:118703","journal-title":"Phys Rev Lett"},{"key":"1080_CR27","unstructured":"Moore C (2017) The computer science and physics of community detection: landscapes, phase transitions, and hardness. Bull. EATCS 121"},{"key":"1080_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.042822","volume":"88","author":"MEJ Newman","year":"2013","unstructured":"Newman MEJ (2013) Spectral methods for network community detection and graph partitioning. Phys Rev E 88:042822","journal-title":"Phys Rev E"},{"key":"1080_CR29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:036104","journal-title":"Phys Rev E"},{"key":"1080_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69:066133","journal-title":"Phys Rev E"},{"key":"1080_CR31","first-page":"026","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026\u2013113","journal-title":"Phys Rev E"},{"key":"1080_CR32","unstructured":"Page L, Brin S, Motwani R, Winograd T (1998) The pagerank citation ranking: bringing order to the web. In: WWW \u201998: Proceedings of the 7th international world wide web conference, pp 161\u2013172"},{"key":"1080_CR44","unstructured":"Physicians network dataset\u2014KONECT, http:\/\/konect.cc\/networks\/maayan-Stelzl\/"},{"key":"1080_CR46","unstructured":"Physicians network dataset\u2014KONECT, http:\/\/konect.cc\/networks\/moreno_innovation"},{"issue":"2","key":"1080_CR33","doi-asserted-by":"publisher","first-page":"191","DOI":"10.7155\/jgaa.00124","volume":"10","author":"P Pons","year":"2006","unstructured":"Pons P, Latapy M (2006) Computing communities in large networks using random walks. J Graph Algorithms Appl 10(2):191\u2013218","journal-title":"J Graph Algorithms Appl"},{"key":"1080_CR34","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66:846\u2013850","journal-title":"J Am Stat Assoc"},{"key":"1080_CR35","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.218701","volume":"93","author":"J Reichardt","year":"2004","unstructured":"Reichardt J, Bornholdt S (2004) Detecting fuzzy community structures in complex networks with a potts model. Phys Rev Lett 93:218701","journal-title":"Phys Rev Lett"},{"key":"1080_CR36","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization, AAAI, https:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"1080_CR37","doi-asserted-by":"crossref","unstructured":"Satuluri V, Parthasarathy S (2011) Symmetrizations for clustering directed graphs. In: EDBT \u201911: Proceedings of the 14th international conference on extending database technology, pp 343\u2013354","DOI":"10.1145\/1951365.1951407"},{"key":"1080_CR45","unstructured":"Stanford Large Network Dataset Collection website: https:\/\/snap.stanford.edu\/data\/email-Eu-core.html"},{"issue":"2","key":"1080_CR38","first-page":"183","volume":"17","author":"C Takacs","year":"2006","unstructured":"Takacs C (2006) On the fundamental matrix of finite state Markov chains, its eigensystem and its relation to hitting times. Math Pannon 17(2):183\u2013193","journal-title":"Math Pannon"},{"key":"1080_CR39","unstructured":"Tanimoto TT (1958) An elementary mathematical theory of classification and prediction. Internal IBM Technical Report"},{"issue":"4","key":"1080_CR40","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1080\/15427951.2012.708890","volume":"8","author":"L Yanhua","year":"2012","unstructured":"Yanhua L, Zhang ZL (2012) Digraph Laplacian and the degree of asymmetry. Internet Math 8(4):381\u2013401","journal-title":"Internet Math"},{"key":"1080_CR41","first-page":"1","volume":"21","author":"Z Wang","year":"2020","unstructured":"Wang Z, Liang Y, Ji P (2020) Spectral algorithms for community detection in directed networks. J Mach Learn Res 21:1\u201345","journal-title":"J Mach Learn Res"},{"key":"1080_CR42","doi-asserted-by":"crossref","unstructured":"Watts DJ, Strogatz SH (1998) Nature 393:440\u2013442. Original experimental data taken from J. G. White, E. Southgate, J. N. Thompson, and S. Brenner, Phil. Trans. R. Soc. London 314:1\u2013340 (1986)","DOI":"10.1038\/30918"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-023-01080-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-023-01080-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-023-01080-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T16:35:54Z","timestamp":1702571754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-023-01080-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":46,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["1080"],"URL":"https:\/\/doi.org\/10.1007\/s13278-023-01080-1","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1916016\/v1","asserted-by":"object"}]},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,26]]},"assertion":[{"value":"1 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":4,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"80"}}