Bounds on Biased and Unbiased Random Walks
نویسنده
چکیده
We analyze several random random walks on one-dimensional lattices using spectral analysis and probabilistic methods. Through our analysis, we develop insight into the pre-asymptotic convergence of Markov chains.
منابع مشابه
Non-Backtracking Centrality Based Random Walk on Networks
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unb...
متن کاملQuantum random walks with history dependence
We introduce a multi-coin discrete quantum random walk where the amplitude for a coin flip depends upon previous tosses. Although the corresponding classical random walk is unbiased, a bias can be introduced into the quantum walk by varying the history dependence. By mixing the biased random walk with an unbiased one, the direction of the bias can be reversed leading to a new quantum version of...
متن کاملProbabilistic Self-Stabilization and Biased Random Walks on Dynamic Graphs
A distributed system is said to be probabilistic self-stabilizing, if it eventually converges to a legitimate computation with probability 1, starting from any global configuration. Like a self-stabilizing system, a probabilistic self-stabilizing system tolerates any number of transient failures and recovers a legitimate computation, but only probabilistically, unlike a self-stabilizing system,...
متن کاملAsymptotic Distributions of the Continuous - TimeRandom
We provide a systematic analysis of the possible asymptotic distributions of one-dimensional continuous-time random walks (CTRWs) by applying the limit theorems of probability theory. Biased and unbiased walks of coupled and decoupled memory are considered. In contrast to previous works concerning decoupled memory and L evy walks, we deal also with arbitrary coupled memory and with jump densiti...
متن کاملQuantum walks with history dependence
We introduce a multi-coin discrete quantum walk where the amplitude for a coin flip depends upon previous tosses. Although the corresponding classical random walk is unbiased, a bias can be introduced into the quantum walk by varying the history dependence. By mixing the biased walk with an unbiased one, the direction of the bias can be reversed leading to a new quantum version of Parrondo’s pa...
متن کامل