Related papers: Self-Repelling Bi-Exploration Process
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…
A step-reinforced random walk is a discrete-time stochastic process with long-range dependence. At each step, with a fixed probability $\alpha$, the so-called positively step-reinforced random walk repeats one of its previous steps, chosen…
We study discrete-time random walks on networks subject to a time-dependent stochastic resetting, where the walker either hops randomly between neighboring nodes with a probability $1-\phi(a)$, or is reset to a given node with a…
Kinetically grown self-avoiding walks on various types of generalized random networks have been studied. Networks with short- and long-tailed degree distributions $P(k)$ were considered ($k$, degree or connectivity), including scale-free…
The model of a tired random walker, whose jump-length decays exponentially in time, is proposed and the motion of such a tired random walker is studied systematically in one, two and three dimensional contin- uum. In all cases, the…
We consider the survival probability $f(t)$ of a random walk with a constant hopping rate $w$ on a host lattice of fractal dimension $d$ and spectral dimension $d_s\le 2$, with spatially correlated traps. The traps form a sublattice with…
We investigate random walks in independent, identically distributed random sceneries under the assumption that the scenery variables satisfy Cramer's condition. We prove moderate deviation principles in dimensions two and larger, covering…
We study the dynamics of a deterministic walk confined in a narrow two-dimensional space randomly filled with point-like targets. At each step, the walker visits the nearest target not previously visited. Complex dynamics is observed at…
The motion of a lazy Pearson walker is studied with different probability ($p$) of jump in two and three dimensions. The probability of exit ($P_e$) from a zone of radius $r_e$, is studied as a function of $r_e$ with different values of…
We investigate time-dependent properties of a single particle model in which a random walker moves on a triangle and is subjected to non-local boundary conditions. This model exhibits spontaneous breaking of a Z_2 symmetry. The reduced size…
In this work we propose a model to describe the statistical fluctuations of the self-driven objects (species A) walking against an opposite crowd (species B) in order to simulate the regime characterized by stop-and-go waves in the context…
This paper addresses the design and development of an autonomous biped robot using master and worker combination of controllers. In addition, the bot is wirelessly controllable. The work presented here explains the walking pattern, system…
We study an unbiased, discrete time random walk on the nonnegative integers, with the origin absorbing. The process has a history-dependent step length: the walker takes steps of length v while in a region which has been visited before, and…
We consider self-avoiding walks terminally attached to a surface at which they can adsorb. A force is applied, normal to the surface, to desorb the walk and we investigate how the behaviour depends on the vertex of the walk at which the…
We study the high-dimensional uniform prudent self-avoiding walk, which assigns equal probability to all nearest-neighbor self-avoiding paths of a fixed length that respect the prudent condition, namely, the path cannot take any step in the…
Metapopulation models have been a powerful tool for both theorizing and simulating epidemic dynamics. In a metapopulation model, one considers a network composed of subpopulations and their pairwise connections, and individuals are assumed…
Random walks with stochastic resetting provides a treatable framework to study interesting features about central-place motion. In this work, we introduce non-instantaneous resetting as a two-state model being a combination of an exploring…
We analyze the dynamics of random walks in which the jumping probabilities are periodic {\it time-dependent} functions. In particular, we determine the survival probability of biased walkers who are drifted towards an absorbing boundary.…
We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chain system in one dimension with a nonlocal spin update rule,…
A signed network represents how a set of nodes are connected by two logically contradictory types of links: positive and negative links. In a signed products network, two products can be complementary (purchased together) or substitutable…