Related papers: Identifying several biased coins encountered by a …
We consider the proportion of generalized visible lattice points in the plane visited by random walkers. Our work concerns the visible lattice points in random walks in three aspects: (1) generalized visibility along curves; (2) one random…
We consider the slow movement of randomly biased random walk $(X_n)$ on a supercritical Galton--Watson tree, and are interested in the sites on the tree that are most visited by the biased random walk. Our main result implies tightness of…
A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard $n$-dimensional…
We give an expression of the speed of the biased random walk on a Galton--Watson tree. In the particular case of the simple random walk, we recover the result of Lyons, Pemantle and Peres \cite{LyPePe95}. The proof uses a description of the…
We consider two natural models of random walks on a module $V$ over a finite commutative ring $R$ driven simultaneously by addition of random elements in $V$, and multiplication by random elements in $R$. In the coin-toss walk, either one…
This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balance scales, with the minimum number of weighings possible, and…
For the simple random walk in Z^2 we study those points which are visited an unusually large number of times, and provide a new proof of the Erdos-Taylor conjecture describing the number of visits to the most visited point.
We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…
We develop rigorous, analytic techniques to study the behaviour of biased random walks on combs. This enables us to calculate exactly the spectral dimension of random comb ensembles for any bias scenario in the teeth or spine. Two specific…
We observe that changing a phase at a single point in a discrete quantum walk results in a rather surprising localization effect. For certain values of this phase change the possibility of localization strongly depends on the internal…
Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex, she moves to a uniformly random…
We consider random walk among iid, uniformly elliptic conductances on $\mathbb Z^d$, and prove the Einstein relation (see Theorem 1). It says that the derivative of the velocity of a biased walk as a function of the bias equals the…
Consider the random set composed of particles initially distributed on Zd, d >= 2, according to a Poisson point process of intensity u > 0 and moving as independent simple symmetric random walks, the trap particles. We are interested in the…
We present a mathematical formalism for the description of unrestricted quantum walks with entangled coins and one walker. The numerical behaviour of such walks is examined when using a Bell state as the initial coin state, two different…
Each classical public-coin protocol for coin flipping is naturally associated with a quantum protocol for weak coin flipping. The quantum protocol is obtained by replacing classical randomness with quantum entanglement and by adding a cheat…
The torque-free motion of rigid body in gravitational field is analyzed. The coin lands on a soft surface (such as the palm of the hand) that allows no bouncing. The model assumes the coin as a rigid body with constant angular momentum…
We consider biased random walks on random networks constituted by a random comb comprising a backbone with quenched-disordered random-length branches. The backbone and the branches run in the direction of the bias. For the bare model as…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…
Consider the time T_oz when the random walk on a weighted graph started at the vertex o first hits the vertex set z. We present lower bounds for T_oz in terms of the volume of z and the graph distance between o and z. The bounds are for…
We show that the coined quantum walk on a line can be understood as an interference phenomenon, can be classically implemented, and indeed already has been. The walk is essentially two independent walks associated with the different coin…