Some spectral gap results

1981 ◽  
pp. 148-157
Author(s):  
B. J. Harris
Keyword(s):  
Spectral Gap

scholarly journals Spectral Gap of the Largest Eigenvalue of the Normalized Graph Laplacian

2021 ◽  
Author(s):  
Jürgen Jost ◽  
Raffaella Mulas ◽  
Florentin Münch
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Spectral Gap ◽  
Complete Bipartite Graph ◽  
Graph Laplacian ◽  
New Method ◽  
Single Edge ◽  
Largest Eigenvalue ◽  
Complement Graph ◽  
The Largest Eigenvalue

AbstractWe offer a new method for proving that the maxima eigenvalue of the normalized graph Laplacian of a graph with n vertices is at least $$\frac{n+1}{n-1}$$ n + 1 n - 1 provided the graph is not complete and that equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size $$\frac{n-1}{2}$$ n - 1 2 . With the same method, we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree, provided this is at most $$\frac{n-1}{2}$$ n - 1 2 .

scholarly journals Free partition functions and an averaged holographic duality

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Nima Afkhami-Jeddi ◽  
Henry Cohn ◽  
Thomas Hartman ◽  
Amirhossein Tajdini
Keyword(s):  
Partition Function ◽  
Spectral Gap ◽  
Central Charge ◽  
Three Dimensional ◽  
Two Dimensions ◽  
Three Dimensions ◽  
Partition Functions ◽  
General Constraints ◽  
Dimensional Gravity ◽  
Holographic Duality

Abstract We study the torus partition functions of free bosonic CFTs in two dimensions. Integrating over Narain moduli defines an ensemble-averaged free CFT. We calculate the averaged partition function and show that it can be reinterpreted as a sum over topologies in three dimensions. This result leads us to conjecture that an averaged free CFT in two dimensions is holographically dual to an exotic theory of three-dimensional gravity with U(1)c×U(1)c symmetry and a composite boundary graviton. Additionally, for small central charge c, we obtain general constraints on the spectral gap of free CFTs using the spinning modular bootstrap, construct examples of Narain compactifications with a large gap, and find an analytic bootstrap functional corresponding to a single self-dual boson.

scholarly journals Persistence of the spectral gap for the Landau–Pekar equations

2021 ◽  
Vol 111 (1) ◽  
Author(s):  
Dario Feliciangeli ◽  
Simone Rademacher ◽  
Robert Seiringer
Keyword(s):  
Initial Data ◽  
Spectral Gap ◽  
Effective Hamiltonian ◽  
Adiabatic Theorem ◽  
Strongly Coupled

AbstractThe Landau–Pekar equations describe the dynamics of a strongly coupled polaron. Here, we provide a class of initial data for which the associated effective Hamiltonian has a uniform spectral gap for all times. For such initial data, this allows us to extend the results on the adiabatic theorem for the Landau–Pekar equations and their derivation from the Fröhlich model obtained in previous works to larger times.

scholarly journals Nonzero spectral gap in several uniformly spin-2 and hybrid spin-1 and spin-2 AKLT models

2021 ◽  
Vol 3 (1) ◽  
Author(s):  
Wenhan Guo ◽  
Nicholas Pomata ◽  
Tzu-Chieh Wei
Keyword(s):  
Spectral Gap

Homogenization of the parabolic equation with periodic coefficients at the edge of a spectral gap

2021 ◽  
pp. 1-33
Author(s):  
A. R. Akhmatova ◽  
E. S. Aksenova ◽  
V. A. Sloushch ◽  
T. A. Suslina
Keyword(s):  
Parabolic Equation ◽  
Spectral Gap ◽  
Periodic Coefficients

scholarly journals Spectral gap in random bipartite biregular graphs and applications

2021 ◽  
pp. 1-39
Author(s):  
Gerandy Brito ◽  
Ioana Dumitriu ◽  
Kameron Decker Harris
Keyword(s):  
Community Detection ◽  
Adjacency Matrix ◽  
Moment Method ◽  
Coding Theory ◽  
High Probability ◽  
Spectral Gap ◽  
Matrix Completion ◽  
Full Rank ◽  
The Moment ◽  
Deterministic Matrix

Abstract We prove an analogue of Alon’s spectral gap conjecture for random bipartite, biregular graphs. We use the Ihara–Bass formula to connect the non-backtracking spectrum to that of the adjacency matrix, employing the moment method to show there exists a spectral gap for the non-backtracking matrix. A by-product of our main theorem is that random rectangular zero-one matrices with fixed row and column sums are full rank with high probability. Finally, we illustrate applications to community detection, coding theory, and deterministic matrix completion.

scholarly journals Enhancing the spectral gap of networks by node removal

2010 ◽  
Vol 82 (4) ◽  
Author(s):  
Takamitsu Watanabe ◽  
Naoki Masuda
Keyword(s):  
Spectral Gap ◽  
Node Removal

On the Laplacian Eigenvalues of Gn,p

2007 ◽  
Vol 16 (6) ◽  
pp. 923-946 ◽  
Author(s):  
AMIN COJA-OGHLAN
Keyword(s):  
Random Graphs ◽  
Spectral Gap ◽  
Degree Sequences ◽  
Laplacian Eigenvalues ◽  
Combinatorial Laplacian ◽  
Laplacian Spectra

We investigate the Laplacian eigenvalues of sparse random graphs Gnp. We show that in the case that the expected degree d = (n-1)p is bounded, the spectral gap of the normalized Laplacian $\LL(\gnp)$ is o(1). Nonetheless, w.h.p. G = Gnp has a large subgraph core(G) such that the spectral gap of $\LL(\core(G))$ is as large as 1-O (d−1/2). We derive similar results regarding the spectrum of the combinatorial Laplacian L(Gnp). The present paper complements the work of Chung, Lu and Vu [8] on the Laplacian spectra of random graphs with given expected degree sequences. Applied to Gnp, their results imply that in the ‘dense’ case d ≥ ln2n the spectral gap of $\LL(\gnp)$ is 1-O (d−1/2) w.h.p.

scholarly journals Spectral Gap for the Cauchy Process on Convex, Symmetric Domains

2006 ◽  
Vol 31 (12) ◽  
pp. 1841-1878 ◽  
Author(s):  
Rodrigo Bañuelos ◽  
Tadeusz Kulczycki
Keyword(s):  
Spectral Gap ◽  
Cauchy Process
Sign in / Sign up

Export Citation Format

Share Document