Efficient importance sampling for binary contingency tables (Q2389598): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Stochastic simulation: Algorithms and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Algorithm for Generating Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling binary contingency tables with a greedy start / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative examples for sequential importance sampling of binary contingency tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient rare-event simulation for the maximum of heavy-tailed random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-dependent importance sampling for regularly varying random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-asymptotic bandwidth selection for density estimation of discrete data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to rare event simulation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted finite population sampling to maximize entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Monte Carlo Methods for Statistical Analysis of Tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional brownian motion and the boundary limits of harmonic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Importance Sampling for Stochastic Simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo strategies in scientific computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3343999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains and stochastic stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank

Revision as of 19:44, 1 July 2024

scientific article
Language Label Description Also known as
English
Efficient importance sampling for binary contingency tables
scientific article

    Statements

    Efficient importance sampling for binary contingency tables (English)
    0 references
    17 July 2009
    0 references
    approximate counting
    0 references
    bipartite graphs
    0 references
    binary tables
    0 references
    importance sampling
    0 references
    Markov processes
    0 references
    Doob \(h\)-transform
    0 references
    changes-of-measure
    0 references
    rare-event simulation
    0 references
    0 references

    Identifiers