PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 12, 20260 citationsOpen Access

The Foss Gap Theorem: Linear Cheeger Improvement via Fiedler-Oriented Lifted Markov Chains

View Full Paper
DFDavid Tom Foss

Key Points

  • The aim is to prove that the Fiedler-oriented PS-Lifted Markov chain achieves a linear spectral gap related to Cheeger conductance.
  • Analyzed the PS-Lifted Markov chain's spectral gap using Fiedler orientation.
  • Computed results on eight graph families with sizes up to 512.
  • Identified Cycle and Path graphs as counterexamples.
  • Established optimal forward probability.
  • PS-Lifted chain satisfies γ(W) ≥ c·φ(G) for a constant c ≈ 0.6.
  • On Barbell graphs, achieved γ = Θ(n⁻⁰·⁴⁰), surpassing prior bounds by a significant factor.
  • Confirmed results computationally across multiple graph structures.

Abstract

We prove that the Fiedler-oriented PS-Lifted Markov chain achieves a spectral gap that scales linearly with the Cheeger conductance of the underlying graph, eliminating the quadratic loss inherent in Cheeger's classical inequality. Specifically, for any connected graph G with Cheeger conductance φ (G), the PS-Lifted chain satisfies γ (W) ≥ c·φ (G) for a universal constant c ≈ 0. 6. On Barbell graphs, this yields γ = Θ (n⁻⁰·⁴⁰), improving the Chen-Lovász-Pak bound of Ω (n⁻¹) by a factor of n⁰·⁶⁰. The mechanism is the Fiedler orientation, which converts the undirected conductance into directed flow at rate Ω (pc·φ) per step. We verify all results computationally on eight graph families with n up to 512, identify Cycle and Path graphs as sharp counterexamples where φ → 0, and establish the optimal forward probability pc ≈ 0. 65.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

David Tom Foss (2026) studied this question.

synapsesocial.com/papers/69b25aab96eeacc4fcec8a21https://doi.org/10.5281/zenodo.18945138
Ask AI
Helpful
Bookmark
Share
View Full Paper