research
∙
06/15/2023
Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues
We consider a new semidefinite programming relaxation for directed edge ...
share
research
∙
05/03/2023
Experimental Design for Any p-Norm
We consider a general p-norm objective for experimental design problems ...
research
∙
11/17/2022
Cheeger Inequalities for Directed Graphs and Hypergraphs Using Reweighted Eigenvalues
We derive Cheeger inequalities for directed graphs and hypergraphs using...
research
∙
03/11/2022
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues
The classical Cheeger's inequality relates the edge conductance ϕ of a g...
research
∙
10/29/2020
A Local Search Framework for Experimental Design
We present a local search framework to design and analyze both combinato...
research
∙
03/17/2020
A Spectral Approach to Network Design
We present a spectral approach to design approximation algorithms for ne...
research
∙
01/09/2020
Improved Analysis of Higher Order Random Walks and Applications
The motivation of this work is to extend the techniques of higher order ...
research
∙
04/05/2019
Network design for s-t effective resistance
We consider a new problem of designing a network with small s-t effectiv...
research
∙
04/05/2019
Spectral analysis of matrix scaling and operator scaling
We present a spectral analysis for matrix scaling and operator scaling. ...
research
∙
11/17/2017
Graph Clustering using Effective Resistance
#1#1 We design a polynomial time algorithm that for any weighted undire...
research
∙
01/23/2013