Related papers: A characterisation of transient random walks on st…
We study the rate of convergence of the Markov chain on $S_n$ which starts with a random $(n-k)$-cycle for a fixed $k \geq 1$, followed by random transpositions. The convergence to the stationary distribution turns out to be of order $n$.…
We characterise probability distributions via a martingale property associated with a natural generalisation of record values, known as $\delta$-records. For an independent and identically distributed sequence $(X_n)$ with running maximum…
Dirichlet distribution and Dirichlet process as its infinite dimensional generalization are primarily used conjugate prior of categorical and multinomial distributions in Bayesian statistics. Extensions have been proposed to broaden…
We study the asymptotic behavior of the simple random walk on oriented versions of $\mathbb{Z}^2$. The considered lattices are not directed on the vertical axis but unidirectional on the horizontal one, with random orientations whose…
We revisit the statistics of extremes and records of symmetric random walks with stochastic resetting, extending earlier studies in several directions. We put forward a diffusive scaling regime (symmetric step length distribution with…
A random walk generated by a sum of independent identity distributed random variables with positive expectation is considered. The limiting distributions for the first- passage -time of a step-function boundary are derived.
An infinite convergent sum of independent and identically distributed random variables discounted by a multiplicative random walk is called perpetuity, because of a possible actuarial application. We give three disjoint groups of sufficient…
We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…
Random flights in $\mathbb{R}^d,d\geq 2,$ with Dirichlet-distributed displacements and uniformly distributed orientation are analyzed. The explicit characteristic functions of the position $\underline{\bf X}_d(t),\,t>0,$ when the number of…
We consider the limiting behaviour of the point processes associated with a branching random walk with supercritical branching mechanism and balanced regularly varying step size. Assuming that the underlying branching process satisfies…
Recursive stochastic algorithms have gained significant attention in the recent past due to data driven applications. Examples include stochastic gradient descent for solving large-scale optimization problems and empirical dynamic…
A family of random probabilities is defined and studied. This family contains the Dirichlet process as a special case, corresponding to an inner point in the appropriate parameter space. The extension makes it possible to have random means…
If $\alpha$ is a probability on $\mathbb{R}^d$ and $t>0,$ consider the Dirichlet random probability $P_t\sim\mathcal{D}(t\alpha) ;$ it is such that for any measurable partition $(A_0,\ldots,A_k)$ of $\mathbb{R}^d$ then…
We study diffusion processes and stochastic flows which are time-changed random perturbations of a deterministic flow on a manifold. Using non-symmetric Dirichlet forms and their convergence in a sense close to the Mosco-convergence, we…
A random walk in a sparse random environment is a model introduced by Matzavinos et al. [Electron. J. Probab. 21, paper no. 72: 2016] as a generalization of both a simple symmetric random walk and a classical random walk in a random…
We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
We consider a simple dice game, which leads to an intriguing study of multinomial walks, with surprising and seemingly paradoxical properties. The winning and losing probabilities of a general version of the game are investigated via…
The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…
We derive analytic expressions for infinite products of random 2x2 matrices. The determinant of the target matrix is log-normally distributed, whereas the remainder is a surprisingly complicated function of a parameter characterizing the…