Results 1 to 10 of about 5,122,952 (294)
Random Walk on the Range of Random Walk [PDF]
We study the random walk $X$ on the range of a simple random walk on $\mathbb{Z}^d$ in dimensions $d\geq 4$. When $d\geq 5$ we establish quenched and annealed scaling limits for the process $X$, which show that the intersections of the original simple random walk path are essentially unimportant.
A. Masi De+28 more
openaire +7 more sources
Random walk on random walks: Low densities [PDF]
28 ...
Hilário, Marcelo R.+4 more
openaire +12 more sources
Multifractal random walk [PDF]
We introduce a class of multifractal processes, referred to as Multifractal Random Walks (MRWs). To our knowledge, it is the first multifractal processes with continuous dilation invariance properties and stationary increments. MRWs are very attractive alternative processes to classical cascade-like multifractal models since they do not involve any ...
Bacry, Emmanuel, Delour, J., Muzy, J. F.
openaire +8 more sources
We study a discrete time self-interacting random process on graphs, which we call greedy random walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not yet been crossed by the walker.
Orenshtein T., Shinkar I.
openaire +6 more sources
Directed random walk with random restarts: The Sisyphus random walk. [PDF]
In this paper we consider a particular version of the random walk with restarts: random reset events which suddenly bring the system to the starting value.
M. Montero, J. Villarroel
semanticscholar +6 more sources
Slow movement of a random walk on the range of a random walk in the presence of an external field [PDF]
In this article, a localisation result is proved for the biased random walk on the range of a simple random walk in high dimensions (d \geq 5). This demonstrates that, unlike in the supercritical percolation setting, a slowdown effect occurs as soon a non-trivial bias is introduced. The proof applies a decomposition of the underlying simple random walk
A-S Sznitman+10 more
arxiv +5 more sources
Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk [PDF]
Quantum walks (QWs) have a property that classical random walks (RWs) do not possess—the coexistence of linear spreading and localization—and this property is utilized to implement various kinds of applications.
Tomoki Yamagami+5 more
doaj +2 more sources
Random walk on random walks [PDF]
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density 2 (0;1).
M. Hil'ario+4 more
semanticscholar +8 more sources
A random-walk-based epidemiological model [PDF]
Random walkers on a two-dimensional square lattice are used to explore the spatio-temporal growth of an epidemic. We have found that a simple random-walk system generates non-trivial dynamics compared with traditional well-mixed models.
Andrew Chu+4 more
doaj +2 more sources
Random walk centrality for temporal networks [PDF]
Nodes can be ranked according to their relative importance within a network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks,
Luis E C Rocha, Naoki Masuda
doaj +2 more sources