Related papers: Random Walks with Long-Range Self-Repulsion on Pro…
A discrete time quantum walker is considered in one dimension, where at each step, the translation can be more than one unit length chosen randomly. In the simplest case, the probability that the distance travelled is $\ell$ is taken as…
Random walks can be used to search complex networks for a desired resource. To reduce search lengths, we propose a mechanism based on building random walks connecting together partial walks (PW) previously computed at each network node.…
We obtain a large deviations principle for the self-intersection local times for a symmetric random walk in dimension d>4. As an application, we obtain moderate deviations for random walk in random sceneries in some region of parameters.
We obtain estimates for large and moderate deviations for the capacity of the range of a random walk on $\mathbb{Z}^d$, in dimension $d\ge 5$, both in the upward and downward directions. The results are analogous to those we obtained for…
Using Monte Carlo methods, the short-time dynamic scaling behaviour of two-dimensional critical XY systems is investigated. Our results for the XY model show that there exists universal scaling behaviour already in the short-time regime,…
The strong interaction limit of the discrete-time weakly self-avoiding walk (or Domb--Joyce model) is trivially seen to be the usual strictly self-avoiding walk. For the continuous-time weakly self-avoiding walk, the situation is more…
We show that heterogeneity in self-propulsion speed can lead to the emergence of a robust effective short-range repulsion among active particles interacting via long-range attractive potentials. Using the example of harmonically coupled…
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 report several important observations that underscore the distinctions between the constrained-path Monte Carlo method and the continuum and lattice versions of the fixed-node method. The main distinctions stem from the differences in…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
We focus on the problem of performing random walks efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds required to obtain a random walk sample. We first present a fast sublinear…
A random walk in random scenery $(Y_n)_{n\in\mathbb{N}}$ is given by $Y_n=\xi_{S_n}$ for a random walk $(S_n)_{n\in\mathbb{N}}$ and iid random variables $(\xi_n)_{n\in\mathbb{Z}}$. In this paper, we will show the weak convergence of the…
For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…
We present the analytical and numerical results of a random walk on the family of small-world graphs. The average access time shows a crossover from the regular to random behavior with increasing distance from the starting point of the…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
We consider random walks, say $W_n=(M_0, M_1,\dots, M_n)$, of length $n$ starting at 0 and based on the martingale sequence $M_k$ with differences $X_m=M_m-M_{m-1}$. Assuming that the differences are bounded, $|X_m|\leq 1$, we solve the…
Using the discrepancy metric, we analyze the rate of convergence of a random walk on the circle generated by d rotations, and establish sharp rates that show that badly approximable d-tuples in R^d give rise to walks with the fastest…
The problem of random walk is considered in one dimension in the simultaneous presence of a quenched random force field and long-range connections the probability of which decays with the distance algebraically as p_l ~ \beta l^{-s}. The…
We study a random walk model in which the jumping probability to a site is dependent on the number of previous visits to the site, as a model of the mobility with memory. To this end we introduce two parameters called the memory parameter…
The explosion of data on animal behavior in more natural contexts highlights the fact that these behaviors exhibit correlations across many time scales. But there are major challenges in analyzing these data: records of behavior in single…