{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/accurately-modeling-biased-random-walks-on","title":"Accurately Modeling Biased Random Walks on Weighted Graphs Using $\\textit{Node2vec+}$","arxiv_id":"2109.08031","date":"2021-09-15","proceeding":null,"authors":["Renming Liu","Matthew Hirn","Arjun Krishnan"],"abstract":"Node embedding is a powerful approach for representing the structural role of each node in a graph. $\\textit{Node2vec}$ is a widely used method for node embedding that works by exploring the local neighborhoods via biased random walks on the graph. However, $\\textit{node2vec}$ does not consider edge weights when computing walk biases. This intrinsic limitation prevents $\\textit{node2vec}$ from leveraging all the information in weighted graphs and, in turn, limits its application to many real-world networks that are weighted and dense. Here, we naturally extend $\\textit{node2vec}$ to $\\textit{node2vec+}$ in a way that accounts for edge weights when calculating walk biases, but which reduces to $\\textit{node2vec}$ in the cases of unweighted graphs or unbiased walks. We empirically show that $\\textit{node2vec+}$ is more robust to additive noise than $\\textit{node2vec}$ in weighted graphs using two synthetic datasets. We also demonstrate that $\\textit{node2vec+}$ significantly outperforms $\\textit{node2vec}$ on a commonly benchmarked multi-label dataset (Wikipedia). Furthermore, we test $\\textit{node2vec+}$ against GCN and GraphSAGE using various challenging gene classification tasks on two protein-protein interaction networks. Despite some clear advantages of GCN and GraphSAGE, they show comparable performance with $\\textit{node2vec+}$. Finally, $\\textit{node2vec+}$ can be used as a general approach for generating biased random walks, benefiting all existing methods built on top of $\\textit{node2vec}$. $\\textit{Node2vec+}$ is implemented as part of $\\texttt{PecanPy}$, which is available at https://github.com/krishnanlab/PecanPy .","url_abs":"https://arxiv.org/abs/2109.08031v2","url_pdf":"https://arxiv.org/pdf/2109.08031v2.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":"accurately-modeling-biased-random-walks-on","repo_url":"https://github.com/krishnanlab/PecanPy","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"gcn","method_name":"GCN"},{"method_slug":"graphsage","method_name":"GraphSAGE"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"krishnanlab/PecanPy","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ab2df9ddb209ac6aeb65e1d7ca70801b9284b11dc276d6076e15554ce6750adb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}