منابع مشابه
A Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملa random walk with exponential travel times
consider the random walk among n places with n(n - 1)/2 transports. we attach an exponential random variable xij to each transport between places pi and pj and take these random variables mutually independent. if transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملZeno's Walk: a Random Walk with Refinements
A self-modifying random walk on Q is deened from an ordinary random walk on the integers by interpolating a new vertex into each edge as it is crossed. This process converges almost surely to a random variable which is totally singular with respect to Lebesgue measure, and which is supported on a subset of R having Hausdorr dimension less than 1. By generating function techniques we then calcul...
متن کاملQuantum Random Walk via Classical Random Walk With Internal States
In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new ...
متن کاملRandom walk with memory
There are a large number of different modifications and variants of the usual symmetrical random walk ~RW!. Let us mention only Levy flights, biased diffusions, self-avoiding walk ~SAW for short!, etc. Let us confine ourselves to the random walks on the discrete lattices. In SAW a walking particle is choosing its trajectory in such a way that it does not step down onto the already visited site....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2019
ISSN: 1083-6489
DOI: 10.1214/19-ejp282