Related papers: A Linear Cheeger Inequality using Eigenvector Norm…

One of the best-known results in spectral graph theory is the inequality of Hoffman \[ \chi\left( G\right) \geq1-\frac{\lambda\left( G\right) }{\lambda_{\min }\left( G\right) }, \] where $\chi\left( G\right) $ is the chromatic number of a…

The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…

We prove lower bounds for the first non-trivial eigenvalue of the drift Laplacian on manifolds with Wentzell-type boundary condition in terms of some Cheeger-type constants for bulk-boundary interactions. Our results are in the spirit of…

We establish a Shearer-type inequality for the Poincar\'e constant, showing that the Poincar\'e constant corresponding to the convolution of a collection of measures can be nontrivially controlled by the Poincar\'e constants corresponding…

We consider spacelike graphs $\Gamma_f$ of simple products $(M\times N, g\times -h)$ where $(M,g)$ and $(N,h)$ are Riemannian manifolds and $f:M\to N$ is a smooth map. Under the condition of the Cheeger constant of $M$ to be zero and some…

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 extend the so-called "single ring theorem"[1], also known as the Haagerup-Larsen theorem[2], by showing that in the limit when the size of the matrix goes to infinity a particular correlator between left and right eigenvectors of the…

Shearer's inequality bounds the sum of joint entropies of random variables in terms of the total joint entropy. We give another lower bound for the same sum in terms of the individual entropies when the variables are functions of…

We prove a new generalization of the higher-order Cheeger inequality for partitioning with buffers. Consider a graph $G=(V,E)$. The buffered expansion of a set $S \subseteq V$ with a buffer $B \subseteq V \setminus S$ is the edge expansion…

This paper surveys the main results obtained during the period 1992-1999 on three aspects mentioned at the title. The first result is a new and general variational formula for the lower bound of spectral gap (i.e., the first non-trivial…

In a graph $A$, the measure $|M_g^A(f)|=m_g^A(f)$ for each arbitrary edge $f=gh$ counts the edges in $A$ closer to $g$ than $h$. $A$ is termed an edge quasi-$\lambda$-distance-balanced graph in a metric space (abbreviated as $EQDBG$), where…

In this paper we study the behavior of the second eigenfunction of the anisotropic $p$-Laplace operator \[ - Q_{p}u:=-\textrm{div} \left(F^{p-1}(\nabla u)F_\xi (\nabla u)\right), \] as $p \to 1^+$, where $F$ is a suitable smooth norm of…

The $\mu$-conductance measure proposed by Lov\'asz and Simonovits is a size-specific conductance score that identifies the set with smallest conductance while disregarding those sets with volume smaller than a $\mu$ fraction of the whole…

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…

Let $E_i(H)$ denote the negative eigenvalues of the one-dimensional Schr\"odinger operator $Hu:=-u^{\prime\prime}-Vu,\ V\geq 0,$ on $L_2({\Bbb R})$. We prove the inequality \sum_i|E_i(H)|^\gamma\leq L_{\gamma,1}\int_{\Bbb R}…

We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial-Meshulam model $X^k(n,p)$ of random $k$-dimensional simplicial complexes on $n$…

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 quadratic embedding constant (QEC) of a graph $G$ is a new numeric invariant, which is defined in terms of the distance matrix and is denoted by $\mathrm{QEC}(G)$. By observing graph structure of the maximal cliques (clique graph), we…

The first nontrivial lower bound of the worst-case approximation ratio for the maxcut problem was achieved via the dual Cheeger problem, whose optimal value is referred to the dual Cheeger constant $h^+$, and later improved through its…

We give a proof of the Lieb-Thirring inequality in the critical case $d=1$, $\gamma= 1/2$, which yields the best possible constant.