Eigenvalue inequalities for graphs and convex subgraphs
type: Item
instance of: scholarly article
title: Eigenvalue inequalities for graphs and convex subgraphs
zbMATH Open document ID: 0902.05047
published in: Communications in Analysis and Geometry
publication date: 1998-09-30T00:00:00Z
review text: For an induced subgraph of a graph the authors show a lower bound for its Neumann eigenvalue in terms of the heat kernel and vertex degrees. This yields a lower bound of eigenvalues for convex subgraphs of a Riemannian manifold. This bound is useful for bounding the rates of convergence for several random walk problems, which, in turn, finds applications in many enumeration problems.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 60G50
zbMATH DE Number: 1164158
zbMATH Keywords: eigenvalues
zbMATH Keywords: heat kernels
zbMATH Keywords: manifolds
zbMATH Keywords: convex subgraphs
zbMATH Keywords: random walks
author: Fan Chung
author: Shing-Tung Yau
reviewed by: Andrzej Ruciński
MaRDI profile type: Publication
full work available at URL: cag.1997.v5.n4.a1
OpenAlex ID: W2690240663
DOI: 10.4310/CAG.1997.V5.N4.A1
description: scientific article; zbMATH DE number 1164158