The spectral geometry of infinite graphs deals with three major themes and their interplay: the spectral theory of the Laplacian, the geometry of the underlying graph, and the heat flow with its probabilistic aspects. In this book, all three themes are brought together coherently under the perspective of Dirichlet forms, providing a powerful and unified approach.

The book gives a complete account of key topics of infinite graphs, such as essential self-adjointness, Markov uniqueness, spectral estimates, recurrence, and stochastic completeness. A major feature of the book is the use of intrinsic metrics to capture the geometry of graphs. As for manifolds, Dirichlet forms in the graph setting offer a structural understanding of the interaction between spectral theory, geometry and probability. For graphs, however, the presentation is much more accessible and inviting thanks to the discreteness of the underlying space, laying bare the main concepts while preserving the deep insights of the manifold case.

Graphs and Discrete Dirichlet Spaces offers a comprehensive treatment of the spectral geometry of graphs, from the very basics to deep and thorough explorations of advanced topics. With modest prerequisites, the book can serve as a basis for a number of topics courses, starting at the undergraduate level.

We study superharmonic functions for Schrödinger operators on general weighted graphs. Specifically, we prove two decompositions which both go under the name Riesz decomposition in the literature. The first one decomposes a superharmonic function into a harmonic and a potential part. The second one decomposes a superharmonic function into a sum of superharmonic functions with certain upper bounds given by prescribed superharmonic functions. As application we show a Brelot type theorem.

We show how to deduce Rellich inequalities from Hardy inequalities on infinite graphs. Specifically, the obtained Rellich inequality gives an upper bound on a function by the Laplacian of the function in terms of weighted norms. These weights involve the Hardy weight and a function which satisfies an eikonal inequality. The results are proven first for Laplacians and are extended to Schrödinger operators afterwards.

We prove a Feynman path integral formula for the unitary group exp(−itLv,θ), t≥0, associated with a discrete magnetic Schrödinger operator Lv,θ on a large class of weighted infinite graphs. As a consequence, we get a new Kato-Simon estimate

|exp(−itLv,θ)(x,y)|≤exp(−tL−deg,0)(x,y),

which controls the unitary group uniformly in the potentials in terms of a Schrödinger semigroup, where the potential deg is the weighted degree function of the graph.

In this expository article we give an overview of recent developments in the study of optimal Hardy-type inequality in the continuum and in the discrete setting. In particular, we present the technique of the supersolution construction that yield “as large as possibleȍ Hardy weights which is made precise in terms of the notion of criticality. Instead of presenting the most general setting possible, we restrict ourselves to the case of the Laplacian on smooth manifolds and bounded combinatorial graphs. Although the results hold in far greater generality, the fundamental phenomena as well as the core ideas of the proofs become especially clear in these basic settings.

The interplay of geometry, spectral theory and stochastics has a long and fruitful history, and is the driving force behind many developments in modern mathematics. Bringing together contributions from a 2017 conference at the University of Potsdam, this volume focuses on global effects of local properties. Exploring the similarities and differences between the discrete and the continuous settings is of great interest to both researchers and graduate students in geometric analysis. The range of survey articles presented in this volume give an expository overview of various topics, including curvature, the effects of geometry on the spectrum, geometric group theory, and spectral theory of Laplacian and Schrödinger operators. Also included are shorter articles focusing on specific techniques and problems, allowing the reader to get to the heart of several key topics.

We study magnetic Schrödinger operators on graphs. We extend the notion of sparseness of graphs by including a magnetic quantity called the frustration index. This notion of magnetic-sparseness turns out to be equivalent to the fact that the form domain is an ℓ2 space. As a consequence, we get criteria of discreteness for the spectrum and eigenvalue asymptotics.

We introduce a notion of nodal domains for positivity preserving forms. This notion generalizes the classical ones for Laplacians on domains and on graphs. We prove the Courant nodal domain theorem in this generalized setting using purely analytical methods.

We study Schrödinger operators given by positive quadratic forms on infinite graphs. From there, we develop a criticality theory for Schrödinger operators on general weighted graphs.

We describe the set of all Dirichlet forms associated to a given infinitegraphin terms of Dirichlet forms on its Royden boundary. Our approach is purely analyticaland uses form methods.

Given two weighted graphs (X, b_k, m_k), k = 1,2 with b₁ ∼ b₂ and m₁ ∼ m₂, we prove a weighted L¹-criterion for the existence and completeness of the wave operators W_±(H₂, H₁, I_1,2), where H_k denotes the natural Laplacian in ℓ²(X, m_k) w.r.t. (X, b_k, m_k) and I_1,2 the trivial identification of ℓ²(X, m₁) with ℓ²(X, m₂). In particular, this entails a general criterion for the absolutely continuous spectra of H₁ and H₂ to be equal.

