• Corpus ID: 218719974

p-Norm Flow Diffusion for Local Graph Clustering

@article{Yang2020pNormFD,
  title={p-Norm Flow Diffusion for Local Graph Clustering},
  author={Shenghao Yang and Di Wang and Kimon Fountoulakis},
  journal={ArXiv},
  year={2020},
  volume={abs/2005.09810}
}
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… 

Figures and Tables from this paper

Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering

The method can be thought as a nonlinear generalization of the Anderson-Chung-Lang push procedure to approximate a personalized PageRank vector efficiently and can solve other types of nonlinear objective functions, such as p-norm variants of Huber losses.

Local Hyper-flow Diffusion

This work proposes the first local diffusion method that achieves edge-sizeindependent Cheeger-type guarantee for the problem of local hypergraph clustering while applying to a rich class of higher-order relations that covers a number of previously studied special cases.

Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning

A new diffusion-based hypergraph clustering algorithm that solves a quadratic hypergraph cut based objective akin to a hypergraph analog of Andersen-Chung-Lang personalized PageRank clustering for graphs is proposed and it is proved that, for graphs with fixed maximum hyperedge size, this method is strongly local, meaning that its runtime only depends on the size of the output instead of thesize of the hypergraph and is highly scalable.

Targeted pandemic containment through identifying local contact network bottlenecks

This paper proposes a new flow-based edge-betweenness centrality method for detecting bottleneck edges that connect communities in contact networks and demonstrates empirically that the proposed method is orders of magnitude faster than existing methods.

Weighted flow diffusion for local graph clustering with node attributes: an algorithm and statistical guarantees

This work presents a simple local graph clustering algorithm for graphs with node attributes, based on the idea of using mass locally in the graph while accounting for both structural and attribute proximities, and shows that incorporating node attributes leads to superior local clustering performances using real-world graph datasets.

Scalable and Effective Conductance-based Graph Clustering

Surprisingly, it is proved that PCon de can identify clusters with near-constant approximation ratio, resulting in an important theoretical improvement over the well-known quadratic Cheeger bound.

Semi-supervised Local Cluster Extraction by Compressive Sensing

This paper proposes a new semi-supervised local cluster extraction approach by applying the idea of compressive sensing based on two pioneering works under the same framework and improves the existing works by making the initial cut to be the entire graph and overcomes a major limitation of existing works.

2-norm Flow Diffusion in Near-Linear Time

An near-linear time randomized algorithm for the 2-norm flow diffusion problem, a recently proposed diffusion model based on network flow with demonstrated graph clustering related applications both in theory and in practice.

Multiway p-spectral graph cuts on Grassmann manifolds

This work presents a novel direct multiway spectral clustering algorithm in the p -norm, a nonlinear generalization of the standard graph Laplacian, recasted as an unconstrained minimization problem on a Grassmann manifold, and demonstrates the effectiveness and accuracy of the algorithm in various artificial test-cases.

Flow Metrics on Graphs

A lower bound for the number of edges required for a resistance sparsifier in the worst case is presented, and it is shown that the flow metrics satisfy a stronger version of the triangle inequality, which gives some information about their structure and geometry.

References

SHOWING 1-10 OF 50 REFERENCES

Variational perspective on local graph clustering

A novel variational formulation is derived which makes explicit the actual optimization problem solved by APPR, and shows that an optimization algorithm which apparently requires accessing the entire graph, can be made to behave in a completely local manner by accessing only a small number of nodes.

Diffusion and clustering on large graphs

An efficient global partitioning algorithm specifically tailored for a graph-theoretic setting, and a new voter model for the evolution of electoral opinions in social networks, which operates on hypergraphs, allowing for more complex interactions, and it yields a wider range of outcomes.

A Spectral Clustering Approach To Finding Communities in Graph

This paper shows how optimizing the Q function can be reformulated as a spectral relaxation problem and proposes two new spectral clustering algorithms that seek to maximize Q and indicates that the new algorithms are efficient and effective at finding both good clusterings and the appropriate number of clusters across a variety of real-world graph data sets.

A Local Algorithm for Finding Well-Connected Clusters

This work develops a method with better theoretical guarantee compared to all previous work, both in terms of the clustering accuracy and the conductance of the output set, and outperforms prior work when the cluster is well-connected.

Capacity Releasing Diffusion for Speed and Locality

This work introduces a novel Capacity Releasing Diffusion (CRD) Process, which is both faster and stays more local than the classical spectral diffusion process, and is the first local graph clustering algorithm that is not subject to the well-known quadratic Cheeger barrier.

A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally

This paper introduces a locally-biased analogue of the second eigenvector of the Laplacian matrix, and demonstrates its usefulness at highlighting local properties of data graphs in a semi-supervised manner and shows how it can applied to finding locally- biased sparse cuts around an input vertex seed set in social and information networks.

Flow-Based Algorithms for Local Graph Clustering

This work shows how to use LocalImprove to obtain a constant approximation O(OPT) as long as CONN/OPT = Omega(1), the first flow-based algorithm and shows that spectral methods are not the only viable approach to the construction of local graph partitioning algorithm and open door to the study of algorithms with even better approximation and locality guarantees.

Almost Optimal Local Graph Clustering Using Evolving Sets

A simple randomized local partitioning algorithm that finds a sparse cut by simulating the volume-biased evolving set process, which is a Markov chain on sets of vertices, and proves a bicriteria approximation algorithm for the expansion profile of any graph.

Nonlinear Diffusion for Community Detection and Semi-Supervised Learning

This paper illustrates a class of nonlinear graph diffusions that are competitive with state of the art embedding techniques and outperform classic diffusions and demonstrates the benefits of these techniques on a variety of synthetic and real-world data.

Heat kernel based community detection

This work presents the first deterministic, local algorithm to compute this type of graph diffusion and uses that algorithm to study the communities that it produces, indicating that the communities produced by this method have better conductance than those produced by PageRank, although they take slightly longer to compute.