Permanents, \(\alpha\)-permanents and Sinkhorn balancing
From MaRDI portal
Publication:2259826
DOI10.1007/s00180-014-0506-1zbMath1306.65140OpenAlexW1966661758MaRDI QIDQ2259826
Publication date: 5 March 2015
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-014-0506-1
Related Items
Cites Work
- Finding all maximally-matchable edges in a bipartite graph
- The rate of convergence of Sinkhorn balancing
- Majorization, doubly stochastic matrices, and comparison of eigenvalues
- Approximating the permanent via importance sampling with application to the dimer covering problem
- Concerning nonnegative matrices and doubly stochastic matrices
- Approximating the -permanent
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Depth-First Search and Linear Graph Algorithms
- Monte Carlo strategies in scientific computing