Sequential importance sampling of binary sequences

DOI10.1007/s11222-010-9205-0zbMath1322.62204OpenAlexW2017025394MaRDI QIDQ746178

Ian H. Dinwoodie

Publication date: 16 October 2015

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

Full work available at URL: https://doi.org/10.1007/s11222-010-9205-0

zbMATH Keywords

importance samplingGroebner basissequential samplingbinary sequence

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Sequential statistical design (62L05) Solving polynomial systems; resultants (13P15)

Related Items

Vanishing configurations in network dynamics with asynchronous updates ⋮ Exact tests for singular network data

Uses Software

• R
• SINGULAR
• ergm
• BB
• networksis
• network

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating a random linear extension of a partial order
• Maximum number of fixed points in regulatory Boolean networks
• Enumeration and simulation methods for 0-1 matrices with given marginals
• A deterministic algorithm for global optimization
• Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work
• Fast perfect sampling from linear extensions
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• Exact Inference for Contingency Tables with Ordered Categories
• A Nonmonotone Line Search Technique for Newton’s Method
• SINGULAR
• Statistical problems involving permutations with restricted positions
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• Monte Carlo strategies in scientific computing