Eigenvalue inequalities for graphs and convex subgraphs (Q1389072)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Eigenvalue inequalities for graphs and convex subgraphs |
scientific article |
Statements
Eigenvalue inequalities for graphs and convex subgraphs (English)
0 references
30 September 1998
0 references
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.
0 references
eigenvalues
0 references
heat kernels
0 references
manifolds
0 references
convex subgraphs
0 references
random walks
0 references