Skip to content
Preprint

Spectral properties of aperiodic metric and discrete graphs

Aug 2026 · 1 citation
Physics Mathematics

Abstract

In this thesis, we study the spectral properties of dynamically defined aperiodic metric and discrete graphs. Our goal is to determine to what extent spectral properties of discrete one-dimensional ergodic Schr\"odinger operators persist when the aperiodicity is manifested through the geometry rather than through a potential. The graphs considered here are inspired by one-dimensional aperiodic tilings, and are called tiling graphs and decorated $\mathbb{Z}$-graphs. For a large family of metric tiling graphs equipped with the standard Laplacian, we show that the spectrum is of zero Lebesgue measure, and is a generalized Cantor set up to a possible discrete set of energies. For decorated $\mathbb{Z}$-graphs, we further show that for a Baire-generic and Lebesgue almost-sure choice of the decoration edge lengths, the spectrum is a generalized Cantor set. We then study the integrated density of states (IDS) for metric and discrete decorated $\mathbb{Z}$-graphs. We prove a gap labelling theorem, which characterizes the set of possible values taken by the IDS inside spectral gaps. We show that the gap labels are contained in the Schwartzman group associated with the dynamical system generating the graph, up to a geometric scaling factor. Lastly, we consider the Dry Ten Martini Problem for discrete Sturmian decorated $\mathbb{Z}$-graphs, asking whether all possible values predicted by the gap labelling theorem are indeed attained by the IDS inside spectral gaps. We answer this question negatively, by identifying a large set of gap labels which are not attained due to jump discontinuities of the IDS. We then show that away from these jump discontinuities, the periodic approximants for Sturmian graphs display the same combinatorial structure as the standard Sturmian Hamiltonians, and use this to obtain an explicit characterization of the realized gap labels for Sturmian comb graphs.

View source

Similar papers

Preprint Oct 2026

Zero measure Cantor spectrum for aperiodic metric tiling graphs

We study a family of aperiodic metric graphs generated by one-dimensional tilings. We prove that, generically, the spectrum of the associated Kirchhoff Laplacian has Lebesgue measure zero and, apart from a discrete set of isolated eigenvalues, is a generalized Cantor set. For a large subclass of these graphs, we furthe...

Ram Band, Gilad Sofer · 0 citations
Preprint Aug 2026

Spectral minimal partitions of combinatorial graphs

This paper investigates spectral minimal partitions for weighted graphs, thus extending the extensive class of results that are currently available on domains and, to a lesser extent, manifolds and metric graphs. We provide a rigorous framework for analyzing graph Laplacians under Dirichlet, Neumann, and boundaryless e...

M. Hofmann, James B Kennedy, Delio Mugnolo et al. · 0 citations
Preprint Aug 2026

Structure theorems for Lichnerowicz-sharp graphs

Hypercube graphs are fundamental model spaces of positive curvature in discrete comparison geometry. Let $G$ be a finite, connected, simple, unweighted graph with Bakry--\'Emery curvature bounded below by $K$. We call $G$ Lichnerowicz-sharp if its first non-zero non-normalized Laplacian eigenvalue $\lambda_1=K$. We pro...

Yanlong Ding, Shiping Liu, Chiyu Zhou · 0 citations
Preprint Sep 2026

Generating Functions and the Entropy Hierarchy of Strongly Connected Digraphs

We present a generating-function approach to the topological entropy of finite strongly connected digraphs, working throughout with digraphs in which loops are allowed but multiple edges are excluded. Using dominant singularities of path-generating functions, we recover by new analytic--combinatorial arguments the know...

Rostislav Klech · 1 citation
Preprint Aug 2026

On Spectra of $\mathbb{T}$-Gain Digraphs

A \(\mathbb{T}\)-gain digraph is a directed graph with complex unit gains on its arcs, allowing for no restrictions on oppositely directed arcs. This framework unifies various graph types, such as signed graphs, mixed graphs, complex unit gain graphs, digraphs, and signed digraphs. The gain adjacency, Laplacian, and si...

S. Parab, Tarkeshwar Singh, M. Nagar · 0 citations
Preprint Oct 2026

Can one hear the shape of a lattice random walk?

We construct distinct high-dimensional mean-zero finite range lattice random walks having pairwise-equal return probabilities for all step counts. The same examples provide pairwise-distinct shapes of discretizations of the standard Laplacian with pairwise-equal density state functions. The main contribution is a recon...

Pieter Belmans, S. Galkin, Swarnava Mukhopadhyay · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.