On approximating the stationary distribution of time-reversible Markov chains
type: Item
instance of: scholarly article
title: On approximating the stationary distribution of time-reversible Markov chains
zbMATH Open document ID: 1436.60035
author: Marco Bressan
author: Enoch Peserico
author: Luca Pretto
published in: Theory of Computing Systems
publication date: 2020-04-15T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8494/
Mathematics Subject Classification ID: 60G10
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7189480
zbMATH Keywords: Markov chains
zbMATH Keywords: MCMC sampling
zbMATH Keywords: large graph algorithms
zbMATH Keywords: randomized algorithms
zbMATH Keywords: sublinear algorithms
describes a project that uses: fast-ppr
MaRDI profile type: Publication
OpenAlex ID: W3021997320
cites work: Choice-memory tradeoff in allocations
cites work: Q5306039
cites work: Multiscale Matrix Sampling and Sublinear-Time PageRank Computation
cites work: A Sublinear Time Algorithm for PageRank Computations
cites work: Chernoff-Hoeffding bounds for Markov chains: generalized and simplified
cites work: On tail probabilities for martingales
cites work: Monte Carlo sampling methods using Markov chains and their applications
cites work: Q3549475
cites work: Bidirectional PageRank Estimation: From Average-Case to Worst-Case
cites work: Estimating Sum by Weighted Sampling
cites work: Q4856179
cites work: Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
cites work: Sublinear Time Algorithms
Wikidata QID: Q128095692
DOI: 10.1007/S00224-019-09921-3
description: scientific article; zbMATH DE number 7189480