Related papers: The Camel-Banana Problem
We consider a bistable reaction-diffusion equation $u_t=\Delta u +f(u)$ on $\mathbb{R}^N$ in the presence of an obstacle $K$, which is a wall of infinite span with many holes. More precisely, $K$ is a closed subset of $\mathbb{R}^N$ with…
The establishment of protected areas or parks has become an important tool for wildlife conservation. However, frequent occurrences of human-wildlife conflict at the edges of these parks can undermine their conservation goals. Many African…
Perfect transfer of a quantum state through a one-dimensional chain is now well understood, allowing one not only to decide whether a fixed Hamiltonian achieves perfect transfer, but to design a suitable one. We are particularly interested…
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…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
We consider a Levy flyer of order alpha that starts from a point x0 on an interval [O,L] with absorbing boundaries. We find a closed-form expression for the average number of flights the flyer takes and the total length of the flights it…
We study the gambler's ruin problem for the Elephant Random Walk, focusing on escape time from a symmetric interval of the form $\{-N, \ldots, N\}$. As our main result, we derive tight exponential bounds for the tail of this escape time. We…
Constructing a discrete model like a cellular automaton is a powerful method for understanding various dynamical systems. However, the relationship between the discrete model and its continuous analogue is, in general, nontrivial. As a…
Be $X_t$ a random walk. We study its span $S$, i.e. the size of the domain visited up to time $t$. We want to know the probability that $S$ reaches $1$ for the first time, as well as the density of the span given $t$. Analytical results are…
During fast locomotion - gallop, half bound - of quadruped mammals, the ground contact of the limbs in each pair do not alternate symmetrically. Animals using such asymmetrical gait thus choose whether the left or the right limb will…
Charge migration along DNA molecules has attracted scientific interest for over half a century. Reports on possible high rates of charge transfer between donor and acceptor through the DNA, obtained in the last decade from solution…
In this paper, we consider a game played on a rectangular $m \times n$ gridded chocolate bar. Each move, a player breaks the bar along a grid line. Each move after that consists of taking any piece of chocolate and breaking it again along…
A review of the parallel transport (translation) in fibre bundles is presented. The connections between transports along paths and parallel transports in fibre bundles are examined. It is proved that the latter ones are special cases of the…
We consider the model of the one-dimensional cookie random walk when the initial cookie distribution is spatially uniform and the number of cookies per site is finite. We give a criterion to decide whether the limiting speed of the walk is…
A classical problem describing the collective motion of cells, is the movement driven by consumption/depletion of a nutrient. Here we analyze one of the simplest such model written as a coupled Partial Differential Equation/Ordinary…
Single-electron circuits of the future, consisting of a network of quantum dots, will require a mechanism to transport electrons from one functional part to another. For example, in a quantum computer[1] decoherence and circuit complexity…
We introduce and study the 1-planar packing problem: Given $k$ graphs with $n$ vertices $G_1, \dots, G_k$, find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each $G_i$…
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…
The Snake-in-the-Box problem is that of finding a longest induced path in an $n$-dimensional hypercube. We prove new lower bounds for the values $n\in \{11,12,13\}$. The Coil-in-the-Box problem is that of finding a longest induced cycle in…
We study the splitting probabilities for a one-dimensional Brownian motion in a cage whose two boundaries move at constant speeds $c_1$ and $c_2$. This configuration corresponds to the capture of a diffusing, but skittish lamb, with an…