Related papers: A camel with a less strict diet
In this recreational mathematics note, we address a simple, yet instructive question: Justin has to travel a distance of d miles along a bus route. Along this route, there are n bus stops i, each spaced at a distance of d_i from the…
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…
A centipede made of $N$ quantum walkers on a one-dimensional lattice is considered. The distance between two consecutive legs is either one or two lattice spacings, and a global constraint is imposed: the maximal distance between the first…
We show that two independent elephant random walks on the integer lattice $\mathbb{Z}$ meet each other finitely often or infinitely often depends on whether the memory parameter $p$ is strictly larger than $3/4$ or not. Asymptotic results…
We develop probabilistic tools for upper and lower bounding the expected time until two independent random walks on $\ZZ$ intersect each other. This leads to the first sharp analysis of a non-trivial Birthday attack, proving that Pollard's…
Ulam asked for the maximum number of questions required to determine an integer between one and one million by asking questions whose answer is `Yes' or `No' and where one untruthful answer is allowed. Pelc showed that the number of…
In the Feline Josephus problem, soldiers stand in a circle, each having $\ell$ `lives'. Going around the circle, a life is taken from every $k$th soldier; soldiers with 0 lives remaining are removed from the circle. Finding the last…
In empirical studies of random walks, continuous trajectories of animals or individuals are usually sampled over a finite number of points in space and time. It is however unclear how this partial observation affects the measured…
Quantum optimal transportation seeks an operator which minimizes the total cost of transporting a quantum state to another state, under some constraints that should be satisfied during transportation. We formulate this issue by extending…
We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
We establish some limit theorems for one-dimensional elephant random walk, including Berry-Esseen bounds, Cram\'{e}r moderate deviations and local limit theorems. These limit theorems can be regarded as refinements of the central limit…
We experimentally demonstrate a quantum walk on a line in phase space using one and two trapped ion. A walk with up to 23 steps is realized by subjecting an ion to state-dependent displacement operations interleaved with quantum coin…
Molecular motors transport various cargos along cytoskeletal filaments, analogous to trucks on roads. In contrast to vehicles, however, molecular motors do not work alone but in small teams. We describe a simple model for the transport of a…
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If $n$ is the length of the path, and the vertices are indexed…
We explore a two-step optimization problem in random environments, the so-called restaurant-coffee shop problem, where a walker aims at visiting the nearest and better restaurant in an area and then move to the nearest and better…
In this paper, we introduce the elephant random walk (ERW) with memory consisting of randomly selected steps from its history. It is a time-changed variant of the standard elephant random walk with memory consisting of its full history. At…
Consider $N$ points randomly distributed along a line segment of unitary length. A walker explores this disordered medium moving according to a partially self-avoiding deterministic walk. The walker, with memory $\mu$, leaves from the…
We study the random walk in random environment on {0,1,2,...}, where the environment is subject to a vanishing (random) perturbation. The two particular cases we consider are: (i) random walk in random environment perturbed from Sinai's…
In the infinite regular tree $\mathbb{T}_{q+1}$ with $q \in \mathbb{Z}_{\ge 2}$, we consider families $\{\mu_u^n\}$, indexed by vertices $u$ and nonnegative integers ("discrete time steps") $n$, of probability measures such that $\mu_u^n(v)…