ℓ_2-norm Flow Diffusion in Near-Linear Time

05/30/2021
by   Li Chen, et al.
0

Diffusion is a fundamental graph procedure and has been a basic building block in a wide range of theoretical and empirical applications such as graph partitioning and semi-supervised learning on graphs. In this paper, we study computationally efficient diffusion primitives beyond random walk. We design an O(m)-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. Examples include finding locally-biased low conductance cuts. Using a known connection between the optimal dual solution of the flow diffusion problem and the local cut structure, our algorithm gives an alternative approach for finding such cuts in nearly linear time. From a technical point of view, our algorithm contributes a novel way of dealing with inequality constraints in graph optimization problems. It adapts the high-level algorithmic framework of nearly linear time Laplacian system solvers, but requires several new tools: vertex elimination under constraints, a new family of graph ultra-sparsifiers, and accelerated proximal gradient methods with inexact proximal mapping computation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2019

Flows in Almost Linear Time via Adaptive Preconditioning

We present algorithms for solving a large class of flow and regression p...
research
05/20/2020

p-Norm Flow Diffusion for Local Graph Clustering

Local graph clustering and the closely related seed set expansion proble...
research
07/20/2023

Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians

The development of simple and fast hypergraph spectral methods has been ...
research
09/02/2021

Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows

We study the problem of finding flows in undirected graphs so as to mini...
research
03/15/2019

Deterministic Approximation of Random Walks in Small Space

We give a deterministic, nearly logarithmic-space algorithm that given a...
research
01/10/2022

Optimizing Diffusion Rate and Label Reliability in a Graph-Based Semi-supervised Classifier

Semi-supervised learning has received attention from researchers, as it ...
research
04/17/2018

Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation

The computation of electrical flows is a crucial primitive for many rece...

Please sign up or login with your details

Forgot password? Click here to reset