Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues

December 06, 2018 · The Ethereal · 🏛 International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Gary L. Miller, Noel J. Walkington, Alex L. Wang arXiv ID 1812.02841 Category cs.DM: Discrete Mathematics Cross-listed cs.DS Citations 4 Venue International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Last Checked 2 months ago
Abstract
We present two graph quantities Psi(G,S) and Psi_2(G) which give constant factor estimates to the Dirichlet and Neumann eigenvalues, lambda(G,S) and lambda_2(G), respectively. Our techniques make use of a discrete Hardy-type inequality.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Discrete Mathematics