Geometry and spectrum of rapidly branching graphs
DOI10.1002/mana.201400349zbMath1350.05108arXiv1411.1992OpenAlexW2963892347MaRDI QIDQ2832677
Matthias Keller, Felix Pogorzelski, Florentin Münch
Publication date: 11 November 2016
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.1992
eigenvalue asymptoticsdiscrete spectrumstochastic completenessisoperimetric estimatesgraph Laplacians
Spectral problems; spectral geometry; scattering theory on manifolds (58J50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Difference operators (39A70) Vertex degrees (05C07) Infinite graphs (05C63)
Related Items (1)
Cites Work
- Unnamed Item
- Volume growth, spectrum and stochastic completeness of infinite graphs
- On stochastic completeness of jump processes
- Sectional curvature of polygonal complexes with planar substructures
- Stochastic incompleteness for graphs and weak Omori-Yau maximum principle
- Denumerable Markov processes and the associated contraction semigroups on l
- On boundaries and lateral conditions for the Kolmogorov differential equations
- Isoperimetric inequalities, growth, and the spectrum of graphs
- Some relations between analytic and geometric properties of infinite graphs
- On the norms of the random walks on planar graphs
- The Laplacian on rapidly branching trees
- Hardy inequality and asymptotic eigenvalue distribution for discrete Laplacians
- A note on the volume growth criterion for stochastic completeness of weighted graphs
- Volume growth and spectrum for general graph Laplacians
- The essential spectrum of the Laplacian on rapidly branching tessellations
- Unbounded Laplacians on Graphs: Basic Spectral Properties and the Heat Equation
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
- Heat kernel and essential spectrum of infinite graphs
- Volume growth and stochastic completeness of graphs
This page was built for publication: Geometry and spectrum of rapidly branching graphs