945 research outputs found
A Cheeger Inequality for the Graph Connection Laplacian
The O(d) Synchronization problem consists of estimating a set of unknown
orthogonal transformations O_i from noisy measurements of a subset of the
pairwise ratios O_iO_j^{-1}. We formulate and prove a Cheeger-type inequality
that relates a measure of how well it is possible to solve the O(d)
synchronization problem with the spectra of an operator, the graph Connection
Laplacian. We also show how this inequality provides a worst case performance
guarantee for a spectral method to solve this problem.Comment: To appear in the SIAM Journal on Matrix Analysis and Applications
(SIMAX
Isoperimetric Inequalities in Simplicial Complexes
In graph theory there are intimate connections between the expansion
properties of a graph and the spectrum of its Laplacian. In this paper we
define a notion of combinatorial expansion for simplicial complexes of general
dimension, and prove that similar connections exist between the combinatorial
expansion of a complex, and the spectrum of the high dimensional Laplacian
defined by Eckmann. In particular, we present a Cheeger-type inequality, and a
high-dimensional Expander Mixing Lemma. As a corollary, using the work of Pach,
we obtain a connection between spectral properties of complexes and Gromov's
notion of geometric overlap. Using the work of Gunder and Wagner, we give an
estimate for the combinatorial expansion and geometric overlap of random
Linial-Meshulam complexes
Higher Dimensional Discrete Cheeger Inequalities
For graphs there exists a strong connection between spectral and
combinatorial expansion properties. This is expressed, e.g., by the discrete
Cheeger inequality, the lower bound of which states that , where is the second smallest eigenvalue of the Laplacian of
a graph and is the Cheeger constant measuring the edge expansion of
. We are interested in generalizations of expansion properties to finite
simplicial complexes of higher dimension (or uniform hypergraphs).
Whereas higher dimensional Laplacians were introduced already in 1945 by
Eckmann, the generalization of edge expansion to simplicial complexes is not
straightforward. Recently, a topologically motivated notion analogous to edge
expansion that is based on -cohomology was introduced by Gromov
and independently by Linial, Meshulam and Wallach. It is known that for this
generalization there is no higher dimensional analogue of the lower bound of
the Cheeger inequality. A different, combinatorially motivated generalization
of the Cheeger constant, denoted by , was studied by Parzanchevski,
Rosenthal and Tessler. They showed that indeed , where
is the smallest non-trivial eigenvalue of the (-dimensional
upper) Laplacian, for the case of -dimensional simplicial complexes with
complete -skeleton.
Whether this inequality also holds for -dimensional complexes with
non-complete -skeleton has been an open question. We give two proofs of
the inequality for arbitrary complexes. The proofs differ strongly in the
methods and structures employed, and each allows for a different kind of
additional strengthening of the original result.Comment: 14 pages, 2 figure
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues
The classical Cheeger's inequality relates the edge conductance of a
graph and the second smallest eigenvalue of the Laplacian matrix.
Recently, Olesker-Taylor and Zanetti discovered a Cheeger-type inequality
connecting the vertex
expansion of a graph and the maximum reweighted second
smallest eigenvalue of the Laplacian matrix.
In this work, we first improve their result to where is the maximum degree in , which is
optimal assuming the small-set expansion conjecture. Also, the improved result
holds for weighted vertex expansion, answering an open question by
Olesker-Taylor and Zanetti. Building on this connection, we then develop a new
spectral theory for vertex expansion. We discover that several interesting
generalizations of Cheeger inequalities relating edge conductances and
eigenvalues have a close analog in relating vertex expansions and reweighted
eigenvalues. These include an analog of Trevisan's result on bipartiteness, an
analog of higher order Cheeger's inequality, and an analog of improved
Cheeger's inequality.
Finally, inspired by this connection, we present negative evidence to the
-polytope edge expansion conjecture by Mihail and Vazirani. We construct
-polytopes whose graphs have very poor vertex expansion. This implies that
the fastest mixing time to the uniform distribution on the vertices of these
-polytopes is almost linear in the graph size. This does not provide a
counterexample to the conjecture, but this is in contrast with known positive
results which proved poly-logarithmic mixing time to the uniform distribution
on the vertices of subclasses of -polytopes.Comment: 65 pages, 1 figure. Minor change
- …