Related papers: Optimal management of impaired self-avoiding rando…
Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random…
The self-avoiding random walk (SARW) is a stochastic process whose state variable avoids returning to previously visited states. This non-Markovian feature has turned SARWs a powerful tool for modelling a plethora of relevant aspects in…
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…
Emergent behavior in active systems is a complex byproduct of local, often pairwise, interactions. One such interaction is self-avoidance, which experimentally can arise as a response to self-generated environmental signals; such…
Imitation learning seeks to learn an expert policy from sampled demonstrations. However, in the real world, it is often difficult to find a perfect expert and avoiding dangerous behaviors becomes relevant for safety reasons. We present the…
We present an approach for accelerating nonlinear model predictive control. If the current optimal input signal is saturated, also the optimal signals in subsequent time steps often are. We propose to use the open-loop optimal input signals…
We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
Motivated by novel results in the theory of complex adaptive systems, we analyze the dynamics of random walks in which the jumping probabilities are {\it time-dependent}. We determine the survival probability in the presence of an absorbing…
Suppose one wants to monitor a domain with sensors, each sensing a small ball-shaped region, but the domain is hazardous enough that one cannot control the placement of the sensors. A prohibitively large number of randomly placed sensors…
We carry out a comparative study on the problem for a walker searching on several typical complex networks. The search efficiency is evaluated for various strategies. Having no knowledge of the global properties of the underlying networks…
We analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…
This paper investigates a partial-information pursuit evasion game in which the Pursuer has a limited-range sensor to detect the Evader. Given a fixed final time, we derive the optimal evasion strategy for the Evader to maximize its…
The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so called mean first passage time (MFPT) problem. The…
We consider nearest neighbour spatial random permutations on $\mathbb{Z}^d$. In this case, the energy of the system is proportional the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually…
In this paper, we explore the reduction of functionality in a complex system as a consequence of cumulative random damage and imperfect reparation, a phenomenon modeled as a dynamical process on networks. We analyze the global…
The classical setting of optimal control theory assumes full knowledge of the process dynamics and the costs associated with every control strategy. The problem becomes much harder if the controller only knows a finite set of possible…
There is an extensive literature concerning self-avoiding walk on infinite graphs, but the subject is relatively undeveloped on finite graphs. The purpose of this paper is to elucidate the phase transition for self-avoiding walk on the…
A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed…
On certain self-similar substrates the time behavior of a random walk is modulated by logarithmic periodic oscillations on all time scales. We show that if disorder is introduced in a way that self-similarity holds only in average, the…