Monte Carlo algorithms for computing -permanents

DOI10.1007/S11222-014-9491-ZMaRDI QIDQ2631360zbMATH OpenOpenAlexFDO

Authors Jun-shan Wang, Ajay Jasra

Publication date 29 July 2016

Published in Statistics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11222-014-9491-z

zbMATH Keywords

\(\alpha \)-permanentsMonte Carlorelative variance

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical linear algebra (65F99)

Recommendations

• Approximating the  -permanent
• An analysis of Monte Carlo algorithm for estimating the permanent
• scientific article; zbMATH DE number 4131659
• Estimating the permanent by importance sampling from a finite population
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.

Cites work

• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
• An Introduction to the Theory of Point Processes
• Approximating the  -permanent
• Geometric bounds for eigenvalues of Markov chains
• scientific article; zbMATH DE number 5919872 (Why is no real title available?)
• scientific article; zbMATH DE number 2106098 (Why is no real title available?)
• On the convergence of adaptive sequential Monte Carlo methods
• Sampling binary contingency tables with a greedy start
• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• Sequential Monte Carlo Samplers
• The permanental process
• The pseudo-marginal approach for efficient Monte Carlo computations
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice

Cited in

(7)

• Monte Carlo circuits for the abelian permutation group intersection problem
• Employing the MCMC technique to compute the projection depth in high dimensions
• Estimating the permanent by importance sampling from a finite population
• Using the Monte Carlo method for fast simulation of the number of ``good permutations on the SCIT-4 multiprocessor computer complex
• Approximating the  -permanent
• Monte-Carlo approximation algorithms for enumeration problems
• A note on random walks with absorbing barriers and sequential Monte Carlo methods

This page was built for publication: Monte Carlo algorithms for computing \(\alpha \)-permanents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631360)