{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T23:36:57Z","timestamp":1790811417171,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1947203, IIS-2117902, and IIS-2137468"],"award-info":[{"award-number":["IIS-1947203, IIS-2117902, and IIS-2137468"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583474","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T19:30:51Z","timestamp":1682537451000},"page":"3342-3352","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Everything Evolves in Personalized PageRank"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7987-1770","authenticated-orcid":false,"given":"Zihao","family":"Li","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8726-9234","authenticated-orcid":false,"given":"Dongqi","family":"Fu","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6429-6272","authenticated-orcid":false,"given":"Jingrui","family":"He","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Aggarwal and Karthik Subbian","author":"C.","year":"2014","unstructured":"Charu\u00a0C. Aggarwal and Karthik Subbian. 2014. Evolutionary Network Analysis: A Survey. ACM Comput. Surv. (2014)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Taras Agryzkov Jos\u00e9\u00a0Luis Oliver Leandro Tortosa and Jos\u00e9-Francisco Vicent. 2012. An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector. Appl. Math. Comput. (2012).","DOI":"10.1016\/j.amc.2012.08.064"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Esteban Bautista and Matthieu Latapy. 2022. A local updating algorithm for personalized PageRank via Chebyshev polynomials. Soc. Netw. Anal. Min. (2022).","DOI":"10.1007\/s13278-022-00860-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098040"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1296951.1296957"},{"key":"e_1_3_2_1_6_1","volume-title":"DISCO: Comprehensive and Explainable Disinformation Detection. In CIKM","author":"Fu Dongqi","year":"2022","unstructured":"Dongqi Fu, Yikun Ban, Hanghang Tong, Ross Maciejewski, and Jingrui He. 2022. DISCO: Comprehensive and Explainable Disinformation Detection. In CIKM 2022."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539313"},{"key":"e_1_3_2_1_8_1","volume-title":"SDG: A Simplified and Dynamic Graph Neural Network. In SIGIR","author":"Fu Dongqi","year":"2021","unstructured":"Dongqi Fu and Jingrui He. 2021. SDG: A Simplified and Dynamic Graph Neural Network. In SIGIR 2021."},{"key":"e_1_3_2_1_9_1","volume-title":"Natural and Artificial Dynamics in Graphs: Concept, Progress, and Future. Frontiers in Big Data","author":"Fu Dongqi","year":"2022","unstructured":"Dongqi Fu and Jingrui He. 2022. Natural and Artificial Dynamics in Graphs: Concept, Progress, and Future. Frontiers in Big Data (2022)."},{"key":"e_1_3_2_1_10_1","volume-title":"Local Motif Clustering on Time-Evolving Graphs. In KDD","author":"Fu Dongqi","year":"2020","unstructured":"Dongqi Fu, Dawei Zhou, and Jingrui He. 2020. Local Motif Clustering on Time-Evolving Graphs. In KDD 2020."},{"key":"e_1_3_2_1_11_1","volume-title":"Unsupervised Graph Alignment with Wasserstein Distance Discriminator. In KDD","author":"Gao Ji","year":"2021","unstructured":"Ji Gao, Xiao Huang, and Jundong Li. 2021. Unsupervised Graph Alignment with Wasserstein Distance Discriminator. In KDD 2021."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_13_1","volume-title":"WWW","author":"Kamvar D.","year":"2003","unstructured":"Sepandar\u00a0D. Kamvar, Taher\u00a0H. Haveliwala, Christopher\u00a0D. Manning, and Gene\u00a0H. Golub. 2003. Extrapolation methods for accelerating PageRank computations. In WWW 2003."},{"key":"e_1_3_2_1_14_1","volume-title":"AURORA: Auditing PageRank on Large Graphs","author":"Kang Jian","year":"2018","unstructured":"Jian Kang, Meijia Wang, Nan Cao, Yinglong Xia, Wei Fan, and Hanghang Tong. 2018. AURORA: Auditing PageRank on Large Graphs. In IEEE BigData 2018."},{"key":"e_1_3_2_1_15_1","unstructured":"Seyed\u00a0Mehran Kazemi Rishab Goel Kshitij Jain Ivan Kobyzev Akshay Sethi Peter Forsyth and Pascal Poupart. 2020. Representation Learning for Dynamic Graphs: A Survey. J. Mach. Learn. Res. (2020)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837060.2837087"},{"key":"e_1_3_2_1_17_1","volume-title":"Network Similarity Decomposition (NSD): A Fast and Scalable Approach to Network Alignment","author":"Kollias Giorgios","year":"2012","unstructured":"Giorgios Kollias, Shahin Mohammadi, and Ananth Grama. 2012. Network Similarity Decomposition (NSD): A Fast and Scalable Approach to Network Alignment. IEEE Trans. Knowl. Data Eng. (2012)."},{"key":"e_1_3_2_1_18_1","volume-title":"BIG-ALIGN: Fast Bipartite Graph Alignment. In ICDM","author":"Koutra Danai","year":"2013","unstructured":"Danai Koutra, Hanghang Tong, and David\u00a0M. Lubensky. 2013. BIG-ALIGN: Fast Bipartite Graph Alignment. In ICDM 2013."},{"key":"e_1_3_2_1_19_1","volume-title":"Edge Weight Prediction in Weighted Signed Networks. In ICDM","author":"Kumar Srijan","year":"2016","unstructured":"Srijan Kumar, Francesca Spezzano, V.\u00a0S. Subrahmanian, and Christos Faloutsos. 2016. Edge Weight Prediction in Weighted Signed Networks. In ICDM 2016."},{"key":"e_1_3_2_1_20_1","volume-title":"WWW","author":"Kunegis J\u00e9r\u00f4me","year":"2013","unstructured":"J\u00e9r\u00f4me Kunegis. 2013. KONECT: the Koblenz network collection. In WWW 2013, Companion Volume."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739098"},{"key":"e_1_3_2_1_22_1","volume-title":"Cheetah: Fast Graph Kernel Tracking on Dynamic Graphs. In SDM","author":"Li Liangyue","year":"2015","unstructured":"Liangyue Li, Hanghang Tong, Yanghua Xiao, and Wei Fan. 2015. Cheetah: Fast Graph Kernel Tracking on Dynamic Graphs. In SDM 2015."},{"key":"e_1_3_2_1_23_1","volume-title":"Neural-Answering Logical Queries on Knowledge Graphs. In KDD","author":"Liu Lihui","year":"2021","unstructured":"Lihui Liu, Boxin Du, Heng Ji, ChengXiang Zhai, and Hanghang Tong. 2021. Neural-Answering Logical Queries on Knowledge Graphs. In KDD 2021."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482317"},{"key":"e_1_3_2_1_25_1","volume-title":"Efficient PageRank Tracking in Evolving Networks. In KDD","author":"Ohsaka Naoto","year":"2015","unstructured":"Naoto Ohsaka, Takanori Maehara, and Ken-ichi Kawarabayashi. 2015. Efficient PageRank Tracking in Evolving Networks. In KDD 2015."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2952653"},{"key":"e_1_3_2_1_28_1","volume-title":"Piegorsch and George Casella","author":"W.","year":"1990","unstructured":"Walter\u00a0W. Piegorsch and George Casella. 1990. Erratum: Inverting a Sum of Matrices. SIAM Rev. (1990)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3172867"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-020-00232-2"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46227-1_42"},{"key":"e_1_3_2_1_32_1","volume-title":"Fast Random Walk with Restart and Its Applications. In ICDM","author":"Tong Hanghang","year":"2006","unstructured":"Hanghang Tong, Christos Faloutsos, and Jia-Yu Pan. 2006. Fast Random Walk with Restart and Its Applications. In ICDM 2006."},{"key":"e_1_3_2_1_33_1","volume-title":"Proximity Tracking on Time-Evolving Bipartite Graphs. In SDM","author":"Tong Hanghang","year":"2008","unstructured":"Hanghang Tong, Spiros Papadimitriou, Philip\u00a0S. Yu, and Christos Faloutsos. 2008. Proximity Tracking on Time-Evolving Bipartite Graphs. In SDM 2008."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2017.2740381"},{"key":"e_1_3_2_1_35_1","volume-title":"ImVerde: Vertex-Diminished Random Walk for Learning Imbalanced Network Representation","author":"Wu Jun","year":"2018","unstructured":"Jun Wu, Jingrui He, and Yongming Liu. 2018. ImVerde: Vertex-Diminished Random Walk for Learning Imbalanced Network Representation. In IEEE BigData 2018."},{"key":"e_1_3_2_1_36_1","volume-title":"Dynamic Knowledge Graph Alignment. In AAAI","author":"Yan Yuchen","year":"2021","unstructured":"Yuchen Yan, Lihui Liu, Yikun Ban, Baoyu Jing, and Hanghang Tong. 2021. Dynamic Knowledge Graph Alignment. In AAAI 2021."},{"key":"e_1_3_2_1_37_1","volume-title":"BRIGHT: A Bridging Algorithm for Network Alignment. In WWW","author":"Yan Yuchen","year":"2021","unstructured":"Yuchen Yan, Si Zhang, and Hanghang Tong. 2021. BRIGHT: A Bridging Algorithm for Network Alignment. In WWW 2021."},{"key":"e_1_3_2_1_38_1","volume-title":"Dissecting Cross-Layer Dependency Inference on Multi-Layered Inter-Dependent Networks. In CIKM","author":"Yan Yuchen","year":"2022","unstructured":"Yuchen Yan, Qinghai Zhou, Jinning Li, Tarek\u00a0F. Abdelzaher, and Hanghang Tong. 2022. Dissecting Cross-Layer Dependency Inference on Multi-Layered Inter-Dependent Networks. In CIKM 2022."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2012.2191963"},{"key":"e_1_3_2_1_40_1","volume-title":"Local Higher-Order Graph Clustering. In KDD","author":"Yin Hao","year":"2017","unstructured":"Hao Yin, Austin\u00a0R. Benson, Jure Leskovec, and David\u00a0F. Gleich. 2017. Local Higher-Order Graph Clustering. In KDD 2017."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330946"},{"key":"e_1_3_2_1_42_1","volume-title":"Fast and Accurate Random Walk with Restart on Dynamic Graphs with Guarantees. In WWW","author":"Yoon Minji","year":"2018","unstructured":"Minji Yoon, Woojeong Jin, and U Kang. 2018. Fast and Accurate Random Walk with Restart on Dynamic Graphs with Guarantees. In WWW 2018."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00105"},{"key":"e_1_3_2_1_44_1","volume-title":"Approximate Personalized PageRank on Dynamic Graphs. In KDD","author":"Zhang Hongyang","year":"2016","unstructured":"Hongyang Zhang, Peter Lofgren, and Ashish Goel. 2016. Approximate Personalized PageRank on Dynamic Graphs. In KDD 2016."},{"key":"e_1_3_2_1_45_1","volume-title":"Multiple Anonymized Social Networks Alignment. In ICDM","author":"Zhang Jiawei","year":"2015","unstructured":"Jiawei Zhang and Philip\u00a0S. Yu. 2015. Multiple Anonymized Social Networks Alignment. In ICDM 2015."},{"key":"e_1_3_2_1_46_1","volume-title":"FINAL: Fast Attributed Network Alignment. In KDD","author":"Zhang Si","year":"2016","unstructured":"Si Zhang and Hanghang Tong. 2016. FINAL: Fast Attributed Network Alignment. In KDD 2016."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3384203"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783268"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098015"},{"key":"e_1_3_2_1_50_1","volume-title":"Attent: Active Attributed Network Alignment. In WWW","author":"Zhou Qinghai","year":"2021","unstructured":"Qinghai Zhou, Liangyue Li, Xintao Wu, Nan Cao, Lei Ying, and Hanghang Tong. 2021. Attent: Active Attributed Network Alignment. In WWW 2021."}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583474","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3543507.3583474","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583474","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T12:47:53Z","timestamp":1750164473000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":50,"alternative-id":["10.1145\/3543507.3583474","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583474","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}