Related papers: A camel with a less strict diet
This paper treats absorption problems for the one-dimensional quantum walk determined by a 2 times 2 unitary matrix U on a state space {0,1,...,N} where N is finite or infinite by using a new path integral approach based on an orthonormal…
We study the escape behavior of a lamb to safe haven pursued by a hungry lion. Identifying the system with a pair of vicious Brownian walkers we evaluate the probability density function for the vicious pair and from there we estimate the…
Quantum walks are quantum counterparts of random walks and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space and it is observed at a location with a probability. The finding…
Previously published admissibility conditions for an element of $\{0,1\}^{\mathbb{Z}}$ to be the itinerary of a point of the inverse limit of a tent map are expressed in terms of forward orbits. We give necessary and sufficient conditions…
Fix integers $d \geq 2$ and $k\geq d-1$. Consider a random walk $X_0, X_1, \ldots$ in $\mathbb{R}^d$ in which, given $X_0, X_1, \ldots, X_n$ ($n \geq k$), the next step $X_{n+1}$ is uniformly distributed on the unit ball centred at $X_n$,…
In this paper, we consider a generalization of the elephant random walk model. Compared to the usual elephant random walk, an interesting feature of this model is that the step sizes form a sequence of positive independent and identically…
We study the problem of identifying an n-bit string using a single quantum query to an oracle that computes the Hamming distance between the query and hidden strings. The standard action of the oracle on a response register of dimension r…
Pyramidal tours with step-backs are Hamiltonian tours of a special kind: the salesperson starts in city 1, then visits some cities in ascending order, reaches city $n$, and returns to city 1 visiting the remaining cities in descending…
A celebrated problem in numerical analysis is to consider Brownian motion originating at the centre of a $10 \times 1$ rectangle, and to evaluate the ratio of probabilities of a Brownian path hitting the short ends of the rectangle before…
In this chapter, we review recent results on the starving random walk (RW) problem, a minimal model for resource-limited exploration. Initially, each lattice site contains a single food unit, which is consumed upon visitation by the RW. The…
This paper shows that the semi-dual formulation of the optimal transport problem has a degenerate saddle-point structure, and that its numerical solution is equivalent to solving a constrained optimization problem. We derive necessary and…
The subject of this paper is the simple random walk on $\mathbb{Z}$. We give a very simple answer to the following problem: under the condition that a random walk has already spent $\alpha$-percent of the traveling time on the positive side…
The hopping model for cargo transport by molecular motors introduced in Refs. goldman1, goldman2, is extended here in order to incorporate the movement of cargo-motor complexes. In this context, hopping process expresses the possibility for…
We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the…
We study a single-period optimal transport problem on $\mathbb{R}^2$ with a covariance-type cost function $c(x,y) = (x_1-y_1)(x_2-y_2)$ and a backward martingale constraint. We show that a transport plan $\gamma$ is optimal if and only if…
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 two lane road approaches a stoplight. The left lane merges into the right just past the intersection. Vehicles approach the intersection one at a time, with some drivers always choosing the right lane, while others always choose the…
In this paper, we study the number of moves in a multidimensional elephant random walk with stops. We establish several convergence results for the number of moves, including the law of large numbers and the law of iterated logarithm. Using…
Given a point (the "spider") on a rectangular box, we would like to find the minimal distance along the surface to its opposite point (the "fly" - the reflection of the spider across the center of the box). Without loss of generality, we…
We study how to sample paths of a random walk up to the first time it crosses a fixed barrier, in the setting where the step sizes are iid with negative mean and have a regularly varying right tail. We introduce a desirable property for a…