Conductance Estimation in Digraphs: Submodular Transformation, Lov\'asz Extension and Dinkelbach Iteration
Sihong Shao, Chuan Yang, Xinyang Ye

TL;DR
This paper introduces a novel framework and algorithm for estimating conductance in directed graphs that preserves edge directionality, outperforming traditional symmetrization-based methods.
Contribution
It develops a generalized submodular transformation framework using Lovász extension and Dinkelbach iteration to better capture directed edge dependencies in conductance estimation.
Findings
The proposed DSI algorithm converges to a binary local optimum.
DSI significantly outperforms existing methods on synthetic and real-world networks.
The framework effectively addresses the asymmetry issue in digraph partitioning.
Abstract
Conventional spectral digraph partitioning methods typically symmetrize the adjacency matrix, thereby transforming the directed graph partitioning problem into an undirected one, where bipartitioning is commonly linked to minimizing graph conductance. However, such symmetrization approaches disregard the directional dependencies of edges in digraphs, failing to capture the inherent imbalance crucial to directed network modeling. Building on the parallels between digraph conductance and conductance under submodular transformations, we develop a generalized framework to derive their continuous formulations. By leveraging properties of the Lov\'asz extension, this framework addresses the fundamental asymmetry problem in digraph partitioning. We then formulate an equivalent fractional programming problem, relax it via a three-step Dinkelbach iteration procedure, and design the Directed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques · Graph Theory and Algorithms
