{"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/predicting-diffusion-reach-probabilities-via","title":"Predicting Diffusion Reach Probabilities via Representation Learning on Social Networks","arxiv_id":"1901.03829","date":"2019-01-12","proceeding":null,"authors":["Furkan Gursoy","Ahmet Onur Durahim"],"abstract":"Diffusion reach probability between two nodes on a network is defined as the\nprobability of a cascade originating from one node reaching to another node. An\ninfinite number of cascades would enable calculation of true diffusion reach\nprobabilities between any two nodes. However, there exists only a finite number\nof cascades and one usually has access only to a small portion of all available\ncascades. In this work, we addressed the problem of estimating diffusion reach\nprobabilities given only a limited number of cascades and partial information\nabout underlying network structure. Our proposed strategy employs node\nrepresentation learning to generate and feed node embeddings into machine\nlearning algorithms to create models that predict diffusion reach\nprobabilities. We provide experimental analysis using synthetically generated\ncascades on two real-world social networks. Results show that proposed method\nis superior to using values calculated from available cascades when the portion\nof cascades is small.","url_abs":"http://arxiv.org/abs/1901.03829v1","url_pdf":"http://arxiv.org/pdf/1901.03829v1.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":"predicting-diffusion-reach-probabilities-via","repo_url":"https://github.com/furkangursoy/RLforDiffPred","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"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":"furkangursoy/RLforDiffPred","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":"020fec3b5fd9d8654bdf7aa1f97d5e1ebf6998a73bc8e7f60e61acf229f256fe","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}