Related papers: A camel with a less strict diet
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…
Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…
Time it takes to travel from one position to another, devoid of any quantum mechanical description, has been modeled variously, especially for quantum tunneling. The model time, if universally valid, must be subluminal, must hold everywhere…
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…
We consider (n+1) runners with given constant unique integer speeds running along the circumference of a circle whose circumferential length is one, and all runners starting from the same point. We define and give lower bounds to a first…
This paper introduces the Packing While Traveling problem as a new non-linear knapsack problem. Given are a set of cities that have a set of items of distinct profits and weights and a vehicle that may collect the items when visiting all…
It is well-known that the optimal transport problem on the real line for the classical distance cost may not have a unique solution. In this paper we recover uniqueness by considering the transport problems where the costs are a power…
This paper considers the problem of finding a quickest path between two points in the Euclidean plane in the presence of a transportation network. A transportation network consists of a planar network where each road (edge) has an…
In cells, organelles and vesicles are usually transported by cooperation of several motor proteins, including plus-end directed motor kinesin and minus-end directed motor dynein. Many biophysical models have been constructed to understand…
The survival probability, S_N(t), of a diffusing prey (``lamb'') in the proximity of N diffusing predators (a ``pride of lions'') in one dimension is investigated. When the lions are all to one side of the lamb, the survival probability…
In this work we study asymptotic properties of a long range memory random walk known as elephant random walk. First we prove recurrence and positive recurrence for the elephant random walk. Then, we establish the transience regime of the…
We introduce a model for the global optimization problem of nectar harvesting by flower visitors, e.g., nectar-feeding bats, as a generalization of the (multiple) traveling-salesperson problem (TSP). The model includes multiple independent…
Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…
Suppose $n$ different pairs of socks are put in a tumble dryer. When the dryer is finished socks are taken out one by one, if a sock matches one of the socks on the sorting table both are removed, otherwise it is put on the table until its…
The Ulam sequence is given by $a_1 =1, a_2 = 2$, and then, for $n \geq 3$, the element $a_n$ is defined as the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives the sequence $1, 2,…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
We propose a minimal model of predator-swarm interactions which captures many of the essential dynamics observed in nature. Different outcomes are observed depending on the predator strength. For a "weak" predator, the swarm is able to…
We determine the impact of resource renewal on the lifetime of a forager that depletes its environment and starves if it wanders too long without eating. In the framework of the minimal starving random walk model with resource renewal,…
Processive molecular motors take more-or-less uniformly sized steps, along spatially periodic tracks, mostly forwards but increasingly backwards under loads. Experimentally, the major steps can be resolved clearly within the noise but one…
A spider consists of several, say $N$, particles. Particles can jump independently according to a random walk if the movement does not violate some given restriction rules. If the movement violates a rule it is not carried out. We consider…