Papers
Topics
Authors
Recent
Search
2000 character limit reached

A finite threshold for the double-comet conjecture

Published 2 Oct 2026 in math.CO | (2610.02913v1)

Abstract: For a tree TT, let g(T)=λ1(T)−λ2(T)g(T)=λ_1(T)-λ_2(T) be the difference between its two largest adjacency eigenvalues. A balanced double comet is obtained by attaching equally many leaves to the two endpoints of a path. Jovović, Koledin and Stanić conjectured that such a tree attains the minimum adjacency spectral gap among trees of any fixed order. We prove that every minimizing tree of order n≥200n\ge200 is a balanced double comet. We also show that, for any finite irreducible reversible continuous-time Markov chain, the inverse spectral gap differs from the effective resistance between two states times the stationary variance of their hitting probability by at most the inverse Dirichlet gap for killing at those states. For Perron chains, we give an exact two-vertex Schur-complement formula for this resistance--variance quantity.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.