A Harnack inequality for homogeneous graphs and subgraphs
DOI10.4310/CAG.1994.V2.N4.A6zbMATH Open0834.05038MaRDI QIDQ1904293FDOQ1904293
Authors: Fan Chung, Shing-Tung Yau 
Publication date: 19 December 1995
Published in: Communications in Analysis and Geometry (Search for Journal in Brave)
Recommendations
distanceeigenfunctionsMarkov chainsadjacency matrixdiameterHarnack inequalityLaplacianlower boundabelian groupinvariantstrongly convexNeumann eigenvaluessubgraphsisotropy grouphomogeneous graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cited In (16)
- Gelfand's inverse problem for the graph Laplacian
- A note on Neumann problems on graphs
- Harnack and mean value inequalities on graphs
- Ricci curvature of graphs
- Evolution problems of Leray-Lions type with nonhomogeneous Neumann boundary conditions in metric random walk spaces
- Curvature, diameter and signs of graphs
- On graph parameters guaranteeing fast sandpile diffusion
- Title not available (Why is that?)
- An improved Harnack inequality for Dirichlet eigenvalues of abelian homogeneous graphs
- Harnack's inequality for Stokes graph
- Logarithmic Harnack inequalities for homogeneous graphs
- Eigenvalue estimates on a connected finite graph
- Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs
- Neumann Cheeger constants on graphs
- A strong Harnack inequality for graphs
- Harnack type inequality on graphs
This page was built for publication: A Harnack inequality for homogeneous graphs and subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904293)
