{"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/real-time-community-detection-in-large-social","title":"Real-Time Community Detection in Large Social Networks on a Laptop","arxiv_id":"1601.03958","date":"2016-01-15","proceeding":null,"authors":["Benjamin Paul Chamberlain","Josh Levy-Kramer","Clive Humby","Marc Peter Deisenroth"],"abstract":"For a broad range of research, governmental and commercial applications it is\nimportant to understand the allegiances, communities and structure of key\nplayers in society. One promising direction towards extracting this information\nis to exploit the rich relational data in digital social networks (the social\ngraph). As social media data sets are very large, most approaches make use of\ndistributed computing systems for this purpose. Distributing graph processing\nrequires solving many difficult engineering problems, which has lead some\nresearchers to look at single-machine solutions that are faster and easier to\nmaintain. In this article, we present a single-machine real-time system for\nlarge-scale graph processing that allows analysts to interactively explore\ngraph structures. The key idea is that the aggregate actions of large numbers\nof users can be compressed into a data structure that encapsulates user\nsimilarities while being robust to noise and queryable in real-time. We achieve\nsingle machine real-time performance by compressing the neighbourhood of each\nvertex using minhash signatures and facilitate rapid queries through Locality\nSensitive Hashing. These techniques reduce query times from hours using\nindustrial desktop machines operating on the full graph to milliseconds on\nstandard laptops. Our method allows exploration of strongly associated regions\n(i.e. communities) of large graphs in real-time on a laptop. It has been\ndeployed in software that is actively used by social network analysts and\noffers another channel for media owners to monetise their data, helping them to\ncontinue to provide free services that are valued by billions of people\nglobally.","url_abs":"http://arxiv.org/abs/1601.03958v2","url_pdf":"http://arxiv.org/pdf/1601.03958v2.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":"real-time-community-detection-in-large-social","repo_url":"https://github.com/melifluos/LSH-community-detection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"community-detection","task_name":"Community Detection"},{"task_slug":"distributed-computing","task_name":"Distributed Computing"}],"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":"melifluos/LSH-community-detection","kind":"listed","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":"f5ceb3584eaf7ef327208e34f6a6de8e65f8d2e1cef2f9887888f48ec03dad87","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}