Sequential importance sampling of binary sequences

Authors: Ian H Dinwoodie

Publish Date: 2010/10/01

Volume: 22, Issue: 1, Pages: 53-63

PDF Link

Abstract

Two sequential methods are described for sampling constrained binary sequences from partial solutions The backward method computes elimination ideals over finite fields and constructs partial solutions that extend The forward method uses numerical global optimization to determine which partial solutions extend The methods are applied to restricted orderings binary dynamics and random graphs

Keywords:

References

Search In Abstract Of Papers:

Other Papers In This Journal:

Copula regression spline models for binary outcomes
A focused information criterion for graphical models
An advancement in clustering via nonparametric density estimation
Clustering via nonparametric density estimation
Deletion diagnostics for marginal mean and correlation model parameters in estimating equations
Boosted coefficient models
Optimal SIR algorithm vs. fully adapted auxiliary particle filter: a non asymptotic analysis
Non-parametric maximum likelihood estimation of interval-censored failure time data subject to misclassification
Gaussian proposal density using moment matching in SMC methods
Bayesian inference for Heston-STAR models
Parsimonious Gaussian mixture models
Efficient estimation of variance components in nonparametric mixed-effects models with large samples
On the computation of the noncentral F and noncentral beta distribution
A new variable importance measure for random forests with missing data
Complement to a comparative analysis of heuristics for the p -median problem
Likelihood-free parallel tempering