A transfer principle and applications to eigenvalue estimates for graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Commentarii Mathematici Helvetici Année : 2018

A transfer principle and applications to eigenvalue estimates for graphs

David Cohen-Steiner
  • Fonction : Auteur
  • PersonId : 833472

Résumé

In this paper, we prove a variant of the Burger-Brooks transfer principle which, combined with recent eigenvalue bounds for surfaces, allows to obtain upper bounds on the eigenvalues of graphs as a function of their genus. More precisely, we show the existence of a universal constants C such that the k-th eigenvalue λ_k of the normalized Laplacian of a graph G of (geometric) genus g on n vertices satisfies λ_k ≤Cdmax(g+k) / kn where dmax denotes the maximum valence of vertices of the graph. Our result is tight up to a change in the value of the constant C, and improves recent results of Kelner, Lee, Price and Teng on bounded genus graphs. To show that the transfer theorem might be of independent interest, we relate eigenvalues of the Laplacian on a metric graph to the eigenvalues of its simple graph models, and discuss an application to the mesh partitioning problem, extending results of Miller-Teng-Thurston- Vavasis and Spielman-Teng to arbitrary meshes.
Fichier principal
Vignette du fichier
ACS.pdf (352.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01109634 , version 1 (26-01-2015)
hal-01109634 , version 2 (29-03-2019)

Identifiants

  • HAL Id : hal-01109634 , version 2

Citer

Omid Amini, David Cohen-Steiner. A transfer principle and applications to eigenvalue estimates for graphs. Commentarii Mathematici Helvetici, 2018. ⟨hal-01109634v2⟩
299 Consultations
342 Téléchargements

Partager

Gmail Facebook X LinkedIn More