Related papers: A Cheeger Inequality for Size-Specific Conductance
We study the optimal constant in a Sobolev inequality for BV functions with zero mean value and vanishing outside a bounded open set. We are interested in finding the best possible embedding constant in terms of the measure of the domain…
It was recently shown by Lubetzky and Peres (2016) and by Sardari (2018) that Ramanujan graphs, i.e., graphs with the optimal spectrum, exhibit cutoff of the simple random walk in an optimal time and have an optimal almost-diameter. We show…
In this paper we extend the known results of analytic connectivity to non-uniform hypergraphs. We prove a modified Cheeger's inequality and also give a bound on analytic connectivity with respect to the degree sequence and diameter of a…
We demonstrate the necessity of a Poincar\'e type inequality for those metric measure spaces that satisfy Cheeger's generalization of Rademacher's theorem for all Lipschitz functions taking values in a Banach space with the Radon-Nikodym…
The expansion of a graph is typically associated with its spectral properties - testing whether a graph is an expander is usually done using Cheeger's inequality. One can also use multiple eigenvalues in a higher-order Cheeger's inequality…
By using optimal transport theory, we prove a sharp dimension-free isoperimetric inequality involving the volume entropy, in metric measure spaces with non-negative Ricci curvature in the sense of Lott--Sturm--Villani. We show that this…
Since the introduction of the Sliced Wasserstein distance in the literature, its simplicity and efficiency have made it one of the most interesting surrogate for the Wasserstein distance in image processing and machine learning. However,…
We derive Cheeger inequalities for directed graphs and hypergraphs using the reweighted eigenvalue approach that was recently developed for vertex expansion in undirected graphs [OZ22,KLT22,JPV22]. The goal is to develop a new spectral…
The Thouless conjecture states that the average conductance of a disordered metallic sample in the diffusive regime can be related to the sensitivity of the sample's spectrum to a change in the boundary conditions. Here we present results…
Let $D\subset\mathbb C^n$ be a bounded, strongly pseudoconvex domain whose boundary $bD$ satisfies the minimal regularity condition of class $C^2$, and let $S_\omega$ denote the Cauchy--Szeg\H{o} projection defined with respect to (any)…
For a distance-regular graph with second largest eigenvalue (resp. smallest eigenvalue) \mu1 (resp. \muD) we show that (\mu1+1)(\muD+1)<= -b1 holds, where equality only holds when the diameter equals two. Using this inequality we study…
This paper studies the third-order characteristic of nonsingular discrete memoryless channels and the Gaussian channel with a maximal-power constraint. The third-order term in our expansions employs a new quantity here called the channel…
We prove structure theorems for measures on the discrete cube and on Gaussian space, which provide sufficient conditions for mean-field behavior. These conditions rely on a new notion of complexity for such measures, namely the…
We discuss the minimum value of the zero-bias differential conductance $G_{\textrm{min}}$ in a junction consisting of a normal metal and a nodal superconductor preserving time-reversal symmetry. Using the quasiclassical Green function…
This paper deals with spectral inequalities for one-dimensional Schr\"odinger operators with potentials bounded between two increasing functions (weights). The spectral inequality allows one to estimate the norm of a function with bounded…
We develop the notion of higher Cheeger constants for a measurable set $\Omega \subset \mathbb{R}^N$. By the $k$-th Cheeger constant we mean the value \[h_k(\Omega) = \inf \max \{h_1(E_1), \dots, h_1(E_k)\},\] where the infimum is taken…
Spectral partitioning is a simple, nearly-linear time, algorithm to find sparse cuts, and the Cheeger inequalities provide a worst-case guarantee for the quality of the approximation found by the algorithm. Local graph partitioning…
Random hyperbolic graphs have been suggested as a promising model of social networks. A few of their fundamental parameters have been studied. However, none of them concerns their spectra. We consider the random hyperbolic graph model as…
We study the eigenvalues of the connection Laplacian on a graph with an orthogonal group or unitary group signature. We establish higher order Buser type inequalities, i.e., we provide upper bounds for eigenvalues in terms of Cheeger…
We work with the space $\mathcal C(S)$ of geodesic currents on a closed surface $S$ of negative Euler characteristic. By prior work of the author with Sebastian Hensel, each filling geodesic current $\mu$ has a unique length-minimizing…