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

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. This result is tight up to a change in the value of the constant C. We also use our transfer theorem to 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.
Fichier principal
Vignette du fichier
RR-8673.pdf (649.59 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 1

Citer

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

Partager

Gmail Facebook X LinkedIn More