Random walks on the vertices of transportation polytopes with constant number of sources
type: Item
instance of: scholarly article
title: Random walks on the vertices of transportation polytopes with constant number of sources
zbMATH Open document ID: 1193.05149
author: Mary Cryan
author: Martin Dyer
author: Haiko Müller
author: L. Stougie
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 05C81
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90B15
zbMATH DE Number: 5523053
zbMATH Keywords: transportation polytope
zbMATH Keywords: random walk
zbMATH Keywords: rapid mixing
MaRDI profile type: MaRDI publication profile
full work available at URL: rsa.20222
OpenAlex ID: W2804591125
Wikidata QID: Q56323850
cites work: On the graph structure of convex polyhedra in \(n\)-space
cites work: A linear bound on the diameter of the transportation polytope
cites work: Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
cites work: Q4471315
cites work: Asymptotic analysis of a random walk on a hypercube with many dimensions
cites work: Comparison theorems for reversible Markov chains
cites work: An application of Harnack inequalities to random walk on nilpotent quotients
cites work: Geometric bounds for eigenvalues of Markov chains
cites work: The Complexity of Vertex Enumeration Methods
cites work: Approximate counting by dynamic programming
cites work: Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
cites work: Polynomial-time counting and sampling of two-rowed contingency tables
cites work: Sampling contingency tables
cites work: Q5538306
cites work: The Distribution of a Product from Several Sources to Numerous Localities
cites work: Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
cites work: A polynomial time primal network simplex algorithm for minimum cost flows
cites work: Four questions on Birkhoff polytopes
cites work: On the number of faces of certain transportation polytopes
cites work: Analyzing Glauber dynamics by comparison of Markov chains
cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
cites work: A strongly polynomial minimum cost circulation algorithm
DOI: 10.1002/RSA.20222
published in: Random Structures \& Algorithms
description: scientific article