Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.27725

Spectral properties of aperiodic metric and discrete graphs

Gilad Sofer
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

math-phmath.MPmath.SP

Keep this discovery

BibTeXRIS

Gilad Sofer. 2026-08-27. Spectral properties of aperiodic metric and discrete graphs. https://arxiv.org/abs/2608.27725

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph↗
arXiv2026

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph↗