Related papers: Cheeger Inequalities for Vertex Expansion and Rewe…

In the $0$-Extension problem, we are given an edge-weighted graph $G=(V,E,c)$, a set $T\subseteq V$ of its vertices called terminals, and a semi-metric $D$ over $T$, and the goal is to find an assignment $f$ of each non-terminal vertex to a…

We consider a dual Cheeger constant $\overline h$ for finite graphs with edge weights from an arbitrary real-closed ordered field. We obtain estimates of $\overline h$ in terms of number of vertices in graph. Further, we estimate the…

Let $G$ be a finite group and $S$ be a symmetric generating set of $G$ with $|S| = d$. We show that if the undirected Cayley sum graph $C_{\Sigma}(G,S)$ is an expander graph and is non-bipartite, then the spectrum of its normalised…

As a non-trivial extension of the celebrated Cheeger inequality, the higher-order Cheeger inequalities for graphs due to Lee, Oveis Gharan and Trevisan provide for each $k$ an upper bound for the $k$-way Cheeger constant in forms of…

If $(\omega(e))$ is a family of random variables (weights) assigned to the edges of $\mathbb{Z}^d$, the nearest neighbor graph is the directed graph induced by all edges $\langle x,y \rangle$ such that $\omega(\{x,y\})$ is minimal among all…

We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…

The Small Set Expansion Hypothesis (SSEH) is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose edge expansion is almost zero and one in which all small subsets of…

Let $B_2(p)$ be an $n$-dimensional smooth geodesic ball with Ricci curvature $\geq-(n-1)\kappa^2$ for some $\kappa\geq0$. We establish the Sobolev inequality and the uniform Neumann-Poincar\'e inequality on each minimal graph over $B_1(p)$…

We prove sharp Dirichlet eigenvalue inequalities for planar triangles. We settle a conjecture of Laugesen and Siudeja by showing that the equilateral triangle uniquely minimizes a scale-invariant functional of the first Dirichlet…

We study the spectral implications of re-weighting a graph by the $\ell_\infty$-Lewis weights of its edges. Our main motivation is the ER-Minimization problem (Saberi et al., SIAM'08): Given an undirected graph $G$, the goal is to find…

We extend the definition of boundary expansion to CW complexes and prove a Cheeger-Buser-type relation between the spectral gap of the Laplacian and the boundary expansion of an orientable CW complex.

We aim to learn a sparse and connected graph from sparse data, where the number of observations K can be substantially smaller than the signal dimension N for signals x in R^N, and the underlying distribution is unknown. In this severely…

Let $\tau(G)$ and $\kappa'(G)$ denote the edge-connectivity and the spanning tree packing number of a graph $G$, respectively. Proving a conjecture initiated by Cioaba and Wong, Liu et al. in 2014 showed that for any simple graph $G$ with…

In this paper we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in the context of Riemannian manifolds and graphs. We characterize the hyperbolic manifolds and graphs (with bounded local geometry) verifying…

We introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual Cheeger inequalities for eigenvalues of normalized Laplace operators on weighted finite graphs. Our proof proposes a new spectral clustering…

In this paper, we study some functional inequalities (such as Poincar\'e inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy…

We give new, improved bounds for approximating the sparsest cut value or in other words the conductance $\phi$ of a graph in the CONGEST model. As our main result, we present an algorithm running in $O(\log^2 n/\phi)$ rounds in which every…

We propose a Laplacian based on general inner product spaces, which we call the inner product Laplacian. We show the combinatorial and normalized graph Laplacians, as well as other Laplacians for hypergraphs and directed graphs, are special…

By measured graphs we mean graphs endowed with a measure on the set of vertices. In this context, we explore the relations between the appropriate Cheeger constant and Poincar\'{e} inequalities. We prove that the so-called Cheeger…

Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…