English
Related papers

Related papers: Laplace and Schr\"odinger operators without eigenv…

200 papers

A recent result of one of the authors says that every connected subcubic bipartite graph that is not isomorphic to the Heawood graph has at least one, and in fact a positive proportion of its eigenvalues in the interval [-1,1]. We construct…

Combinatorics · Mathematics 2014-04-09 Krystal Guo , Bojan Mohar

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

Combinatorics · Mathematics 2009-04-14 Julia Brown

Let $G$ be a finite group with symmetric generating set $S$, and let $c = \max_{R > 0} |B(2R)|/|B(R)|$ be the doubling constant of the corresponding Cayley graph, where $B(R)$ denotes an $R$-ball in the word-metric with respect to $S$. We…

Metric Geometry · Mathematics 2009-03-26 James R. Lee , Yury Makarychev

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that its automorphism group ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple…

Combinatorics · Mathematics 2019-08-14 Yan-Quan Feng , István Kovács , Jie Wang , Da-Wei Yang

We analyze properties of semigroups generated by Schr\"odinger operators $-\Delta+V$ or polyharmonic operators $-(-\Delta)^m$, on metric graphs both on $L^p$-spaces and spaces of continuous functions. In the case of spatially constant…

Spectral Theory · Mathematics 2020-12-11 Simon Becker , Federica Gregorio , Delio Mugnolo

We discuss Neumann problems for self-adjoint Laplacians on (possibly infinite) graphs. Under the assumption that the heat semigroup is ultracontractive we discuss the unique solvability for non-empty subgraphs with respect to the vertex…

Analysis of PDEs · Mathematics 2018-03-26 Michael Hinz , Michael Schwarz

This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…

Spectral Theory · Mathematics 2019-04-25 Marwa Balti

It is known that the spectrum of Schr\"odinger operators with sparse potentials consists of singular continuous spectrum. We give a sufficient condition so that the edge of the singular continuous spectrum is not an eigenvalue and construct…

Spectral Theory · Mathematics 2023-01-18 Kota Ujino

We consider Dirac, Pauli and Schr\"odinger quantum magnetic Hamiltonians of full rank in ${\rm L}^2 \big(\mathbb{R}^{2d} \big)$, $d \ge 1$, perturbed by non-self-adjoint (matrix-valued) potentials. On the one hand, we show the existence of…

Mathematical Physics · Physics 2018-02-13 Diomba Sambou

We construct rich families of Schr\"odinger operators on symmetric graphs, both quantum and combinatorial, whose spectral degeneracies are persistently larger than the maximal dimension of an irreducible representations of the symmetry…

Spectral Theory · Mathematics 2018-02-14 Gregory Berkolaiko , Wen Liu

We consider weighted graphs, we equip them with a metric structure given by a weighted distance, and we discuss essential self-adjointness for weighted graph Laplacians and Schr\"odinger operators in the metrically non complete case.

Spectral Theory · Mathematics 2013-03-05 Yves Colin De Verdière , Nabila Torki-Hamza , Francoise Truc

In a recent paper Gunnells, Scott and Walden have determined the complete spectrum of the Schreier graph on the symmetric group corresponding to the Young subgroup $S_{n-2}\times S_2$ and generated by initial reversals. In particular they…

Combinatorics · Mathematics 2009-11-11 Filippo Cesi

We prove that every amenable one-ended Cayley graph has an invariant spanning tree of one end. More generally, for any 1-ended amenable unimodular random graph we construct a factor of iid percolation (jointly unimodular subgraph) that is…

Probability · Mathematics 2020-05-11 Adam Timar

We consider the Schr\"odinger operator on zigzag graphs with a periodic potential. The spectrum of this operator consists of an absolutely continuous part (intervals separated by gaps) plus an infinite number of eigenvalues with infinite…

Spectral Theory · Mathematics 2007-05-23 Evgeny Korotyaev , Igor Lobanov

In recent work on equiangular lines, Jiang, Tidor, Yuan, Zhang, and Zhao showed that a connected bounded degree graph has sublinear second eigenvalue multiplicity. More generally they show that there cannot be too many eigenvalues near the…

Probability · Mathematics 2024-01-17 Mikolaj Fraczyk , Ben Hayes , Madhu Sudan , Yufei Zhao

The graphs with all equal negative or positive eigenvalues are special kind in the spectral graph theory. In this article, several iterated line graphs $\mathcal{L}^k(G)$ with all equal negative eigenvalues $-2$ are characterized for $k\ge…

Combinatorics · Mathematics 2025-11-25 Harishchandra S. Ramane , B. Parvathalu , Daneshwari Patil , K. Ashoka

We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…

Spectral Theory · Mathematics 2019-09-18 Pavel Kurasov , Jonathan Rohleder

The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. The relationship between connective constants and amenability is explored in the…

Group Theory · Mathematics 2015-11-25 Geoffrey R. Grimmett , Zhongyang Li

We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…

Functional Analysis · Mathematics 2014-12-03 Matthias Keller , Daniel Lenz , Marcel Schmidt , Radosław K. Wojciechowski

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

Spectral Theory · Mathematics 2013-08-27 Evans M. Harell , Joachim Stubbe