Finding Hall Blockers by Matrix Scaling

Koyo Hayashi (), Hiroshi Hirai () and Keiya Sakabe ()
Additional contact information
Koyo Hayashi: Department of Computer Science, Graduate School of Information Science and Technology, University of Tokyo, Tokyo 113-8656, Japan
Hiroshi Hirai: Graduate School of Mathematics, Nagoya University, Nagoya 464-8602, Japan
Keiya Sakabe: Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Tokyo 113-8656, Japan

Mathematics of Operations Research, 2024, vol. 49, issue 4, 2166-2179

Abstract: Given a nonnegative matrix A = ( A i j ) , the matrix scaling problem asks whether A can be scaled to a doubly stochastic matrix D 1 A D 2 for some positive diagonal matrices D 1 , D 2 . The Sinkhorn algorithm is a simple iterative algorithm, which repeats row-normalization A i j ← A i j / ∑ j A i j and column-normalization A i j ← A i j / ∑ i A i j alternatively. By this algorithm, A converges to a doubly stochastic matrix in limit if and only if the bipartite graph associated with A has a perfect matching. This property can decide the existence of a perfect matching in a given bipartite graph G , which is identified with the 0, 1-matrix A G . Linial et al. (2000) showed that O ( n 2 log n ) iterations for A G decide whether G has a perfect matching. Here, n is the number of vertices in one of the color classes of G . In this paper, we show an extension of this result. If G has no perfect matching, then a polynomial number of the Sinkhorn iterations identifies a Hall blocker—a vertex subset X having neighbors Γ ( X ) with | X | > | Γ ( X ) | , which is a certificate of the nonexistence of a perfect matching. Specifically, we show that O ( n 2 log n ) iterations can identify one Hall blocker and that further polynomial iterations can also identify all parametric Hall blockers X of maximizing ( 1 − λ ) | X | − λ | Γ ( X ) | for λ ∈ [ 0 , 1 ] . The former result is based on an interpretation of the Sinkhorn algorithm as alternating minimization for geometric programming. The latter is on an interpretation as alternating minimization for Kullback–Leibler (KL) divergence and on its limiting behavior for a nonscalable matrix. We also relate the Sinkhorn limit with parametric network flow, principal partition of polymatroids, and the Dulmage–Mendelsohn decomposition of a bipartite graph.

Keywords: Primary: 68W40; 90C27; matrix scaling; Sinkhorn algorithm; perfect matching; Hall blockers; alternating minimization; geometric programming; information geometry; polymatroids; principal partition; Dulmage–Mendelsohn decomposition (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/moor.2022.0198 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormoor:v:49:y:2024:i:4:p:2166-2179

Access Statistics for this article

More articles in Mathematics of Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().