Displaying similar documents to “Harnack inequalities on graphs”

Random walk on graphs with regular resistance and volume growth

András Telcs (2008)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

In this paper characterizations of graphs satisfying heat kernel estimates for a wide class of space–time scaling functions are given. The equivalence of the two-sided heat kernel estimate and the parabolic Harnack inequality is also shown via the equivalence of the upper (lower) heat kernel estimate to the parabolic mean value (and super mean value) inequality.

A stability theorem for elliptic Harnack inequalities

Richard F. Bass (2013)

Journal of the European Mathematical Society

Similarity:

We prove a stability theorem for the elliptic Harnack inequality: if two weighted graphs are equivalent, then the elliptic Harnack inequality holds for harmonic functions with respect to one of the graphs if and only if it holds for harmonic functions with respect to the other graph. As part of the proof, we give a characterization of the elliptic Harnack inequality.

Cheeger inequalities for unbounded graph Laplacians

Frank Bauer, Matthias Keller, Radosław K. Wojciechowski (2015)

Journal of the European Mathematical Society

Similarity:

We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if the vertex degrees are unbounded.

Stability results for Harnack inequalities

Alexander Grigor'yan, Laurent Saloff-Coste (2005)

Annales de l’institut Fourier

Similarity:

We develop new techniques for proving uniform elliptic and parabolic Harnack inequalities on weighted Riemannian manifolds. In particular, we prove the stability of the Harnack inequalities under certain non-uniform changes of the weight. We also prove necessary and sufficient conditions for the Harnack inequalities to hold on complete non-compact manifolds having non-negative Ricci curvature outside a compact set and a finite first Betti number or just having...

On the strong metric dimension of the strong products of graphs

Dorota Kuziak, Ismael G. Yero, Juan A. Rodríguez-Velázquez (2015)

Open Mathematics

Similarity:

Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exists some shortest u-w path containing v or some shortest v-w path containing u. A set S of vertices is a strong resolving set for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong resolving set for G is called the strong metric dimension of G. It is well known that the problem of computing this invariant is NP-hard. In this...