Related papers: The Camel-Banana Problem
Initially a car is placed with probability p at each site of the two-dimensional integer lattice. Each car is equally likely to be East-facing or North-facing, and different sites receive independent assignments. At odd time steps, each…
The cargo motion in living cells transported by two species of motor protein with different intrinsic directionality is discussed in this study. Similar to single motor movement, cargo steps forward and backward along microtubule…
The Cookie Monster Problem supposes that the Cookie Monster wants to empty a set of jars filled with various numbers of cookies. On each of his moves, he may choose any subset of jars and take the same number of cookies from each of those…
We consider a simple symmetric random walk on a spider, that is a collection of half lines (we call them legs) joined at the origin. Our main question is the following: if the walker makes $n$ steps how high can he go up on all legs. This…
We present theoretical results on the deterministic and stochastic motion of a dumbbell carried by a uniform flow through a three-dimensional spatially periodic potential. Depending on parameters like the flow velocity, there are two…
We study the capture of a diffusing "lamb" by diffusing "lions" in one dimension. The capture dynamics is exactly soluble by probabilistic techniques when the number of lions is very small, and is tractable by extreme statistics…
We introduce the \emph{frugal foraging} model in which a forager performs a discrete-time random walk on a lattice, where each site initially contains $\mathcal{S}$ food units. The forager metabolizes one unit of food at each step and…
The Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set. In the present paper, we provide a $5$-dimensional…
In the classical simple random walk the steps are independent, viz., the walker has no memory. In contrast, in the elephant random walk which was introduced by Sch\"utz and Trimper in 2004, the walker remembers the whole past, and the next…
Path integration enables desert arthropods to find back to their nest on the shortest track from any position. To perform path integration successfully, speeds and turning angles along the preceding outbound path have to be measured…
We study the dynamics of a \emph{myopic} forager that randomly wanders on a lattice in which each site contains one unit of food. Upon encountering a food-containing site, the forager eats all the food at this site with probability $p<1$;…
We investigate the behavior of subaqueous barchans reaching dune-size obstacles by carrying out experiments where we varied the obstacle shape and size, the flow strength, and the grains' properties. We found that a subaqueous barchan can…
Understanding animal movements and modelling the routes they travel can be essential in studies of pathogen transmission dynamics. Pathogen biology is also of crucial importance, defining the manner in which infectious agents are…
Suppose $k+1$ runners having nonzero constant speeds run laps on a unit-length circular track starting at the same time and place. A runner is said to be lonely if she is at distance at least $1/(k+1)$ along the track to every other runner.…
We view random walks as the paths of foraging animals, perhaps searching for food or avoiding predators while forming a mental map of their surroundings. The formation of such maps requires them to memorise the locations they have visited.…
We study the fate of a forager who searches for food performing a random walk on lattices. The forager consumes the available food on the site it visits and leaves it depleted but can survive up to $S$ steps without food. We introduce the…
Consider the circle $C$ of length 1 and a circular arc $A$ of length $\ell\in (0,1)$. It is shown that there exists $k=k(\ell) \in \mathbb{N}$, and a schedule for $k$ runners along the circle with $k$ constant but distinct positive speeds…
We investigate the role of greed on the lifetime of a random-walking forager on an initially resource-rich lattice. Whenever the forager lands on a food-containing site, all the food there is eaten and the forager can hop $\mathcal{S}$ more…
An electric car equipped with a battery of a finite capacity travels on a road network with an infrastructure of charging stations. Each charging station has a possibly different cost per unit of energy. Traversing a given road segment…
Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple…