Permanental generating functions and sequential importance sampling

DOI10.1016/J.AAM.2019.05.004MaRDI QIDQ2020025zbMATH OpenOpenAlexFDO

Authors Persi Diaconis, Ron Graham, Fan Chung

Publication date 23 April 2021

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aam.2019.05.004

zbMATH Keywords

bipartite graphsequential importance sampling

Mathematics Subject Classification ID

Applications of graph theory (05C90) Sampling theory, sample surveys (62D05) Sequential estimation (62L12)

Recommendations

• Sequential importance sampling for estimating the number of perfect matchings in bipartite graphs: an ongoing conversation with Laci
• Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
• Sequential importance sampling for estimating expectations over the space of perfect matchings
• Exact sampling from perfect matchings of dense regular bipartite graphs
• On the random generation and counting of matchings in dense graphs

Cites work

• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• A random walk on the rook placements on a Ferrers board
• Analytic combinatorics
• Analytic combinatorics in several variables.
• Combinatorics and complexity of partition functions
• scientific article; zbMATH DE number 1175369 (Why is no real title available?)
• scientific article; zbMATH DE number 2117227 (Why is no real title available?)
• Matching theory
• Monte Carlo strategies in scientific computing.
• On fixed points of permutations.
• On the permanents of complements of the direct sum of identity matrices
• On the switch Markov chain for perfect matchings
• Permanents in probability and statistics
• Sequential importance sampling for estimating the number of perfect matchings in bipartite graphs: an ongoing conversation with Laci
• Statistical problems involving permutations with restricted positions
• The Bethe Permanent of a Nonnegative Matrix
• The Complexity of Enumeration and Reliability Problems
• The sample size required in importance sampling

Cited in

(8)

• Permuted derivative and importance-sampling estimators for regenerative simulations.
• Efficient generation of random derangements with the expected distribution of cycle lengths
• Sequential importance sampling for estimating the number of perfect matchings in bipartite graphs: an ongoing conversation with Laci
• A Sequential Importance Sampling Algorithm for Counting Linear Extensions
• Sequential importance sampling for estimating expectations over the space of perfect matchings
• Central limit theorems via analytic combinatorics in several variables
• Sequential importance sampling of binary sequences
• Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs

This page was built for publication: Permanental generating functions and sequential importance sampling

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