Asset Details
Do you wish to reserve the book?
On Approximating the Stationary Distribution of Time-Reversible Markov Chains
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
On Approximating the Stationary Distribution of Time-Reversible Markov Chains
Do you wish to request the book?
On Approximating the Stationary Distribution of Time-Reversible Markov Chains
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
On Approximating the Stationary Distribution of Time-Reversible Markov Chains
2020
Overview
Approximating the stationary probability of a state in a Markov chain through Markov chain Monte Carlo techniques is, in general, inefficient. Standard random walk approaches require Õ(τ/π(v)) operations to approximate the probability π(v) of a state v in a chain with mixing time τ, and even the best available techniques still have complexity Õ(τ1.5/π(v)0.5); and since these complexities depend inversely on π(v), they can grow beyond any bound in the size of the chain or in its mixing time. In this paper we show that, for time-reversible Markov chains, there exists a simple randomized approximation algorithm that breaks this “small-π(v) barrier”.
Publisher
Springer Nature B.V
Subject
