scientific article; zbMATH DE number 1133279

From MaRDI portal
Publication:4382033





The paper starts with a discussion of relations between certain analytic properties of Riemannian manifolds and their combinatorial analogs on graphs. The connection is made by the notion of ``discretization of Riemannian manifolds. The main result is a Harnack inequality for graphs. Let \(X\) be an infinite connected graph. Let \(X\) have bounded vertex degree, that is, the number of edges attached to a vertex is bounded from above by a constant \(M\) independent of the vertex. Given a vertex \(b\) in \(X\), denote the set of all vertices which can be reached from \(b\) in at most \(R\) steps by \(B_R(b)\). Let \(u\) be a positive harmonic function on \(B_{2R} (b)\). Here ``harmonic refers to the combinatorial Laplacian on \(X\). Then the Harnack inequality says \[ \sup_{B_R(b)} u\leq C \cdot \inf_{B_R (b)}u \] where \(C\) depends on \(R,M\), and Sobolev and Poincaré constants for \(B_{2R} (b)\). The proof is based on a Moser iteration. The paper concludes with a discussion of various corollaries. For the entire collection see [Zbl 0884.00043].











This page was built for publication:

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