Related papers: The gambler's ruin problem in path representation …
Associated to a random walk on $\mathbb{Z}$ and a positive integer $n$, there is a return probability of the random walk returning to the origin after $n$ steps. An interesting question is when the set of return probabilities uniquely…
We consider the random motion of a particle that moves with constant velocity in $\mathbb{R}^3$. The particle can move along four directions with different speeds that are attained cyclically. It follows that the support of the stochastic…
We consider a version of random motion of hard core particles on the semi-lattice $ 1, 2, 3,...$, where in each time instant one of three possible events occurs, viz., (a) a randomly chosen particle hops to a free neighboring site, (b) a…
We study the gambler's ruin problem for a biased random walk on $\{0,1,\dots,a\}$ under multi-site geometric resetting: at each time step, the walker is reset with probability $\gamma\in(0,1)$ to a random position drawn from a distribution…
We study an infinite system of particles initially occupying a half-line $y\leq 0$ and undergoing random walks on the entire line. The right-most particle is called a leader. Surprisingly, every particle except the original leader may never…
Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…
A particle moves among the vertices of an $(m+1)$-gon which are labeled clockwise as $0,1,...,m$. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability $p$, or…
The gambler's ruin problem for correlated random walks (CRW), both with and without delays, is addressed using the Optional Stopping Theorem for martingales. We derive closed-form expressions for the ruin probabilities and the expected game…
We study a generalization of the standard trapping problem of random walk theory in which particles move subdiffusively on a one-dimensional lattice. We consider the cases in which the lattice is filled with a one-sided and a two-sided…
It is shown that in the complex trajectory representation of quantum mechanics, the Born's Psi^{\star}\Psi probability density can be obtained from the imaginary part of the velocity field of particles on the real axis. Extending this…
Consider two insurance companies (or two branches of the same company) that divide between them both claims and premia in some specified proportions. We model the occurrence of claims according to a renewal process. One ruin problem…
We study a generalized Hadamard walk in one dimension with three inner states. The particle governed by the three-state quantum walk moves, in superposition, both to the left and to the right according to the inner state. In addition to…
We consider real-valued branching random walks and prove a large deviation result for the position of the rightmost particle. The position of the rightmost particle is the maximum of a collection of a random number of dependent random…
A gambler with an initial fortune $x$ starts by betting a dollar, then doubles the bet after every win and halves the bet after every loss. Let $p\in (0,1)$ be the probability of winning for each round. We show that the gambler survives…
A variation of Rosenstock's trapping model in which $N$ independent random walkers are all initially placed upon a site of a one-dimensional lattice in the presence of a {\em one-sided} random distribution (with probability $c$) of…
We give explicit formulas for ruin probabilities in a multidimensional Generalized Gambler's ruin problem. The generalization is best interpreted as a game of one player against $d$ other players, allowing arbitrary winning and losing…
Assume that letters (from a finite alphabet) in a text form a Markov chain. We track two distinct words, $U$ and $D$. A gambler gains 1 point for each occurrence of $U$ (including overlapping occurrences) and loses 1 point for each…
We consider one infinite path of a Random Walk in Random Environment (RWRE, for short) in an unknown environment. This environment consists of either i.i.d.\ site or bond randomness. At each position the random walker stops and tells us the…
We consider the periodic Manhattan lattice with alternating orientations going north-south and east-west. Place obstructions on vertices independently with probability $0<p<1$. A particle is moving on the edges with unit speed following the…
In this work we consider open quantum random walks on the non-negative integers. By considering orthogonal matrix polynomials we are able to describe transition probability expressions for classes of walks via a matrix version of the…