Skip to content
DraconiticResearch
Search Sources API
189,280 studies31 sourcesUpdated 43 min ago
PreprintarXiv licencearXiv

A finite threshold for the double-comet conjecture

  • Dongxiu Cai
  • Zhenbo Chen
  • Xiao-Dong Zhang
Open at sourcePDFDOICite

Abstract

For a tree T, let 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≥200 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.

Related

  1. Double Gravity-Assist Rendezvous Trajectory to Halley's Comet Using Deep-Space Low Thrust
    Roberto Flores, Alessandro Beolchi, Chiara Pozzi +4
    arXivPreprintCC BY 4.0Full textInstrumentation & methodsPlanetary science & exoplanetsarXiv
  2. Beyond Liu's 0.382709 threshold for the union-closed sets conjecture
    Simone Costa, Ankan Sadhu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948
    Cun-Quan Zhang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. An orthogonality inequality in ℝℙn−1 and the double-cap conjecture
    Allen Ibiapina, Carlos Gomes, Alan Pio +2
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  5. The satisfiability threshold of random linear equations over finite commutative rings
    Pu Gao, Theodore Morrison
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{cai2026finite,
  title = {{A finite threshold for the double-comet conjecture}},
  author = {Dongxiu Cai and Zhenbo Chen and Xiao-Dong Zhang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.02913},
  eprint = {2610.02913},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.02913},
}
RIS
TY  - UNPB
TI  - A finite threshold for the double-comet conjecture
AU  - Dongxiu Cai
AU  - Zhenbo Chen
AU  - Xiao-Dong Zhang
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.02913
UR  - https://arxiv.org/abs/2610.02913
AB  - For a tree T, let 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≥200 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.
ER  -