Approximating the -permanent
From MaRDI portal
Publication:3399076
DOI10.1093/BIOMET/ASP036zbMATH Open1206.62144OpenAlexW1903988467MaRDI QIDQ3399076FDOQ3399076
Authors: S. C. Kou, P. McCullagh 
Publication date: 29 September 2009
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/biomet/asp036
Recommendations
- Monte Carlo algorithms for computing \(\alpha \)-permanents
- Estimating the permanent by importance sampling from a finite population
- Approximating permanents of complex matrices
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- An analysis of Monte Carlo algorithm for estimating the permanent
Multivariate distribution of statistics (62H10) Monte Carlo methods (65C05) Non-Markovian processes: estimation (62M09) Sequential statistical methods (62L99)
Cited In (16)
- A model for positively correlated count variables
- Without-replacement sampling for particle methods on finite state spaces
- Estimating the permanent by importance sampling from a finite population
- A note on \(\alpha\)-permanent and loop soup
- Permanental partition models and Markovian Gibbs structures
- Testing Independence Under Biased Sampling
- Permanents, \(\alpha\)-permanents and Sinkhorn balancing
- Matrix permanent inequalities for approximating joint assignment matrices in tracking systems
- Title not available (Why is that?)
- Sequential importance sampling for estimating expectations over the space of perfect matchings
- Some algebraic identities for the \({\alpha}\)-permanent
- Remarks on the \(\alpha\)-permanent
- Approximating the permanent with fractional belief propagation
- Approximating permanents and hafnians
- An asymptotic approximation for the permanent of a doubly stochastic matrix
- Monte Carlo algorithms for computing \(\alpha \)-permanents
This page was built for publication: Approximating the -permanent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399076)
