{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:09Z","timestamp":1779174789906,"version":"3.51.4"},"reference-count":75,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372112"],"award-info":[{"award-number":["62372112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872093"],"award-info":[{"award-number":["61872093"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1109\/tkde.2025.3621520","type":"journal-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T17:41:39Z","timestamp":1760463699000},"page":"235-247","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Algorithms for Computing Random Walk Centrality"],"prefix":"10.1109","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5894-3130","authenticated-orcid":false,"given":"Changan","family":"Liu","sequence":"first","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Information Processing, College of Computer Science and Artificial Intelligence, Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zixuan","family":"Xie","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Information Processing, College of Computer Science and Artificial Intelligence, Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8569-6347","authenticated-orcid":false,"given":"Ahad N.","family":"Zehmakan","sequence":"additional","affiliation":[{"name":"School of Computing, Australian National University, Canberra, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1260-2079","authenticated-orcid":false,"given":"Zhongzhi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Information Processing, College of Computer Science and Artificial Intelligence, Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.06.007"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.epidem.2019.03.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/140976649"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.17730\/humo.7.3.f4033344851gl053"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1972.9989806"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.92.118701"},{"issue":"1","key":"ref9","first-page":"1","article-title":"Random walks on graphs: A survey","volume":"2","author":"Lov\u00e1sz","year":"1993","journal-title":"Combinatorics, Paul Erd\u00f6s eighty"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.103"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.131.227101"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371777"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3708561"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3069839"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2007.01.095"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.83.046127"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2019.04.009"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0220061"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.101.062147"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591833"},{"key":"ref22","article-title":"Robust and practical solution of Laplacian equations by approximate elimination","author":"Gao","year":"2023"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000152"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3414685.3417828"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.011106"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237880"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.87.062140"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1038\/nature06201"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.065104"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/070687402"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.5948\/UPO9781614440222"},{"issue":"1","key":"ref33","first-page":"135","article-title":"Random walks and green\u2019s function on digraphs: A framework for estimating wireless transmission costs","volume":"21","author":"Y","year":"2012","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1850.39.73"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF01046996"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/47\/3\/035003"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2013.08.039"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(94)00077-Q"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492916000076"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.2002.7176"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.23919\/DATE56975.2023.10137201"},{"key":"ref42","article-title":"SPARSKIT: A basic tool kit for sparse matrix computations","author":"Saad","year":"1994","journal-title":"NASA Ames Res. Center"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827597327334"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1977-0438681-4"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.021127"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-80-04741-9"},{"key":"ref47","volume-title":"Intersections of random walks, ser. modern birkh\u00e4user classics","author":"Lawler","year":"2012"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.2307\/2282952"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583243"},{"key":"ref50","first-page":"6:1","article-title":"Approximation of the diagonal of a Laplacian\u2019s pseudoinverse for complex network analysis","volume-title":"Proc. 28th Annu. Eur. Symp. Algorithms","volume":"2020","author":"Angriman"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.08.017"},{"issue":"1","key":"ref52","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2898361","article-title":"SNAP: A general-purpose network analysis and graph-mining library","volume":"8","author":"Leskovec","year":"2016","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719628"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.2307\/2332226"},{"key":"ref55","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841677","volume-title":"Who\u2019s 1?: The science of rating and ranking","author":"Langville","year":"2012"},{"key":"ref56","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"Newman","year":"2010"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599323"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599325"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467354"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403235"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956782"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.865686"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1137\/130950550"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/2872518.2891063"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1121\/1.1906679"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974690.ch1"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13580-4_3"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(89)90016-6"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1145\/3588922"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098072"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3238841"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC61105.2024.00055"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467431"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/3654937"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11288926\/11203251.pdf?arnumber=11203251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T03:56:02Z","timestamp":1765425362000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11203251\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":75,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3621520","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]}}}