For a given subcritical discrete Schr\"odinger operator $H$ on a  weighted infinite graph $X$, we construct a Hardy-weight $w$ which is in the following sense. The operator $H - \lambda w$ is subcritical in $X$ for all $\lambda < 1$, null-critical in $X$ for $\lambda = 1$, and supercritical near any neighborhood of infinity in $X$ for any $\lambda > 1$.  Our results rely on a criticality theory for Schr\"odinger operators on general weighted graphs.

We study the Kazdan-Warner equation on canonically compactifiable graphs. These graphs are distinguished as analytic properties of Laplacians on these graphs carry a strong resemblance to Laplacians on open pre-compact manifolds.

We improve the classical discrete Hardy inequality

where <nobr>∞n=1</nobr> is any sequence of non-negative real numbers.

In this paper we introduce a class of polygonal complexes for which we can define a notion of sectional combinatorial curvature. These complexes can be viewed as generalizations of 2-dimensional Euclidean and hyperbolic buildings. We focus on the case of non-positive and negative combinatorial curvature. As geometric results we obtain a Hadamard-Cartan type theorem, thinness of bigons, Gromov hyperbolicity and estimates for the Cheeger constant. We employ the latter to get spectral estimates, show discreteness of the spectrum in the sense of a Donnelly-Li type theorem and present corresponding eigenvalue asymptotics. Moreover, we prove a unique continuation theorem for eigenfunctions and the solvability of the Dirichlet problem at infinity.

We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further characterization via equality of the Royden boundary and the harmonic boundary and show that the Dirichlet problem has a unique solution for such graphs. The Markov semigroups and resolvents (with Dirichlet boundary conditions) on these graphs are shown to be ultracontractive. Moreover, if the underlying measure is finite, the semigroups and resolvents are trace class and their generators have $\ell^p$ independent pure point spectra (for $1 \leq p \leq \infty$). Examples of uniformly transient graphs include Cayley graphs of hyperbolic groups as well as trees and Euclidean lattices of dimension at least three. As a surprising consequence, the Royden compactification of such lattices turns out to be the one-point compacitifcation and the Laplacians of such lattices have pure point spectrum if the underlying measure is chosen to be finite.

We present a simple observation showing that the heat kernel on a locally finite graph behaves for short times $t$ roughly like $t^d$, where $d$ is the combinatorial distance. This is very different from the classical Varadhan type behavior on manifolds. Moreover, this also gives that short time behavior and global behavior of the heat kernel are governed by two different metrics whenever the degree of the graph is not uniformly bounded.

We prove Cheeger inequalities for p-Laplacians on finite and infinite weighted graphs. Unlike in previous works, we do not impose boundedness of the vertex degree, nor do we restrict ourselves to the normalized Laplacian and, more generally, we do not impose any boundedness assumption on the geometry. This is achieved by a novel definition of the measure of the boundary which is using the idea of intrinsic metrics. For the non-normalized case, our bounds on the spectral gap of p-Laplacians are already significantly better for finite graphs and for infinite graphs they yield non-trivial bounds even in the case of unbounded vertex degree. We, furthermore, give upper bounds by the Cheeger constant and by the exponential volume growth of distance balls.

In this paper we prove a Feynman–Kac–Itô formula for magnetic Schrödinger operators on arbitrary weighted graphs. To do so, we have to provide a natural and general framework both on the operator theoretic and the probabilistic side of the equation. On the operator side we identify a very general class of potentials that allows the definition of magnetic Schrödinger operators. On the probabilistic side, we introduce an appropriate notion of stochastic line integrals with respect to magnetic potentials. Apart from linking the world of discrete magnetic operators with the probabilistic world through the Feynman–Kac–Itô formula, the insights from this paper gained on both sides should be of an independent interest. As applications of the Feynman–Kac–Itô formula, we prove a Kato inequality, a Golden–Thompson inequality and an explicit representation of the quadratic form domains corresponding to a large class of potentials.

We study graphs whose vertex degree tends and which are, therefore, called rapidly branching. We prove spectral estimates, discreteness of spectrum, first order eigenvalue and Weyl asymptotics solely in terms of the vertex degree growth. The underlying techniques are estimates on the isoperimetric constant. Furthermore, we give lower volume growth bounds and we provide a new criterion for stochastic incompleteness.

We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if the vertex degrees are unbounded.

