Pages that link to "Item:Q5754798"

The following pages link to Sequential Monte Carlo Methods for Statistical Analysis of Tables (Q5754798):

Displaying 50 items.

• Sequential Monte Carlo for counting vertex covers in general graphs (Q294226) (← links)
• Exact sampling and counting for fixed-margin matrices (Q366999) (← links)
• Estimating the number of zero-one multi-way tables via sequential importance sampling (Q379986) (← links)
• Exact inference in contingency tables via stochastic approximation Monte Carlo (Q395934) (← links)
• Markov bases for typical block effect models of two-way contingency tables (Q450877) (← links)
• Stochastic enumeration method for counting trees (Q518856) (← links)
• A sequential algorithm for generating random graphs (Q603928) (← links)
• Perfect sampling on contingency tables with an application to SAGE data (Q665045) (← links)
• Bootstrapping on undirected binary networks via statistical mechanics (Q743427) (← links)
• Sequential importance sampling of binary sequences (Q746178) (← links)
• Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← links)
• Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs (Q820917) (← links)
• Simple existence conditions for zero-one matrices with at most one structural zero in each row and column (Q860452) (← links)
• Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities (Q892799) (← links)
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
• Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes (Q984027) (← links)
• An efficient MCMC algorithm to sample binary matrices with fixed marginals (Q998842) (← links)
• Constrained Markovian dynamics of random graphs (Q1040719) (← links)
• Exactly scale-free scale-free networks (Q1618532) (← links)
• Rank relations between a \(\{0, 1\}\)-matrix and its complement (Q1643414) (← links)
• The sample size required in importance sampling (Q1650098) (← links)
• Without-replacement sampling for particle methods on finite state spaces (Q1703864) (← links)
• Sampling contingency tables (Q1713620) (← links)
• Testing goodness of fit of random graph models (Q1736535) (← links)
• Rejection sampling of bipartite graphs with given degree sequence (Q1737401) (← links)
• Hybrid schemes for exact conditional inference in discrete exponential families (Q1786901) (← links)
• On uniform generation of two-way tables with fixed margins and the conditional volume test of Diaconis and Efron (Q1922396) (← links)
• Negative examples for sequential importance sampling of binary contingency tables (Q1945173) (← links)
• Asymptotic enumeration of integer matrices with large equal row and column sums (Q1945291) (← links)
• Sampling hypergraphs with given degrees (Q1981695) (← links)
• Size estimation of key populations in the HIV epidemic in eSwatini using incomplete and misaligned capture-recapture data (Q2044248) (← links)
• Statistical enumeration of groups by double cosets (Q2153309) (← links)
• On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) (Q2179619) (← links)
• A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins (Q2180075) (← links)
• Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting (Q2194460) (← links)
• Hit and run as a unifying device (Q2197359) (← links)
• Efficient generation of random derangements with the expected distribution of cycle lengths (Q2204174) (← links)
• Limiting properties of an equiprobable sampling scheme for 0-1 matrices (Q2244489) (← links)
• Counting subsets of contingency tables (Q2259711) (← links)
• Exact tests for the Rasch model via sequential importance sampling (Q2260062) (← links)
• Bayesian conditional inference for Rasch models (Q2316733) (← links)
• Sampling \(k\)-partite graphs with a given degree sequence (Q2326166) (← links)
• Exact tests for singular network data (Q2355171) (← links)
• Efficient importance sampling for binary contingency tables (Q2389598) (← links)
• Possible numbers of \(x\)'s in an \(\{x, y\}\)-matrix with a given rank (Q2406574) (← links)
• Sequential importance sampling for multiway tables (Q2493562) (← links)
• Monte Carlo algorithms for computing \(\alpha \)-permanents (Q2631360) (← links)
• Lower bounds for contingency tables via Lorentzian polynomials (Q2698417) (← links)
• Connecting the latent multinomial (Q2809535) (← links)
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums (Q2841356) (← links)