Related papers: The Camel-Banana Problem
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…
Theory purports that animal foraging choices evolve to maximize returns, such as net energy intake. Empirical research in both human and nonhuman animals reveals that individuals often attend to the foraging choices of their competitors…
We use cellular automata model to study the cooperation between cyclists. In the two-lane model, cyclists can change lanes. Even there is someone on the back they will take a cooperative attitude. It means that they will be in a same…
Gathering mobile robots is a widely studied problem in robotic research. This survey first introduces the related work, summarizing models and results. Then, the focus shifts on the open problem of gathering fat robots. In this context,…
For any initial configuration of fewer than N/2 cars the BML model will self organize to attain speed one. On the other hand, there is a configuration of size m in which no car can move if and only if m is at least 2N.
A defender dispatches patrollers to circumambulate a perimeter to guard against potential attacks. The defender decides on the time points to dispatch patrollers and each patroller's direction and speed, as long as the long-run rate…
The elephant random walk is a history-dependent random walk. We study a class of interacting elephant random walks. Our model includes the exclusion process as a special case. By means of Monte Carlo simulations and mean-field arguments, we…
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
We study the degree of success of a single predator hunting a herd of prey on a two dimensional square lattice landscape. We explicitly consider the self volume of the prey restraining their dynamics on the lattice. The movement of both…
This paper studies the spectrum of a multi-dimensional split-step quantum walk with a defect that cannot be analysed in the previous papers. To this end, we have developed a new technique which allow us to use a spectral mapping theorem for…
We investigate details of the interaction of subaqueous barchans with dune-size obstacles by carrying out numerical simulations where the fluid is solved at the grain scale and the motions of individual grains are computed at all time…
An open problem of Manuel Abellanas asks whether every set of disjoint closed unit disks in the plane can be connected by a conveyor belt, which means a tight simple closed curve that touches the boundary of each disk, possibly multiple…
Sea urchin feeding fronts are a striking example of spatial pattern formation in an ecological system. If it is assumed that urchins are asocial, and that they move randomly, then the formation of these dense fronts is an apparent paradox.…
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 introduce a constrained optimal transport problem where origins $x$ can only be transported to destinations $y\geq x$. Our statistical motivation is to describe the sharp upper bound for the variance of the treatment effect $Y-X$ given…
We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Time to cover all nodes and number of returns to original states are analyzed in resulting model.
We prove several results addressing the envy-free division problem in the presence of an unpredictable (secretive) player, called the "dragon". There are two basic scenarios. 1. There are $r-1$ players and a dragon. Once the "cake" is…
We consider a diamond-shaped dual-hop communication system consisting a source, two parallel half-duplex relays and a destination. In a single antenna configuration, it has been previously shown that a two-phase node-scheduling algorithm,…
Tracking of moving objects is crucial to security systems and networks. Given a graph $G$, terminal vertices $s$ and $t$, and an integer $k$, the \textsc{Tracking Paths} problem asks whether there exists at most $k$ vertices, which if…
The branching capacity has been introduced by [Zhu 2016] as the limit of the hitting probability of a symmetric branching random walk in $\mathbb Z^d$, $d\ge 5$. Similarly, we define the Brownian snake capacity in $\mathbb R^d$, as the…