Permanental generating functions and sequential importance sampling

DOI10.1016/j.aam.2019.05.004zbMath1464.62363OpenAlexW2947903189MaRDI QIDQ2020025

Ronald L. Graham, Persi Diaconis, Fan R. K. 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)

Related Items

Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs, A Sequential Importance Sampling Algorithm for Counting Linear Extensions, Efficient generation of random derangements with the expected distribution of cycle lengths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics and complexity of partition functions
• Permanents in probability and statistics
• On fixed points of permutations.
• On the permanents of complements of the direct sum of identity matrices
• The sample size required in importance sampling
• A random walk on the rook placements on a Ferrers board
• Monte Carlo strategies in scientific computing.
• Analytic Combinatorics in Several Variables
• The Bethe Permanent of a Nonnegative Matrix
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Sequential Importance Sampling for Estimating the Number of Perfect Matchings in Bipartite Graphs: An Ongoing Conversation with Laci
• The Complexity of Enumeration and Reliability Problems
• On the Switch Markov Chain for Perfect Matchings
• Statistical problems involving permutations with restricted positions