Note on uniformly transient graphs
From MaRDI portal
Abstract: 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 independent pure point spectra (for ). 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.
Recommendations
- scientific article; zbMATH DE number 778035
- Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
- The Dirichlet problem at infinity for random walks on graphs with a strong isoperimetric inequality
- Isoperimetric inequalities and transient random walks on graphs
- Graphs of finite measure
Cited in
(14)- The Kazdan-Warner equation on canonically compactifiable graphs
- Riesz decompositions for Schrödinger operators on graphs
- A note on Neumann problems on graphs
- Resolutive ideal boundaries of nonlinear resistive networks
- Boundary representation of Dirichlet forms on discrete spaces
- The Feller property for graphs
- Global properties of Dirichlet forms on discrete spaces
- Coverings and the heat equation on graphs: stochastic incompleteness, the Feller property, and uniform transience
- Sobolev-type inequalities and eigenvalue growth on graphs with finite measure
- Self‐adjoint and Markovian extensions of infinite quantum graphs
- Optimal Hardy weights on the Euclidean lattice
- (p, q)-biharmonic functions on networks
- Agmon estimates for Schrödinger operators on graphs
- Characterizations of canonically compactifiable graphs via intrinsic metrics and algebraic properties
This page was built for publication: Note on uniformly transient graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676062)