The switch Markov chain for sampling irregular graphs and digraphs (Q1704570): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1701.07101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of graphs and a random graph with a given degree sequence / 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: Uniform Sampling of Digraphs with a Fixed Degree Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Monte Carlo significance tests / 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: Sampling Regular Graphs and a Peer-to-Peer Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic algorithms for sampling from conditional distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of graphs with a heavy-tailed degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The switch Markov chain for sampling irregular graphs (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random dense bipartite graphs and directed graphs with specified degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast uniform generation of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697457 / 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: Q4262220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3343999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs of Dense Random Graphs with Specified Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform generation of random regular graphs of moderate degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\) / 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: Q4365843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Matrices of Zeros and Ones / 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: Generating Random Regular Graphs Quickly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of graphical sequences and unigraphs / rank
 
Normal rank

Latest revision as of 07:02, 15 July 2024

scientific article
Language Label Description Also known as
English
The switch Markov chain for sampling irregular graphs and digraphs
scientific article

    Statements

    The switch Markov chain for sampling irregular graphs and digraphs (English)
    0 references
    0 references
    0 references
    12 March 2018
    0 references
    Markov chain
    0 references
    graph
    0 references
    directed graph
    0 references
    degree sequence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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