Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.11138 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912708927946752 |
|---|---|
| author | Andreotti, Eleonora |
| author_facet | Andreotti, Eleonora |
| contents | Lattice structures play a central role in spectral graph theory, offering analytical insight into diffusion, synchronization, and transport processes on regular discrete spaces. While their spectral properties are completely characterized in the classical graph setting, an extension to hypergraphs, where interactions involve more than two nodes, remains largely unexplored in the matrix-based formulation. In this work, we generalize the notion of a lattice to the hypergraph framework and study its Laplacian spectra under two alternative definitions: the clique Laplacian, obtained through pairwise projection, and the hyperedge-based Laplacian, defined via normalized hyperedge incidences. For both definitions, we derive the corresponding Laplacian matrices, analyze their eigenvalue spectra, and discuss how they reflect the underlying topological and dynamical structure of the hyperlattice. Our main result is a theorem giving a full spectral characterization in the periodic case, together with a Toeplitz-type open analogue whose spectrum retains a separable trigonometric structure. The obtained eigenvalues are expressed explicitly in terms of the hyperedge size, the number of directional families, and the lattice side length, thereby capturing how the geometry of higher-order interactions shapes the spectral structure. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_11138 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Generalizing Lattice Structures to Hypergraphs: Spectra of Clique and Hyperedge-based Laplacians Andreotti, Eleonora Combinatorics Lattice structures play a central role in spectral graph theory, offering analytical insight into diffusion, synchronization, and transport processes on regular discrete spaces. While their spectral properties are completely characterized in the classical graph setting, an extension to hypergraphs, where interactions involve more than two nodes, remains largely unexplored in the matrix-based formulation. In this work, we generalize the notion of a lattice to the hypergraph framework and study its Laplacian spectra under two alternative definitions: the clique Laplacian, obtained through pairwise projection, and the hyperedge-based Laplacian, defined via normalized hyperedge incidences. For both definitions, we derive the corresponding Laplacian matrices, analyze their eigenvalue spectra, and discuss how they reflect the underlying topological and dynamical structure of the hyperlattice. Our main result is a theorem giving a full spectral characterization in the periodic case, together with a Toeplitz-type open analogue whose spectrum retains a separable trigonometric structure. The obtained eigenvalues are expressed explicitly in terms of the hyperedge size, the number of directional families, and the lattice side length, thereby capturing how the geometry of higher-order interactions shapes the spectral structure. |
| title | Generalizing Lattice Structures to Hypergraphs: Spectra of Clique and Hyperedge-based Laplacians |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2511.11138 |