Related papers: Hypergeometric solution to a gambler's ruin proble…
In the extended gambler's ruin problem we can move one step forward or backward (classical gambler's ruin problem), we can stay where we are for a time unit (delayed action) or there can be absorption in the current state (game is…
We consider the classical one-dimensional random walk of a particle on the right-half real line. We assume that the particle is initially at position x=k, k > 0, and moves to the right with probability p or to the left with probability 1-p.…
Stochastic resetting -- the intermittent restart of random processes -- has profoundly reshaped first-passage theory, providing a mechanism to control and optimize completion times. While the influence of resetting on mean first-passage…
We consider a model of open quantum random walk and together with a quantum trajectory approach we are able to examine a notion of hitting time. We see that many constructions, such as minimal solutions to hitting time problems, are…
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 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…
In this paper we provide formulas for the expectation of a conditional game duration in a finite state-space one-dimensional gambler's ruin problem with arbitrary winning $p(n)$ and losing $q(n)$ probabilities (i.e., they depend on the…
The effect of space inhomogeneities on a diffusing particle is studied in the framework of the 1D random walk. The typical time needed by a particle to cross a one--dimensional finite lane, the so--called residence time, is computed…
We consider the simple random walk on the $N$-dimensional integer lattice from the perspective of evaluating asymptotically the duration of play in the multidimensional gambler\apost s ruin problem. We show that, under suitable rescalings,…
We present here a new extended model of the gambler's ruin problem by incorporating delays in receiving of rewards and paying of penalties. When there is a difference between two delays, an exact analysis of the ruin probability is…
This note explores the mathematical theory to solve modern gamblers ruin problems. We establish a ruin framework and solve for the probability of bankruptcy. We also show how this relates to the expected time to bankruptcy and review the…
The laws of chance are often subtle and deceptive. This is why games of chance work. People are convinced that they obey seemingly intuitive laws, while the underlying mathematical structure reveals a different and more complex reality.…
We obtain absorption probabilities and expected time until absorption for different stopping strategies in gambler's ruin problem using the concept of multiple function barriers
In this paper, we propose a new multi-armed bandit problem called the Gambler's Ruin Bandit Problem (GRBP). In the GRBP, the learner proceeds in a sequence of rounds, where each round is a Markov Decision Process (MDP) with two actions…
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…
In this paper, we propose and analyze a novel one-dimensional inhomogeneous random walk model that combines spatial decay of transition probabilities with a temporal renewal structure for each excursion. In this model, the probability of…
A natural extension of a right-continuous integer-valued random walk is one which can jump to the right by one or two units. First passage times above a given fixed level then admit a tractable Laplace transform (probability generating…
Consider a random walk in $\mathbb{R}^d$ that starts at the origin and whose increment distribution assigns zero probability to any affine hyperplane. We solve Sylvester's problem for these random walks by showing that the probability that…
We study, on a $d$ dimensional hypercubic lattice, a random walk which is homogeneous except for one site. Instead of visiting this site, the walker hops over it with arbitrary rates. The probability distribution of this walk and the…
By building upon a Feynman-Kac formalism, we assess the distribution of the number of hits in a given region for a broad class of discrete-time random walks with scattering and absorption. We derive the evolution equation for the generating…