72 research outputs found
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
The Graph Curvature Calculator and the curvatures of cubic graphs
We classify all cubic graphs with either non-negative Ollivier-Ricci
curvature or non-negative Bakry-\'Emery curvature everywhere. We show in both
curvature notions that the non-negatively curved graphs are the prism graphs
and the M\"obius ladders. We also highlight an online tool for calculating the
curvature of graphs under several variants of these curvature notions that we
use in the classification. As a consequence of the classification result we
show, that non-negatively curved cubic expanders do not exist
- …