Biased random walks

DOI10.1007/BF01300124zbMath0845.60071OpenAlexW2610278296MaRDI QIDQ1912749

Nathan Linial, Andrei Z. Broder, Anna R. Karlin, Yossi Azar, Steven J. Phillips

Publication date: 16 September 1996

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01300124

zbMATH Keywords

algorithms for computing the optimal controller strategylong-term behavior of a random walk on a finite graph

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Graph theory (including graph drawing) in computer science (68R10) Markov and semi-Markov decision processes (90C40)

Related Items (7)

On the approximation of one Markov chain by another ⋮ The power of two choices for random walks ⋮ Biased random walks ⋮ Efficient learning of typical finite automata from random walks ⋮ Representation of elements of a sequence by sumsets ⋮ The Metropolis algorithm for graph bisection ⋮ Memoryless search algorithms in a network with faulty advice

Cites Work

• The influence of large coalitions
• Some extremal problems arising from discrete control processes
• Generating quasi-random sequences from semi-random sources
• Biased random walks
• Finite state Markovian decision processes
• Coin-Flipping Games Immune against Linear-Sized Coalitions
• Unnamed Item
• Unnamed Item

This page was built for publication: Biased random walks