Related papers: Random Walks on Polytopes of Constant Corank
We introduce planar random walk conditioned to avoid its past convex hull, and we show that it escapes at a positive limsup speed. Experimental results show that fluctuations from a limiting direction are on the order of n^(3/4). This…
In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting…
In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…
We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma et al. [PODC'10] show…
We apply the power-of-two-choices paradigm to a random walk on a graph: rather than moving to a uniform random neighbour at each step, a controller is allowed to choose from two independent uniform random neighbours. We prove that this…
The random walk is a fundamental stochastic process that underlies many numerical tasks in scientific computing applications. We consider here two neural algorithms that can be used to efficiently implement random walks on spiking…
Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…
Excited random walks (ERWs) are a self-interacting non-Markovian random walk in which the future behavior of the walk is influenced by the number of times the walk has previously visited its current site. We study the speed of the walk,…
Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…
In this paper we study the probability that a $d$ dimensional simple random walk (or the first $L$ steps of it) covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball. We show that among all such paths,…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
The fundamental gates of linear optics quantum computation are realized by using single photons sources, linear optics and photon counters. Success of these gates is conditioned on the pattern of photons detected without using feedback.…
The existence of a pivot rule for the simplex method that guarantees a strongly polynomial run-time is a longstanding, fundamental open problem in the theory of linear programming. The leading pivot rule in theory is the shadow pivot rule,…
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
We study the limit behaviour of a class of random walk models taking values in the $d$-dimensional unit standard simplex, $d\ge 1$, defined as follows. From an interior point $z$, the process chooses one of the $d+1$ vertices of the…
We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…
We consider localization of a random walk (RW) when attracted or repelled by multiple extended manifolds of different dimensionalities. In particular, we focus on $(d-1)$- and $(d-2)$-dimensional manifolds in $d$-dimensional space, where…
We use here the results on the influence graph by Boissonnat et al. to adapt them for particular cases where additional information is available. In some cases, it is possible to improve the expected randomized complexity of algorithms from…
The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consider a lattice polytope $P$ contained in $[0,k]^n$ and…
Using the Wiener-Hopf factorization, it is shown that it is possible to bound the path of an arbitrary Levy process above and below by the paths of two random walks. These walks have the same step distribution, but different random starting…