Publication:4262220
From MaRDI portal
DOI<293::AID-RSA1>3.0.CO;2-G 10.1002/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.0.CO;2-GzbMath0933.05145MaRDI QIDQ4262220
Ravindran Kannan, Prasad Tetali, Santosh Vempala
Publication date: 11 November 1999
degree sequence; score sequence; labeled tournaments; generating labeled bipartite graphs; Markov-chain algorithms
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
05C07: Vertex degrees
Related Items
New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling, Unnamed Item, Uniform sampling ofk-hypertournaments, Uniform Generation of Random Regular Graphs, Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices, Generating Maximally Disassortative Graphs with Given Degree Distribution, Constructing and sampling directed graphs with given degree sequences, Exact sampling of graphs with prescribed degree correlations, A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix, On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries, Fast uniform generation of random graphs with given degree sequences, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, Cutoff for rewiring dynamics on perfect matchings, Approximate sampling of graphs with near-\(P\)-stable degree intervals, An analytical approach to network motif detection in samples of networks with pairwise different vertex labels, A sequential algorithm for generating random graphs, On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries, A \((0,1)\)-matrix existence theorem and equivalent tiling problems with dimers and monomers, The interchange graphs of tournaments with minimum score vectors are exactly hypercubes, The polytope of win vectors, The switch Markov chain for sampling irregular graphs and digraphs, Sampling contingency tables, The flip Markov chain for connected regular graphs, Rejection sampling of bipartite graphs with given degree sequence, Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree, Sampling hypergraphs with given degrees, A review of two network curvature measures, A random walk approach to linear statistics in random tournament ensembles, A triangle process on regular graphs, A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins, Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs, The number of tournaments with the minimum number of upsets, Sampling \(k\)-partite graphs with a given degree sequence, Efficient importance sampling for binary contingency tables, Construction of all tournament matrices with prescribed row sum vector, Mixing time of the switch Markov chain and stable degree sequences, Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs, A survey of discrete methods in (algebraic) statistics for networks, Uniform Sampling of Digraphs with a Fixed Degree Sequence, Sampling Edge Covers in 3-Regular Graphs
Cites Work
