scientific article; zbMATH DE number 1334601

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

degree sequencescore sequencelabeled tournamentsgenerating labeled bipartite graphsMarkov-chain algorithms

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Related Items (40)

Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs ⋮ Sampling Edge Covers in 3-Regular Graphs ⋮ Efficient importance sampling for binary contingency tables ⋮ On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries ⋮ Mixing time of the switch Markov chain and stable degree sequences ⋮ A sequential algorithm for generating random graphs ⋮ A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins ⋮ 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 ⋮ Generating Maximally Disassortative Graphs with Given Degree Distribution ⋮ 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 ⋮ Unnamed Item ⋮ The switch Markov chain for sampling irregular graphs and digraphs ⋮ Sampling contingency tables ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs ⋮ The flip Markov chain for connected regular graphs ⋮ On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries ⋮ Construction of all tournament matrices with prescribed row sum vector ⋮ Constructing and sampling directed graphs with given degree sequences ⋮ Rejection sampling of bipartite graphs with given degree sequence ⋮ Sampling hypergraphs with given degrees ⋮ Exact sampling of graphs with prescribed degree correlations ⋮ A review of two network curvature measures ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ Uniform sampling ofk-hypertournaments ⋮ A random walk approach to linear statistics in random tournament ensembles ⋮ Uniform Sampling of Digraphs with a Fixed Degree Sequence ⋮ Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree ⋮ A \((0,1)\)-matrix existence theorem and equivalent tiling problems with dimers and monomers ⋮ The number of tournaments with the minimum number of upsets ⋮ Uniform Generation of Random Regular Graphs ⋮ Sampling \(k\)-partite graphs with a given degree sequence ⋮ The interchange graphs of tournaments with minimum score vectors are exactly hypercubes ⋮ The polytope of win vectors ⋮ A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix ⋮ Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices ⋮ A triangle process on regular graphs

Cites Work

• A theorem on flows in networks
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic enumeration by degree sequence of graphs of high degree
• Upsets in Round Robin Tournaments

This page was built for publication: