On coupling and the approximation of the permanent

DOI10.1016/0020-0190(89)90115-4zbMath0663.65149OpenAlexW1970199091MaRDI QIDQ1115170

Milena Mihail

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90115-4

zbMATH Keywords

permanentcounting algorithmssampling schemesdense 0-1 matricesMarkov chain simulation method

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Matrices of integers (15B36) Probabilistic methods, stochastic differential equations (65C99)

Related Items

Computing the permanent by importance sampling method. ⋮ Unnamed Item ⋮ An analysis of Monte Carlo algorithm for estimating the permanent

Cites Work

• Random generation of combinatorial structures from a uniform distribution
• Strong uniform times and finite random walks
• On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
• On coupling of Markov chains
• Unnamed Item
• Unnamed Item