A deterministic algorithm for signing bipartite graphs at the Ramanujan bound
The authors develop a deterministic polynomial-time algorithm for the Bilu--Linial signing problem on bipartite graphs.
The authors provide a deterministic solution to the Bilu--Linial signing problem, which was previously only solved using randomized methods.
Before reading this…
To understand this paper, make sure you know these concepts first:
- Graph theoryfind papers →
- Linear algebrafind papers →
Abstract
More Like ThisWe give a deterministic polynomial-time algorithm for the Bilu--Linial signing problem on bipartite graphs. For every finite simple bipartite graph of maximum degree at most an integer $Δ\ge3$, the algorithm assigns signs to its edges so that the signed adjacency matrix has operator norm strictly less than $2\sqrt{Δ-1}$. Our algorithm builds on the randomized recursive repair framework of Jadbabaie, Saberi, and Sra~\cite{JSS26}, with deterministic rules for sign selection and vertex deletion.