We consider Schrödinger operators on sparse graphs. The geometric definition of sparseness turn out to be equivalent to a functional inequality for the Laplacian. In consequence, sparseness has in turn strong spectral and functional analytic consequences. Specifically, one consequence is that it allows to completely describe the form domain. Moreover, as another consequence it leads to a characterization for discreteness of the spectrum. In this case we determine the first order of the corresponding eigenvalue asymptotics.

We consider diffusion on discrete measure spaces as encoded by Markovian semigroups arising from weighted graphs. We study whether the graph is uniquely determined if the diffusion is given up to order isomorphism. If the graph is recurrent then the complete graph structure and the measure space are determined (up to an overall scaling). As shown by counterexamples this result is optimal. Without the recurrence assumption, the graph still turns out to be determined in the case of normalized diffusion on graphs with standard weights and in the case of arbitrary graphs over spaces in which each point has the same mass. These investigations provide discrete counterparts to studies of diffusion on Euclidean domains and manifolds initiated by Arendt and continued by Arendt/Biegert/ter Elst and Arendt/ter Elst. A crucial step in our considerations shows that order isomorphisms are actually unitary maps (up to a scaling) in our context.

We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of ‘relative compactness’ for such graphs and study sufficient and necessary conditions for this property in terms of various metrics. We then equip graphs satisfying this property with a finite measure and investigate the associated Laplacian and its semigroup. In this context, our results include the trace class property for the semigroup, uniqueness and existence of solutions to the Dirichlet Problem with boundary arising from the natural compactification, an explicit description of the domain of the Dirichlet Laplacian, convergence of the heat semigroup for large times as well as stochastic incompleteness and transience of the corresponding random walk in continuous time.

A few years ago various disparities for Laplacians on graphs and manifolds were discovered. The corresponding results are mostly related to volume growth in the context of unbounded geometry. Indeed, these disparities can now be resolved by using so called intrinsic metrics instead of the combinatorial graph distance. In this article we give an introduction to this topic and survey recent results in this direction. Specifically, we cover topics such as Liouville type theorems for harmonic functions, essential selfadjointness, stochastic completeness and upper escape rates. Furthermore, we determine the spectrum as a set via solutions, discuss upper and lower spectral bounds by isoperimetric constants and volume growth and study p-independence of spectra under a volume growth assumption.

Trees of finite cone type have appeared in various contexts. In particular, they come up as simplified models of regular tessellations of the hyperbolic plane. The spectral theory of the associated Laplacians can thus be seen as induced by geometry. Here we give an introduction focusing on background and then turn to recent results for (random) perturbations of trees of finite cone type and their spectral theory.

We study the p-independence of spectra of Laplace operators on graphs arising from regular Dirichlet forms on discrete spaces. Here, a sufficient criterion is given solely by a uniform subexponential growth condition. Moreover, under a mild assumption on the measure we show a one-sided spectral inclusion without any further assumptions. We study applications to normalized Laplacians including symmetries of the spectrum and a characterization for positivity of the Cheeger constant. Furthermore, we consider Laplacians on planar tessellations for which we relate the spectral p-independence to assumptions on the curvature.

We study harmonic functions on general weighted graphs which allow for a compatible intrinsic metric. We prove an Missing superscript or subscript argument Liouville type theorem which is a quantitative integral Missing superscript or subscript argument estimate of harmonic functions analogous to Karp’s theorem for Riemannian manifolds. As corollaries we obtain Yau’s Missing superscript or subscript argument-Liouville type theorem on graphs, identify the domain of the generator of the semigroup on Missing superscript or subscript argument and get a criterion for recurrence. As a side product, we show an analogue of Yau’s Missing superscript or subscript argument Caccioppoli inequality. Furthermore, we derive various Liouville type results for harmonic functions on graphs and harmonic maps from graphs into Hadamard spaces.

We consider operators arising from regular Dirichlet forms with vanishing killing term. We give bounds for the bottom of the (essential) spectrum in terms of exponential volume growth with respect to an intrinsic metric. As special cases, we discuss operators on graphs. When the volume growth is measured in the natural graph distance (which is not an intrinsic metric), we discuss the threshold for positivity of the bottom of the spectrum and finiteness of the bottom of the essential spectrum of the (unbounded) graph Laplacian. This threshold is shown to lie at cubic polynomial growth.

We study operators on rooted graphs with a certain spherical homogeneity. These graphs are called path commuting and allow for a decomposition of the adjacency matrix and the Laplacian into a direct sum of Jacobi matrices which reflect the structure of the graph. Thus, the spectral properties of the adjacency matrix and the Laplacian can be analyzed by means of the elaborated theory of Jacobi matrices. For some examples which include antitrees, we derive the decomposition explicitly and present a zoo of spectral behavior induced by the geometry of the graph. In particular, these examples show that spectral types are not at all stable under rough isometries.

