Higher dimensional digraphs from cube complexes and their spectral theory
Nadia S. Larsen, Alina Vdovina

TL;DR
This paper introduces higher-dimensional digraphs derived from cube complexes, explores their spectral properties, and constructs new models of small categories with applications to Cuntz-Krieger algebras and Ramanujan graphs.
Contribution
It defines $k$-dimensional digraphs, develops their spectral theory, and constructs novel $k$-graphs from cube complexes, leading to new models and spectral gap results.
Findings
Constructed new series of $k$-graphs from cube complexes.
Established spectral properties and optimal spectral gaps for Ramanujan $k$-graphs.
Connected $k$-graphs to rank-$k$ Cuntz-Krieger algebras.
Abstract
We define -dimensional digraphs and initiate a study of their spectral theory. The -dimensional digraphs can be viewed as generating graphs for small categories called -graphs. Guided by geometric insight, we obtain several new series of -graphs using cube complexes covered by Cartesian products of trees, for . These -graphs can not be presented as virtual products, and constitute novel models of such small categories. The constructions yield rank- Cuntz-Krieger algebras for all . We introduce Ramanujan -graphs satisfying optimal spectral gap property, and show explicitly how to construct the underlying -digraphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Algebraic structures and combinatorial models · Advanced Topics in Algebra
