A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix (Q5251622): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3100769682 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.5295 / 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: On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries / 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 importance sampling for binary contingency tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general limitation on Monte Carlo algorithms of the Metropolis type / 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 Regular Graphs and a Peer-to-Peer Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximately Counting Integral Flows and Cell-Bounded Contingency Tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On realizations of a joint degree matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison theorems for reversible Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric bounds for eigenvalues of Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Mixing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / 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: Constructing and sampling directed graphs with given degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-based graph construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chain decomposition for convergence rate analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards random uniform sampling of bipartite graphs with given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between graphs and integer-pair sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing and sampling graphs with a prescribed joint degree distribution / rank
 
Normal rank

Latest revision as of 02:22, 10 July 2024

scientific article; zbMATH DE number 6437887
Language Label Description Also known as
English
A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
scientific article; zbMATH DE number 6437887

    Statements

    A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix (English)
    0 references
    0 references
    0 references
    0 references
    20 May 2015
    0 references
    graph sampling
    0 references
    joint degree matrix
    0 references
    rapidly mixing Markov chains
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references