相关论文: Volume Growth, Spectrum and Stochastic Completenes…
The goal of this article is to survey various results concerning stochastic completeness of graphs. In particular, we present a variety of formulations of stochastic completeness and discuss how a discrepancy between uniqueness class and…
We prove estimates relating exponential or sub-exponential volume growth of weighted graphs to the bottom of the essential spectrum for general graph Laplacians. The volume growth is computed with respect to a metric adapted to the…
We survey geometric properties which imply the stochastic incompleteness of the minimal diffusion process associated to the Laplacian on manifolds and graphs. In particular, we completely characterize stochastic incompleteness for…
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…
In this thesis, we analyze the stochastic completeness of a heat kernel on graphs which is a function of three variables: a pair of vertices and a continuous time, for infinite, locally finite, connected graphs. For general graphs, a…
In this note we give asymptotic estimates for the volume growth associated to suitable infinite graphs. Our main application is to give an asymptotic estimate for volume growth associated to translation surfaces.
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.…
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…
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…
Given the variable-speed random walk on a weighted graph and a metric adapted to the structure of the random walk, we construct a Brownian motion on a closely related metric graph which behaves similarly to the VSRW and for which the…
The local spectrum of a vertex set in a graph has been proven to be very useful to study some of its metric properties. It also has applications in the area of pseudo-distance-regularity around a set and can be used to obtain quasi-spectral…
In this note we study the eigenvalue growth of infinite graphs with discrete spectrum. We assume that the corresponding Dirichlet forms satisfy certain Sobolev-type inequalities and that the total measure is finite. In this sense, the…
We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number,…
We generalize the weak Omori-Yau maximum principle to the setting of strongly local Dirichlet forms. As an application, we obtain an analytic approach to compare the stochastic completeness of a weighted graph with that of an associated…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
It has been suggested in 1999 that a certain volume growth condition for geodesically complete Riemannian manifolds might imply that the manifold is stochastically complete. This is motivated by a large class of examples and by a known…
Locally finite self-similar graphs with bounded geometry and without bounded geometry as well as non-locally finite self-similar graphs are characterized by the structure of their cell graphs. Geometric properties concerning the volume…
We study some new isoperimetric inequalities on graphs. We etablish a relation between the volume entropy (or asymptotic volume), the systole and the first Betti number of weighted graphs. We also find bounds for the volume, associated to…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$ with the property that the average of certain (low-degree) polynomials in these points coincides with the global average of the polynomial on $\mathbb{S}^{d}$. They…