Anand Louis

activity

20092023

most citedHyperGCN: A New Method of Training Graph Convolutional Networks on Hypergraphs

203 citations · 288 across the 21 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2020

$λ_{\infty}$ & Maximum Variance Embedding: Measuring and Optimizing Connectivity of A Graph Metric

Majid Farhadi, Anand Louis, Mohit Singh +1

Bobkov, Houdré, and the last author [2000] introduced a Poincaré-type functional parameter, $λ_{\infty}$ , of a graph and related it to connectivity of the graph via Cheeger-type ineq…

cs.CC2013

The Complexity of Approximating Vertex Expansion

Anand Louis, Prasad Raghavendra, Santosh Vempala

We study the complexity of approximating the vertex expansion of graphs $G = (V, E)$ , defined as \[ Φ^V := \min_{S \subset V} n \cdot \frac{|N(S)|}{|S| |V \backslash S|}. \] We give…

λ∞​ & Maximum Variance Embedding: Measuring and Optimizing Connectivity of A Graph Metric

The Complexity of Approximating Vertex Expansion

$λ_{\infty}$ & Maximum Variance Embedding: Measuring and Optimizing Connectivity of A Graph Metric