Research map / Graph learning / Graph algorithms and clustering
p-Norm Flow Diffusion for Local Graph Clustering
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Raise p-norm flow diffusion from p=2 to p=4 (ablation) | p-norm flow diffusion · LFR synthetic graphs | conductance | Helped |
| Raise p-norm flow diffusion from p=4 to p=8 (ablation) | p-norm flow diffusion · LFR synthetic graphs | conductance | Helped |
| Increase the seed-set overlap with the target cluster | p-norm flow diffusion · LFR synthetic graph, μ = 0.3 | conductance | Helped |
| Increase the seed-set overlap with the target cluster | p-norm flow diffusion · LFR synthetic graph, μ = 0.3 | F1 measure | Helped |
| Use p=2 instead of p=4 or p=8 (ablation) | p-norm flow diffusion · LFR synthetic graphs | F1 measure | Hurt |
| Use p=4 instead of p=2 (ablation) | p-norm flow diffusion · Dumbbell graph | conductance | Helped |
| Use p=4 instead of p=2 (ablation) | p-norm flow diffusion · Facebook real-world graphs | conductance | Helped |
| Use p=4 instead of p=2 (ablation) | p-norm flow diffusion · LFR synthetic graphs | conductance | Helped |
| Use p=4 instead of p=2 (ablation) | p-norm flow diffusion · LFR synthetic graphs | F1 measure | Helped |
| Use nonlinear power diffusion rather than p-norm flow diffusion | local graph clustering · Sfld | F1 measure | Hurt |
Closest papers by meaning
- Local Graph Clustering with Noisy Labels (ICLR 2024 · similarity 0.87)
- Faster Local Solvers for Graph Diffusion Equations (NeurIPS 2024 · similarity 0.85)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.85)
- A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering (ICML 2024 · similarity 0.85)
- Efficient and Scalable Graph Generation through Iterative Local Expansion (ICLR 2024 · similarity 0.85)
- Learning on Large Graphs using Intersecting Communities (NeurIPS 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.