English
Related papers

Related papers: Exotic eigenvalues of shrinking metric graphs

200 papers

The classical random matrix theory is mostly focused on asymptotic spectral properties of random matrices as their dimensions grow to infinity. At the same time many recent applications from convex geometry to functional analysis to…

Functional Analysis · Mathematics 2014-03-05 Mark Rudelson , Roman Vershynin

Consider two quantum graphs with the standard Laplace operator and non-Robin type boundary conditions at all vertices. We show that if their eigenvalue-spectra agree everywhere aside from a sufficiently sparse set, then the…

Spectral Theory · Mathematics 2015-02-02 Ralf Rueckriemen

We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of…

Combinatorics · Mathematics 2012-02-15 Edwin R. van Dam , Gholamreza Omidi

In this work we study the asymptotic distribution of eigenvalues in one-dimensional open sets. The method of proof is rather elementary, based on the Dirichlet lattice points problem, which enable us to consider sets with infinite measure.…

Analysis of PDEs · Mathematics 2009-06-15 J. Fernandez Bonder , J. P. Pinasco , A. M. Salort

Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…

Methodology · Statistics 2020-01-27 J. F. Lutzeyer , A. T. Walden

We study properties of spectral minimal partitions of metric graphs within the framework recently introduced in [Kennedy et al, Calc. Var. 60 (2021), 61]. We provide sharp lower and upper estimates for minimal partition energies in…

Mathematical Physics · Physics 2021-04-09 Matthias Hofmann , James B. Kennedy , Delio Mugnolo , Marvin Plümer

The main objective of the present work is to study the negative spectrum of (differential) Laplace operators on metric graphs as well as their resolvents and associated heat semigroups. We prove an upper bound on the number of negative…

Mathematical Physics · Physics 2007-05-23 Vadim Kostrykin , Robert Schrader

In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…

Combinatorics · Mathematics 2007-05-23 Dmitry Jakobson , Igor Rivin

The spectrum of the Dirichlet Laplacian on conical layers is analysed through two aspects: the infiniteness of the discrete eigenvalues and their expansions in the small aperture limit. On the one hand, we prove that, for any aperture, the…

Numerical Analysis · Mathematics 2017-11-23 Monique Dauge , Thomas Ourmières-Bonafos , Nicolas Raymond

We consider the Dirichlet Laplacian in a family of narrow unbounded domains. As the width of these domains goes to 0, we study the asymptotic behavior of the eigenvalues that lie below the essential spectrum and the asymptotic behavior of…

Spectral Theory · Mathematics 2007-10-11 Leonid Friedlander , Michael Solomyak

Given a length function on the edge set of a finite graph, we define a vertex-weight and an edge-weight in terms of it and consider the corresponding graph Laplacian. In this paper, we consider the problem of maximizing the first nonzero…

Combinatorics · Mathematics 2024-10-10 T. Gomyou , S. Nayatani

For general Riemannian foliations, spectral asymptotics of the Laplacian is studied when the metric on the ambient manifold is blown up in directions normal to the leaves (adiabatic limit). The number of ``small'' eigenvalues is given in…

Differential Geometry · Mathematics 2025-05-15 Jesus A. Alvarez Lopez , Yuri A. Kordyukov

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.

Combinatorics · Mathematics 2023-11-17 Bogdan Nica

We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…

Spectral Theory · Mathematics 2025-12-24 Kiyan Naderi , Noema Nicolussi

We study planar graphs with large negative curvature outside of a finite set and the spectral theory of Schr{\"o}dinger operators on these graphs. We obtain estimates on the first and second order term of the eigenvalue asymptotics.…

Combinatorics · Mathematics 2021-04-09 Michel Bonnefont , Sylvain Golenia , Matthias Keller

In this paper we study in detail some spectral properties of the magnetic discrete Laplacian. We identify its form-domain, characterize the absence of essential spectrum and provide the asymptotic eigenvalue distribution.

Spectral Theory · Mathematics 2014-02-24 Sylvain Golenia

We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g = 0$, i.e. if the metric graph is planar. Our results are based on…

Spectral Theory · Mathematics 2020-04-10 Marvin Plümer

We consider Laplacians on periodic equilateral metric graphs. The spectrum of the Laplacian consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite number of flat…

Spectral Theory · Mathematics 2014-01-21 Evgeny Korotyaev , Natalia Saburova

We investigate the asymptotic spectral distribution of the twisted Laplacian associated with a real harmonic 1-form on a compact hyperbolic surface. In particular, we establish a sublinear lower bound on the number of eigenvalues in a…

Spectral Theory · Mathematics 2025-04-18 Yulin Gong , Long Jin

For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which depends on the graph only through its degree and its…

Combinatorics · Mathematics 2022-02-09 Arindam Biswas , Jyoti Prakash Saha
‹ Prev 1 3 4 5 6 7 10 Next ›