Sequential Monte Carlo Methods for Statistical Analysis of Tables
From MaRDI portal
Publication:5754798
DOI10.1198/016214504000001303zbMath1117.62310OpenAlexW2032262903WikidataQ58803767 ScholiaQ58803767MaRDI QIDQ5754798
Susan P. Holmes, Yuguo Chen, Persi Diaconis, Jun S. Liu
Publication date: 20 August 2007
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1198/016214504000001303
Related Items
Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs, Power analysis of independence testing for three-way contingency tables of small sizes, Some contributions to practice of 2 × 2 contingency tables, Exactly scale-free scale-free networks, Counting with Combined Splitting and Capture–Recapture Methods, Sequential Monte Carlo for counting vertex covers in general graphs, Monte Carlo algorithms for computing \(\alpha \)-permanents, Rank relations between a \(\{0, 1\}\)-matrix and its complement, Statistical enumeration of groups by double cosets, State-Dependent Kernel Selection for Conditional Sampling of Graphs, The sample size required in importance sampling, Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra, Efficient importance sampling for binary contingency tables, On the Importance Sampling of Self-Avoiding Walks, Simple existence conditions for zero-one matrices with at most one structural zero in each row and column, Exact sampling and counting for fixed-margin matrices, Possible numbers of \(x\)'s in an \(\{x, y\}\)-matrix with a given rank, A sequential algorithm for generating random graphs, Estimating the number of zero-one multi-way tables via sequential importance sampling, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins, Exact inference in contingency tables via stochastic approximation Monte Carlo, Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities, ROhAN: row-order agnostic null models for statistically-sound knowledge discovery, Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, Hit and run as a unifying device, Inclusion matrices for rainbow subsets, Negative examples for sequential importance sampling of binary contingency tables, Asymptotic enumeration of integer matrices with large equal row and column sums, Without-replacement sampling for particle methods on finite state spaces, Efficient generation of random derangements with the expected distribution of cycle lengths, Lower bounds for contingency tables via Lorentzian polynomials, Markov bases for typical block effect models of two-way contingency tables, Sampling contingency tables, Sequential Importance Sampling for Estimating the Number of Perfect Matchings in Bipartite Graphs: An Ongoing Conversation with Laci, Perfect sampling on contingency tables with an application to SAGE data, Testing goodness of fit of random graph models, Rejection sampling of bipartite graphs with given degree sequence, A note on random walks with absorbing barriers and sequential Monte Carlo methods, Sampling hypergraphs with given degrees, Configuring Random Graph Models with Fixed Degree Sequences, New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling, Characterizing optimal sampling of binary contingency tables via the configuration model, Limiting properties of an equiprobable sampling scheme for 0-1 matrices, Stochastic enumeration method for counting trees, Approximation of bounds on mixed-level orthogonal arrays, Uniformly Generating Origin Destination Tables, Estimating Latent Processes on a Network From Indirect Measurements, On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries, Counting subsets of contingency tables, Exact tests for the Rasch model via sequential importance sampling, Sequential importance sampling for multiway tables, Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes, An approximation algorithm for counting contingency tables, Hybrid schemes for exact conditional inference in discrete exponential families, An efficient MCMC algorithm to sample binary matrices with fixed marginals, Size estimation of key populations in the HIV epidemic in eSwatini using incomplete and misaligned capture-recapture data, The Markov chain Monte Carlo revolution, Connecting the latent multinomial, Bootstrapping on undirected binary networks via statistical mechanics, A Rate and History-Preserving Resampling Algorithm for Neural Spike Trains, Sequential importance sampling of binary sequences, Randomization methods for assessing data analysis results on real‐valued matrices, Generating Random Networks Without Short Cycles, Efficient Bayesian analysis of multivariate aggregate choices, Bayesian conditional inference for Rasch models, An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums, Constrained Markovian dynamics of random graphs, Sampling \(k\)-partite graphs with a given degree sequence, Random sampling of contingency tables via probabilistic divide-and-conquer, A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix, Exact tests for singular network data
Uses Software
