Intrinsic Metrics on Graphs: A Survey

From MaRDI portal
Publication:2803986

DOI10.1007/978-3-319-16619-3_7zbMATH Open1335.05058arXiv1407.7453OpenAlexW1495990589MaRDI QIDQ2803986FDOQ2803986

Matthias Keller

Publication date: 3 May 2016

Published in: Mathematical Technology of Networks (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1407.7453




Recommendations



Cites Work


Cited In (27)





This page was built for publication: Intrinsic Metrics on Graphs: A Survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803986)