The flip Markov chain for connected regular graphs (Q1720312): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Expanders via Local Edge Flips / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of labeled graphs with given degree sequences / 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: The flip markov chain and a randomising P2P protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison theorems for reversible Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3586724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262220 / 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: Q3942995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263664 / rank
 
Normal rank

Revision as of 02:57, 18 July 2024

scientific article
Language Label Description Also known as
English
The flip Markov chain for connected regular graphs
scientific article

    Statements

    The flip Markov chain for connected regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Markov chain
    0 references
    graph
    0 references
    connected graph
    0 references
    regular graph
    0 references

    Identifiers