research

Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues

Authors
Publication date
6 December 2018
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Doi
    View on arXiv

    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 due to Muckenhoupt

      Similar works

      Full text

      thumbnail-image

      Available Versions

      Dagstuhl Research Online Publication Server

      redirect
      oaioai:drops-oai.dagstuhl.de:1122...
      Last time updated on 19/10/2019