A Harnack inequality for homogeneous graphs and subgraphs

DOI10.4310/CAG.1994.v2.n4.a6zbMath0834.05038MaRDI QIDQ1904293

Fan R. K. Chung, Shing Tung Yau

Publication date: 19 December 1995

Published in: Communications in Analysis and Geometry (Search for Journal in Brave)

zbMATH Keywords

Harnack inequalityMarkov chainseigenfunctionsdistancediameteradjacency matrixinvariantlower boundLaplacianabelian groupisotropy groupstrongly convexNeumann eigenvaluessubgraphshomogeneous graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (9)

A note on Neumann problems on graphs ⋮ Evolution problems of Leray-Lions type with nonhomogeneous Neumann boundary conditions in metric random walk spaces ⋮ Gelfand's inverse problem for the graph Laplacian ⋮ Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs ⋮ Neumann Cheeger constants on graphs ⋮ Unnamed Item ⋮ On graph parameters guaranteeing fast sandpile diffusion ⋮ Eigenvalue estimates on a connected finite graph ⋮ Ricci curvature of graphs

This page was built for publication: A Harnack inequality for homogeneous graphs and subgraphs