Papers › p-Norm Flow Diffusion for Local Graph Clustering

p-Norm Flow Diffusion for Local Graph Clustering

20 May 2020arXiv:2005.09810archive 2025-07-28

Kimon Fountoulakis, Di Wang, Shenghao Yang

Local graph clustering and the closely related seed set expansion problem are primitives on graphs that are central to a wide range of analytic and learning tasks such as local clustering, community detection, nodes ranking and feature inference. Prior work on local graph clustering mostly falls into two categories with numerical and combinatorial roots respectively. In this work, we draw inspiration from both fields and propose a family of convex optimization formulations based on the idea of diffusion with p-norm network flow for p∈(1,∞). In the context of local clustering, we characterize the optimal solutions for these optimization problems and show their usefulness in finding low conductance cuts around input seed set. In particular, we achieve quadratic approximation of conductance in the case of p=2 similar to the Cheeger-type bounds of spectral methods, constant factor approximation when p→∞ similar to max-flow based methods, and a smooth transition for general p values in between. Thus, our optimization formulation can be viewed as bridging the numerical and combinatorial approaches, and we can achieve the best of both worlds in terms of speed and noise robustness. We show that the proposed problem can be solved in strongly local running time for p≥2 and conduct empirical evaluations on both synthetic and real-world graphs to illustrate our approach compares favorably with existing methods.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

The archive's official repository (s-h-yang/pNormFlowDiffusion) was not harvested; the 12 samples below come from 1 community repository.

Syntology 12 code samples harvested from 1 repository linked to this paper: 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: community (archive-listed): 12 samples from 1 repository, 5 ran (5 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

s-h-yang/pNormFlowDiffusion officialmentioned in papermentioned on GitHubSyntology: not harvested report
kfoynt/LocalGraphClustering mentioned on GitHubMITSyntology: 12 samples, 5 ran (0 instrument-failed) · 7 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested: 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

5ran
7unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from kfoynt/LocalGraphClustering. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

kfoynt/LocalGraphClustering community (archive-listed) 12 samples, 5 ran (0 instrument-failed) · 7 unverified
acl_list localgraphclustering/algorithms/acl_list.py ran MIT (permissive) · 25afa867451dfa44 · report fixture: signature ref_node:list/1/int, g:GraphStandIn/0/?, alpha:float/0/float, rho:float/0/float, max_iter:int/0/int, max_time:int/0/int · returned ndarray · level recorded 2026-09-25
diff in 16 papers localgraphclustering/algorithms/fista_dinput_dense.py ran MIT (permissive) · 0eca415c135a6946 · report fixture: signature a:list/1/int, b:list/1/int · returned ndarray · level recorded 2026-09-25
eig2nL_subgraph localgraphclustering/algorithms/eig2_nL.py ran MIT (permissive) · 3bc99562f219b3ab · report fixture: signature g:MockGraph/0/?, ref_nodes:ndarray/1/int, tol_eigs:float/0/float, normalize:bool/0/bool · returned tuple · level recorded 2026-09-25
mat_vec_with_Q localgraphclustering/algorithms/fista_dinput_dense.py ran MIT (permissive) · fa5bf5f8919516b2 · report fixture: signature g:GraphObject/0/?, alpha:float/0/float, x:ndarray/1/float · returned ndarray · level recorded 2026-09-25
sweepcut localgraphclustering/algorithms/sweepcut.py ran MIT (permissive) · 4f49bc8e3863ab76 · report fixture: signature p:ndarray/1/float, g:GraphObject/0/? · returned list · level recorded 2026-09-25
MQI localgraphclustering/MQI.py unverified MIT (permissive) · e1737d8b1e0223d9 · report
MQI_weighted localgraphclustering/MQI_weighted.py unverified MIT (permissive) · a3be98a2ac73b7e5 · report
SimpleLocal localgraphclustering/SimpleLocal.py unverified MIT (permissive) · f3ee78284e072922 · report
SimpleLocal_weighted localgraphclustering/SimpleLocal_weighted.py unverified MIT (permissive) · 5b7985e7d25d8368 · report
approximate_PageRank_weighted localgraphclustering/approximate_PageRank_weighted.py unverified MIT (permissive) · 4b839d8e9371df3b · report
eig2_nL localgraphclustering/algorithms/eig2_nL.py unverified MIT (permissive) · 63a290967ef4b75f · report
fista_dinput_dense localgraphclustering/algorithms/fista_dinput_dense.py unverified MIT (permissive) · 15a57b247e8c53ae · report

Tasks

ClusteringCommunity DetectionGraph Clustering

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SPEED

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections