Characterizing optimal sampling of binary contingency tables via the configuration model (Q4909199): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jose H. Blanchet / rank
Normal rank
 
Property / author
 
Property / author: Jose H. Blanchet / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1546163884 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1007.1214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries / 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: Generalized Monte Carlo significance tests / 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: Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient importance sampling for binary contingency tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration of dense 0-1 matrices with specified line sums / 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: Sampling contingency tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expansion properties of a random regular graph after random vertex deletions / 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: The Probability That a Random Multigraph is Simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics and random matrices with row-sum and column sum-restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank

Latest revision as of 07:10, 6 July 2024

scientific article; zbMATH DE number 6143744
Language Label Description Also known as
English
Characterizing optimal sampling of binary contingency tables via the configuration model
scientific article; zbMATH DE number 6143744

    Statements

    Characterizing optimal sampling of binary contingency tables via the configuration model (English)
    0 references
    0 references
    0 references
    0 references
    12 March 2013
    0 references
    0 references
    uniform sampling
    0 references
    0 references
    0 references