Related papers: Hypergeometric solution to a gambler's ruin proble…
We consider random walks, say $W_n=(M_0, M_1,\dots, M_n)$, of length $n$ starting at 0 and based on the martingale sequence $M_k$ with differences $X_m=M_m-M_{m-1}$. Assuming that the differences are bounded, $|X_m|\leq 1$, we solve the…
We give the exact solution to the problem of a random walk on the Bethe lattice through a mapping on an asymmetric random walk on the half-line. We also study the continuous limit of this model, and discuss in detail the relation between…
This mathematical recreation extends the analysis of a recent paper, asking when a traveller at a bus stop and not knowing the time of the next bus is best advised to wait or to start walking toward the destination. A detailed analysis and…
In a recent paper we proposed a non-Markovian random walk model with memory of the maximum distance ever reached from the starting point (home). The behavior of the walker is at variance with respect to the simple symmetric random walk…
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks…
We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly…
Gravity driven flows such as in hoppers and silos are susceptible to clogging due to the formation of arches at the exit whose failure is the key to re-initiation of flow. In vibrated hoppers, clog durations exhibit a broad distribution,…
We investigate the statistics of the gap, G_n, between the two rightmost positions of a Markovian one-dimensional random walker (RW) after n time steps and of the duration, L_n, which separates the occurrence of these two extremal…
We aim to describe a droplet bouncing on a vibrating bath using a simple and highly versatile model inspired from quantum mechanics. Close to the Faraday instability, a long-lived surface wave is created at each bounce, which serves as a…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks are characterized by the fact that the one-step transition probabilities are functions of the…
A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…
We analyze a special class of 1-D quantum walks (QWs) realized using optical multi-ports. We assume non-perfect multi-ports showing errors in the connectivity, i.e. with a small probability the multi- ports can connect not to their nearest…
This paper derives the asymptotic behavior of the following ruin probability $$P\{\exists t \in G(\delta):B_H(t)-c_1t>q_1u,B_H(t)-c_2t>q_2u\}, \ \ \ u \rightarrow \infty,$$ where $B_H$ is a standard fractional Brownian motion,…
We offer theoretical explanations for some recent observations in numerical simulations of quantum random walks (QRW). Specifically, in the case of a QRW on the line with one particle (walker) and two entangled coins, we explain the…
We introduce range-controlled random walks with hopping rates depending on the range $\mathcal{N}$, that is, the total number of previously distinct visited sites. We analyze a one-parameter class of models with a hopping rate…
We consider a one-dimensional space-inhomogeneous discrete time quantum walk. This model is the Hadamard walk with one defect at the origin which is different from the model introduced by Wojcik et al. [14]. We obtain a stationary measure…
We consider a random walk in confined geometry, starting from a site and eventually reaching a target site. We calculate analytically the distribution of the occupation time on a third site, before reaching the target site. The obtained…
The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this "deterministic random walk" covers all…
We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…
We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…