{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/faster-local-solvers-for-graph-diffusion","title":"Faster Local Solvers for Graph Diffusion Equations","arxiv_id":"2410.21634","date":"2024-10-29","proceeding":null,"authors":["Jiahe Bai","Baojian Zhou","Deqing Yang","Yanghua Xiao"],"abstract":"Efficient computation of graph diffusion equations (GDEs), such as Personalized PageRank, Katz centrality, and the Heat kernel, is crucial for clustering, training neural networks, and many other graph-related problems. Standard iterative methods require accessing the whole graph per iteration, making them time-consuming for large-scale graphs. While existing local solvers approximate diffusion vectors through heuristic local updates, they often operate sequentially and are typically designed for specific diffusion types, limiting their applicability. Given that diffusion vectors are highly localizable, as measured by the participation ratio, this paper introduces a novel framework for approximately solving GDEs using a local diffusion process. This framework reveals the suboptimality of existing local solvers. Furthermore, our approach effectively localizes standard iterative solvers by designing simple and provably sublinear time algorithms. These new local solvers are highly parallelizable, making them well-suited for implementation on GPUs. We demonstrate the effectiveness of our framework in quickly obtaining approximate diffusion vectors, achieving up to a hundred-fold speed improvement, and its applicability to large-scale dynamic graphs. Our framework could also facilitate more efficient local message-passing mechanisms for GNNs.","url_abs":"https://arxiv.org/abs/2410.21634v2","url_pdf":"https://arxiv.org/pdf/2410.21634v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"faster-local-solvers-for-graph-diffusion","repo_url":"https://github.com/JiaheBai/Faster-Local-Solver-for-GDEs","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[],"methods":[{"method_slug":"diffusion","method_name":"Diffusion"},{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2410.21634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.21634"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/JiaheBai/Faster-Local-Solver-for-GDEs","reach":{"status":"ok"}},{"provenance":"deterministic:regex_extraction","url":"https://github.com/abojchevski/graph2gauss","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":4},"by_repo_kind":{"official":{"samples":1,"ran":0,"repositories":1},"found_in_text":{"samples":3,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"samples":[{"code_sha256_prefix":"feb6742d4641ac10","entry":"edges_to_sparse","repo":"abojchevski/graph2gauss","repo_kind":"found_in_text","path":"g2g/utils.py","file_url":"https://github.com/abojchevski/graph2gauss/blob/HEAD/g2g/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"feb6742d4641ac10"}},{"code_sha256_prefix":"d0cc99c95ce94209","entry":"kruskal","repo":"JiaheBai/Faster-Local-Solver-for-GDEs","repo_kind":"official","path":"data_process_GNN.py","file_url":"https://github.com/JiaheBai/Faster-Local-Solver-for-GDEs/blob/HEAD/data_process_GNN.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d0cc99c95ce94209"}},{"code_sha256_prefix":"405a37ffff492489","entry":"sparse_feeder","repo":"abojchevski/graph2gauss","repo_kind":"found_in_text","path":"g2g/utils.py","file_url":"https://github.com/abojchevski/graph2gauss/blob/HEAD/g2g/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"405a37ffff492489"}},{"code_sha256_prefix":"020409818ff0d1c7","entry":"train_val_test_split_adjacency","repo":"abojchevski/graph2gauss","repo_kind":"found_in_text","path":"g2g/utils.py","file_url":"https://github.com/abojchevski/graph2gauss/blob/HEAD/g2g/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"020409818ff0d1c7"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}