Related papers: Random Walks with Long-Range Self-Repulsion on Pro…
We present a novel quasi-Monte Carlo mechanism to improve graph-based sampling, coined repelling random walks. By inducing correlations between the trajectories of an interacting ensemble such that their marginal transition probabilities…
In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…
We study a class of $d$-dimensional random walks, including the two-dimensional simple random walk, reweighted by a self-repelling Gibbsian pair potential. We prove lower bounds on the diffusion constant for short-range interactions, and…
We study the rate of convergence to equilibrium of the self-repellent random walk and its local time process on the discrete circle $\mathbb{Z}_n$. While the self-repellent random walk alone is non-Markovian since the jump rates depend on…
We consider a variant of self-repelling random walk on the integer lattice Z where the self-repellence is defined in terms of the local time on oriented edges. The long-time asymptotic scaling of this walk is surprisingly different from the…
We study the large-scale dynamics of event chain Monte Carlo algorithms in one dimension, and their relation to the true self-avoiding walk. In particular, we study the influence of stress, and different forms of interaction on the…
Although the title seems self-contradictory, it does not contain a misprint. The model we study is a seemingly minor modification of the "true self-avoiding walk" (TSAW) model of Amit, Parisi, and Peliti in two dimensions. The walks in it…
The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…
We study the relaxation time in the random walk with jumps. The random walk with jumps combines random walk based sampling with uniform node sampling and improves the performance of network analysis and learning tasks. We derive various…
Attributing a positive value \tau_x to each x in Z^d, we investigate a nearest-neighbour random walk which is reversible for the measure with weights (\tau_x), often known as "Bouchaud's trap model". We assume that these weights are…
We propose a model of a one-dimensional random walk in dynamic random environment that interpolates between two classical settings: (I) the random environment is sampled at time zero only; (II) the random environment is resampled at every…
Random walk is one of the most classical and well-studied model in probability theory. For two correlated random walks on lattice, every step of the random walks has only two states, moving in the same direction or moving in the opposite…
We investigate the asymptotic behaviour of a class of self-interacting nearest neighbour random walks on the one-dimensional integer lattice which are pushed by a particular linear combination of their own local time on edges in the…
In empirical studies of random walks, continuous trajectories of animals or individuals are usually sampled over a finite number of points in space and time. It is however unclear how this partial observation affects the measured…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…
We consider two interacting random walks on $\mathbb{Z}$ such that the transition probability of one walk in one direction decreases exponentially with the number of transitions of the other walk in that direction. The joint process may…
In the context of countable groups of polynomial volume growth, we consider a large class of random walks that are allowed to take long jumps along multiple subgroups according to power law distributions. For such a random walk, we study…
A random walk with counterbalanced steps is a process of partial sums $\check S(n)=\check X_1+ \cdots + \check X_n$ whose steps $\check X_n$ are given recursively as follows. For each $n\geq 2$, with a fixed probability $p$, $\check X_n$ is…
We study a one-dimensional random walk with memory in which the step lengths to the left and to the right evolve at each step in order to reduce the wandering of the walker. The feedback is quite efficient and lead to a non-diffusive walk.…
A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the…