Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Permanents, alpha-permanents and Sinkhorn balancing

Published

Author(s)

F Sullivan, Isabel M. Beichl

Abstract

The method of Sinkhorn balancing that starts with a non-negative square matrix and iterates to produce a related doubly stochastic matrix has been used with some success to estimate the values of the permanent in some cases of physical interest, However it is often claimed that Sinkhorn balancing is slow to converge and hence not useful for efficient computation. In this paper we ex[plain how some simple low cost pre-processing allows one to guarantee that Singhorn balancing always converges linearly. We illustrate this approach by efficiently and accurately computing permanents and alpha-permanents of some previously studied matrices.
Citation
Computational Statistics
Volume
29
Issue
9

Keywords

permanent, alpha-permanent, Sinkhorn balancing, sequential importance sampling

Citation

Sullivan, F. and Beichl, I. (2014), Permanents, alpha-permanents and Sinkhorn balancing, Computational Statistics, [online], https://doi.org/10.1007/s00180-014-0506-1 (Accessed July 27, 2021)
Created June 28, 2014, Updated November 10, 2018