English

Harmonic analysis invariants for infinite graphs via operators and algorithms

Combinatorics 2020-10-26 v1 Dynamical Systems Functional Analysis

Abstract

We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral invariants. We focus on particular classes of infinite graphs, including such weighted graphs which arise in electrical network models, as well as new diagrammatic graph representations. We further stress some direct parallels between our present analysis on infinite graphs, on the one hand, and, on the other, specific areas of potential theory, Fourier duality, probability, harmonic functions, sampling/interpolation, and boundary theory. With the use of limit constructions, finite to infinite, and local to global, we outline how our results for infinite graphs may be viewed as extensions of Shannon's theory: Starting with a countable infinite graph GG, and a suitable fixed positive weight function, we show that there are certain continua (certain ambient sets XX) extending GG, and associated notions of interpolation for (Hilbert spaces of) functions on XX from their restrictions to the discrete graph GG.

Keywords

Cite

@article{arxiv.2010.12442,
  title  = {Harmonic analysis invariants for infinite graphs via operators and algorithms},
  author = {Sergey Bezuglyi and Palle E. T. Jorgensen},
  journal= {arXiv preprint arXiv:2010.12442},
  year   = {2020}
}

Comments

arXiv admin note: text overlap with arXiv:1508.01253

R2 v1 2026-06-23T19:35:37.963Z