Related papers: A Gaussian fixed point random walk

We study the excited random walk, in which a walk that is at a site that contains cookies eats one cookie and then hops to the right with probability p and to the left with probability q=1-p. If the walk hops onto an empty site, there is no…

We show that anomalous diffusion can result when the steps of a random walk are not statistically independent. We present an algorithm that counts all the possible paths of particles diffusing on random graphs with arbitrary degree…

The purpose of this paper is to provide an exact formula for the second moment of the empirical correlation of two independent Gaussian random walks as well as implicit formulas for higher moments. The proofs are based on a symbolically…

We investigate a tight binding quantum walk on a graph. Repeated stroboscopic measurements of the position of the particle yield a measured "trajectory", and a combination of classical and quantum mechanical properties for the walk are…

We consider a class of discrete-time random walks with directed unit steps on the integer line. The direction of the steps is reversed at the time instants of events in a discrete-time renewal process and is maintained at uneventful time…

We discuss large deviation properties of continuous-time random walks (CTRW) and present a general expression for the large deviation rate in CTRW in terms of the corresponding rates for the distributions of steps' lengths and waiting…

We consider a simple random walk W_i in 1 or 2 dimensions, in which the walker may choose to stand still for a limited time. The time horizon is n, the maximum consecutive time steps which can be spent standing still is m_n and the goal is…

Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…

We study analytically a simple random walk model on a one-dimensional lattice, where at each time step the walker resets to the maximum of the already visited positions (to the rightmost visited site) with a probability $r$, and with…

We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent $\gamma=\log 3/\log2$. We find exact results concerning different first-passage…

Recently, many streaming algorithms have utilized generalizations of the fact that the expected maximum distance of any $4$-wise independent random walk on a line over $n$ steps is $O(\sqrt{n})$. In this paper, we show that $4$-wise…

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…

We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…

We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…

In a recent paper of Eichelsbacher and Koenig (2008) the model of ordered random walks has been considered. There it has been shown that, under certain moment conditions, one can construct a k-dimensional random walk conditioned to stay in…

In the frequency domain, the nearly constant loss, is characterized by a slope 1 in log of the real part of the electrical conductivity vs log frequency plots. It can be explained by an anomalous diffusion, defined by a random walk with the…

There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…

Applied to statistical physics models, the random cost algorithm enforces a Random Walk (RW) in energy (or possibly other thermodynamic quantities). The dynamics of this procedure is distinct from fixed weight updates. The probability for a…

We study the mean first passage time of a one-dimensional random walker with step sizes decaying exponentially in discrete time. That is step sizes go like $\lambda^{n}$ with $\lambda\leq1$ . We also present, for pedagogical purposes, a…

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…