English
Related papers

Related papers: An interesting spectral gap problem, from Jim Fill

200 papers

The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…

Mathematical Physics · Physics 2009-11-10 Peter Kuchment

We report on some recent developments in the search for optimal network topologies. First we review some basic concepts on spectral graph theory, including adjacency and Laplacian matrices, and paying special attention to the topological…

Other Condensed Matter · Physics 2007-05-23 Luca Donetti , Franco Neri , Miguel A. Munoz

We study the spectral gap of the Erd\H{o}s--R\'enyi random graph through the connectivity threshold. In particular, we show that for any fixed $\delta > 0$ if $$p \ge \frac{(1/2 + \delta) \log n}{n},$$ then the normalized graph Laplacian of…

Combinatorics · Mathematics 2019-07-16 Christopher Hoffman , Matthew Kahle , Elliot Paquette

In [Discrete Mathematics 306 (2005) 153-158], So proposed a conjecture saying that integral circulant graphs with different connection sets have different spectra. This conjecture is still open. We prove that this conjecture holds for…

Combinatorics · Mathematics 2024-02-07 Hao Li , Xiaogang Liu

In this paper we address the question of the existence of a spectral gap in a class of local Hamiltonians. These Hamiltonians have the following properties: their ground states are known exactly; all equal-time correlation functions of…

Strongly Correlated Electrons · Physics 2008-11-27 Michael Freedman , Chetan Nayak , Kirill Shtengel

Algorithmic information theory roots the concept of information in computation rather than probability. These lecture notes were constructed in conjunction with the graduate course I taught at Universit\`a della Svizzera italiana in the…

Information Theory · Computer Science 2025-04-29 Charles Alexandre Bédard

Strong refutation of random CSPs is a fundamental question in theoretical computer science that has received particular attention due to the long-standing gap between the information-theoretic limit and the computational limit. This gap is…

Data Structures and Algorithms · Computer Science 2020-08-11 Kwangjun Ahn

In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…

Combinatorics · Mathematics 2013-05-17 Henning Bruhn , Pierre Charbit , Oliver Schaudt , Jan Arne Telle

This is a non-standard paper, containing some problems, mainly in model theory, which I have, in various degrees, been interested in. Sometimes with a discussion on what I have to say; sometimes, of what makes them interesting to me,…

Logic · Mathematics 2007-05-23 Saharon Shelah

Recent work in the information sciences, especially informetrics and scientometrics, has made substantial contributions to the development of new metrics that eschew the intrinsic biases of citation metrics. This work has tended to employ…

Social and Information Networks · Computer Science 2025-10-17 Himanshu Yadav , Thomas Bryan Smith , Peter Bubenik , Christopher McCarty

This paper derives exponential tail bounds and polynomial moment inequalities for the spectral norm deviation of a random matrix from its mean value. The argument depends on a matrix extension of Stein's method of exchangeable pairs for…

Probability · Mathematics 2013-05-06 Daniel Paulin , Lester Mackey , Joel A. Tropp

We consider one-dimensional chains and multi-dimensional networks of harmonic oscillators coupled to two Langevin heat reservoirs at different temperatures. Each particle interacts with its nearest neighbors by harmonic potentials and all…

Mathematical Physics · Physics 2020-09-15 Simon Becker , Angeliki Menegaki

Sequential learning with feedback graphs is a natural extension of the multi-armed bandit problem where the problem is equipped with an underlying graph structure that provides additional information - playing an action reveals the losses…

Machine Learning · Computer Science 2023-06-06 Tomáš Kocák , Alexandra Carpentier

This review summarizes the recent developments in topological string theory from the author's perspective, mostly focused on aspects of research in which the author is involved. After a brief overview of the theory, we discuss two aspects…

High Energy Physics - Theory · Physics 2019-01-15 Min-xin Huang

This is an exposition of the contributions of L\'aszl\'o Lov\'asz to mathematics and computer science written on the occasion of the bestowal of the Abel Prize~2021 to him. Our survey, of course, cannot be exhaustive. We sketch remarkable…

History and Overview · Mathematics 2023-03-16 Martin Grötschel , Jaroslav Nešetřil

In 1998, Reed conjectured that for any graph $G$, $\chi(G) \leq \lceil \frac{\omega(G) + \Delta(G)+1}{2}\rceil$, where $\chi(G)$, $\omega(G)$, and $\Delta(G)$ respectively denote the chromatic number, the clique number and the maximum…

Discrete Mathematics · Computer Science 2012-10-30 Jean-Luc Fouquet , Jean-Marie Vanherpe

We show that the spectral-gap of a general zero range process can be controlled in terms of the spectral-gap of a single particle. This is in the spirit of Aldous' famous spectral-gap conjecture for the interchange process. Our main…

Probability · Mathematics 2019-08-09 Jonathan Hermon , Justin Salez

A macroscopic quantum state that is characterized by an energy gap in the electronic spectrum and occurs in organic structural components of the cell is hypothesized to provide a basis for the phenomenon of life. The width of the band gap…

General Physics · Physics 2022-02-01 A. M. Smolovich

Many graph properties (e.g., connectedness, containing a complete subgraph) are known to be difficult to check. In a decision-tree model, the cost of an algorithm is measured by the number of edges in the graph that it queries. R. Karp…

Combinatorics · Mathematics 2013-06-11 Carl A. Miller

The Odd Hadwiger's conjecture, formulated by Gerards and Seymour in 1995, is a substantial strengthening of Hadwiger's famous coloring conjecture from 1943. We investigate whether the hierarchy of topological lower bounds on the chromatic…

Combinatorics · Mathematics 2024-01-03 Raphael Steiner