Refine
Language
- English (17)
Is part of the Bibliography
- yes (17)
Keywords
- 26D15 (2)
- 31C20 (2)
- 35B09 (2)
- 35R02 (2)
- 39A12 (primary) (2)
- 58E35 (secondary) (2)
- Dirichlet form (2)
- Laplacian (2)
- Cheeger inequalities (1)
- Cheeger inequality (1)
Institute
Given two weighted graphs (X, b(k), m(k)), k = 1, 2 with b(1) similar to b(2) and m(1) similar to m(2), we prove a weighted L-1-criterion for the existence and completeness of the wave operators W-+/- (H-2, H-1, I-1,I-2), where H-k denotes the natural Laplacian in l(2)(X, m(k)) w.r.t. (X, b(k), m(k)) and I-1,I-2 the trivial identification of l(2)(X, m(1)) with l(2) (X, m(2)). In particular, this entails a general criterion for the absolutely continuous spectra of H-1 and H-2 to be equal.
We study superharmonic functions for Schrodinger 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 study graphs whose vertex degree tends to infinity 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. (C) 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
We prove a version of the Hopf-Rinow theorem with respect to path metrics on discrete spaces. The novel aspect is that we do not a priori assume local finiteness but isolate a local finiteness type condition, called essentially locally finite, that is indeed necessary. As a side product we identify the maximal weight, called the geodesic weight, generating the path metric in the situation when the space is complete with respect to any of the equivalent notions of completeness proven in the Hopf-Rinow theorem. As an application we characterize the graphs for which the resistance metric is a path metric induced by the graph structure.
For a given subcritical discrete Schrodinger operator H on a weighted infinite graph X, we construct a Hardy-weight w which is optimal 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 Schrodinger operators on general weighted graphs.