We study the uniqueness of self-adjoint and Markovian exten

sions of the Laplacian

on weighted graphs. We first show that, for locally finite grap

hs and a certain family of metrics,

completeness of the graph implies uniqueness of these exten

sions. Moreover, in the case when the

graph is not metrically complete and the Cauchy boundary has

finite capacity, we characterize

the uniqueness of the Markovian extensions

We study basic spectral features of graph Laplacians associated with a class of rooted trees which contains all regular trees. Trees in this class can be generated by substitution processes. Their spectra are shown to be purely absolutely continuous and to consist of finitely many bands. The main result gives stability of the absolutely continuous spectrum under sufficiently small radially label symmetric perturbations for non-regular trees in this class. In sharp contrast, the absolutely continuous spectrum can be completely destroyed by arbitrary small radially label symmetric perturbations for regular trees in this class.

We consider multi-type Galton Watson trees that are close to a tree of finite cone type in distribution. Moreover, we impose that each vertex has at least one forward neighbor. Then, we show that the spectrum of the Laplace operator exhibits almost surely a purely absolutely continuous component which is included in the absolutely continuous spectrum of the tree of finite cone type.

We study Laplacians associated to a graph and single out a class of such operators with special regularity properties. In the case of locally finite graphs, this class consists of all selfadjoint, non-negative restrictions of the standard formal Laplacian and we can characterize the Dirichlet and Neumann Laplacians as the largest and smallest Markovian restrictions of the standard formal Laplacian. In the case of general graphs, this class contains the Dirichlet and Neumann Laplacians and we describe howthesemay differ fromeach other, characterize when they agree, and study connections to essential selfadjointness and stochastic completeness.

Finally, we study basic common features of all Laplacians associated to a graph. In particular, we characterize when the associated semigroup is positivity improving and present some basic estimates on its long term behavior. We also discuss some situations in which the Laplacian associated to a graph is unique and, in this context, characterize its boundedness.

We study the spectrum of random operators on a large class of trees. These trees have finitely many cone types and they can be constructed by a substitution rule. The random operators are perturbations of Laplace type operators either by random potentials or by random hopping terms, i.e., perturbations of the off-diagonal elements. We prove stability of arbitrary large parts of the absolutely continuous spectrum for sufficiently small but extensive disorder.

We study Laplacians on graphs and networks via regular Dirichlet forms. We give a sufficient geometric condition for essential selfadjointness and explicitly determine the generators of the associated semigroups on all ℓ^p, 1 ≦ p < ∞, in this case. We characterize stochastic completeness thereby generalizing all earlier corresponding results for graph Laplacians. Finally, we study how stochastic completeness of a subgraph is related to stochastic completeness of the whole graph.

In the framework of regular Dirichlet forms we consider operators on infinite graphs. We study the connection of the existence of solutions with certain properties and the spectrum of the operators. In particular we prove a version of the Allegretto-Piepenbrink theorem which says that positive (super)-solutions to a generalized eigenvalue equation exist exactly for energies not exceeding the infimum of the spectrum. Moreover we show a version of Shnol’s theorem, which says that existence of solutions satisfying a growth condition with respect to a given boundary measure implies that the corresponding energy is in the spectrum.

In this article, we study relations between the local geometry of planar graphs (combinatorial curvature) and global geometric invariants, namely the Cheeger constants and the exponential growth. We also discuss spectral applications.

We discuss Laplacians on graphs in a framework of regular Dirichlet forms. We focus on phenomena related to unboundedness of the Laplacians. This includes (failure of) essential selfadjointness, absence of essential spectrum and stochastic incompleteness.

In this paper, we characterize absence of the essential spectrum of the Laplacian under a hyperbolicity assumption for general graphs. Moreover, we present a characterization for absence of the essential spectrum for planar tessellations in terms of curvature.

In this note we prove an optimal volume growth condition for stochastic completeness of graphs under very mild assumptions. This is realized by proving a uniqueness class criterion for the heat equation which is an analogue to a corresponding result of Grigor’yan on manifolds. This uniqueness class criterion is shown to hold for graphs that we call globally local, i.e., graphs where we control the jump size far outside. The transfer from general graphs to globally local graphs is then carried out via so-called refinements.

In this article we prove upper bounds for the Laplace eigenvalues below the essential spectrum for strictly negatively curved Cartan–Hadamard manifolds. Our bound is given in terms of k² and specific geometric data of the manifold. This applies also to the particular case of non-compact manifolds whose sectional curvature tends to −∞, where no essential spectrum is present due to a theorem of Donnelly/Li. The result stands in clear contrast to Laplacians on graphs where such a bound fails to be true in general.