Skip to main content

Spectral Gap for Complete Graphs: Upper and Lower Estimates

  • Conference paper
Mathematical Technology of Networks

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 128))

  • 898 Accesses

Abstract

Lower and upper estimates for the spectral of the Laplacian on a compact metric graph are discussed. New upper estimates are presented and existing lower estimates are reviewed. The accuracy of these estimates is checked in the case of complete (not necessarily regular) graph with large number of vertices.

The author was supported in part by Swedish Research Council Grant #50092501.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alon, N.: Eigenvalues and expanders. Combinatorica 6, 83–96 (1986)

    Article  MathSciNet  Google Scholar 

  2. Berkolaiko, G., Kuchment, P.: Introduction to Quantum Graphs. American Mathematical Society, Providence (2013)

    Google Scholar 

  3. Cheeger, J.: A lower bound for the smallest eigenvalue of the Laplacian. In: Gunning, R.C. (ed.) Problems in Analysis, pp. 195–199. Princeton University Press, New Jersey (1970)

    Google Scholar 

  4. Friedlander, L.: Extremal properties of eigenvalues for a metric graph. Ann. Inst. Fourier Grenoble 55(1), 199–211 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kurasov, P.: Quantum graphs: spectral theory and inverse problems (in print)

    Google Scholar 

  6. Kurasov, P.: On the spectral gap for Laplacians on Metric graphs. Acta Phys. Pol. A 124, 1060–1062 (2013)

    Article  Google Scholar 

  7. Kurasov, P., Naboko, S.: Rayleigh estimates for differential operators on graphs. J. Spectral Theory 4, 211–219 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kurasov, P., Suhr, R.: Cheeger estimates for quantum graphs (in preparation)

    Google Scholar 

  9. Nicaise, S.: Spectre des réseaux topologiques finis. (French) [The spectrum of finite topological networks]. Bull. Sci. Math. (2) 111(4), 401–413 (1987)

    Google Scholar 

  10. Post, O.: Spectral analysis of metric graphs and related spaces. In: Limits of Graphs in Group Theory and Computer Science, pp. 109–140. EPFL Press, Lausanne (2009)

    Google Scholar 

  11. Post, O.: Spectral Analysis on Graph-Like Spaces. Lecture Notes in Mathematics, vol. 2039. Springer, Heidelberg (2012)

    Google Scholar 

Download references

Acknowledgements

The author would like to thank Delio Mugnolo for organizing an extremely stimulating conference in Bielefeld. Many thanks go to Olaf Post for discussions concerning Cheeger estimate (4), which was proved by Rune Suhr [8]. The author is grateful to anonymous referee for correcting inaccuracies and fruitful remarks.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pavel Kurasov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kurasov, P. (2015). Spectral Gap for Complete Graphs: Upper and Lower Estimates. In: Mugnolo, D. (eds) Mathematical Technology of Networks. Springer Proceedings in Mathematics & Statistics, vol 128. Springer, Cham. https://doi.org/10.1007/978-3-319-16619-3_8

Download citation

Publish with us

Policies and ethics