Eigenvalues of Graphs and Sobolev Inequalities
From MaRDI portal
Publication:4844486
DOI10.1017/S0963548300001449zbMATH Open0843.05073OpenAlexW2026443179MaRDI QIDQ4844486FDOQ4844486
Publication date: 13 August 1996
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300001449
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Combinatorial probability (60C05)
Cites Work
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Isoperimetric numbers of graphs
- Ramanujan graphs
- On the Eigenvalues of Vibrating Membranes†
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Title not available (Why is that?)
- Isoperimetric inequalities and Markov chains
Cited In (30)
- Sobolev type inequalities for compact metric graphs
- Sobolev-type inequalities and eigenvalue growth on graphs with finite measure
- Vertex-frequency analysis on graphs
- Minimal-volume shadows of cubes
- Super-localization of spatial network models
- The product of two high-frequency graph Laplacian eigenfunctions is smooth
- Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations
- A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity
- Ricci curvature of graphs
- The total variation flow in metric random walk spaces
- Eigenvalues with respect to a weight for general boundary value problems on networks
- Evolving sets, mixing and heat kernel bounds
- Minimal congestion trees
- The best constant of three kinds of discrete Sobolev inequalities on regular polyhedron
- On graph parameters guaranteeing fast sandpile diffusion
- Iterative solution of spatial network models by subspace decomposition
- The existence of extremal functions for discrete Sobolev inequalities on lattice graphs
- Multi-way dual Cheeger constants and spectral bounds of graphs
- Eigenvalue Comparison Theorems of Neumann Laplacian for Graphs.
- Gradient flows in metric random walk spaces
- The dual Cheeger constant and spectra of infinite graphs
- What do we know about the Metropolis algorithm?
- Sobolev spaces on locally finite graphs
- An interlacing technique for spectra of random walks and its application to finite percolation clusters
- Unimodular Hausdorff and Minkowski dimensions
- Title not available (Why is that?)
- \(L^p\) norms and support of eigenfunctions on graphs
- Hypercontractive inequalities via SOS, and the Frankl–Rödl graph
- Eigenvalue estimates for the p-Laplace operator on the graph
- On antipodal properties for eigenfunctions of graphs
This page was built for publication: Eigenvalues of Graphs and Sobolev Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4844486)