Total variation discrepancy of deterministic random walks for ergodic Markov chains
type: Item
instance of: scholarly article
title: Total variation discrepancy of deterministic random walks for ergodic Markov chains
zbMATH Open document ID: 1380.68304
author: Takeharu Shiraga
author: Yukiko Yamauchi
author: Shuji Kijima
author: Masafumi Yamashita
published in: Theoretical Computer Science
publication date: 2017-11-03T00:00:00Z
Mathematics Subject Classification ID: 68Q87
Mathematics Subject Classification ID: 05C81
Mathematics Subject Classification ID: 60J10
zbMATH DE Number: 6802755
zbMATH Keywords: rotor router model
zbMATH Keywords: propp machine
zbMATH Keywords: load balancing
zbMATH Keywords: Markov chain Monte Carlo (MCMC)
zbMATH Keywords: mixing time
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.11.017
OpenAlex ID: W2222348553
cites work: An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution
cites work: Euler Tour Lock-In Problem in the Rotor-Router Model
cites work: Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
cites work: Improved analysis of deterministic load-balancing schemes
cites work: Limit behavior of the multi-agent rotor-router system
cites work: Deterministic random walks on regular trees
cites work: Deterministic random walks on the integers
cites work: Simulating a Random Walk with Constant Error
cites work: Bypassing KLS
cites work: Bounds on the Cover Time of Parallel Rotor Walks
cites work: Deterministic Random Walks on the Two-Dimensional Grid
cites work: A random polynomial-time algorithm for approximating the volume of convex bodies
cites work: Quasirandom Load Balancing
cites work: An FPTAS for #Knapsack and Related Counting Problems
cites work: Rotor Walks and Markov Chains
cites work: Polynomial-Time Approximation Algorithms for the Ising Model
cites work: Q3002852
cites work: Random generation of combinatorial structures from a uniform distribution
cites work: Deterministic random walks on finite graphs
cites work: L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains
cites work: A deterministic polynomial-time approximation scheme for counting knapsack solutions
cites work: The Chairman assignment problem
cites work: Counting independent sets up to the tree threshold
cites work: A distributed ant algorithm for efficiently patrolling a network
DOI: 10.1016/J.TCS.2016.11.017
description: scientific article; zbMATH DE number 6802755