Random walks on graphs with interval weights and precise marginals

DOI10.1016/j.ijar.2016.02.008zbMath1337.60086arXiv1507.05769OpenAlexW2256298556MaRDI QIDQ274449

Damjan Škulj

Publication date: 22 April 2016

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.05769

zbMATH Keywords

Markov chainsrandom walksweighted graphsreversibilitylocal optimization algorithm

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Random walks on graphs (05C81)

Related Items

Dynamic bid-ask pricing under Dempster-Shafer uncertainty

Cites Work

• Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
• Efficient computation of the bounds of continuous time imprecise Markov chains
• Discrete time Markov chains with interval probabilities
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Random walks on graphs
• Markov set-chains
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• Interval data minmax regret network optimization problems
• Coefficients of ergodicity for Markov chains with uncertain parameters
• Cover times for sequences of reversible Markov chains on random graphs
• A survey of the theory of coherent lower previsions
• Random walks on weighted graphs and applications to on-line algorithms
• IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
• A tight upper bound on the cover time for random walks on graphs
• PROBABILISTIC MODELS FOR FOCUSED WEB CRAWLING
• A tight lower bound on the cover time for random walks on graphs
• Introduction to Imprecise Probabilities
• Monte Carlo sampling methods using Markov chains and their applications