Related papers: Limiting directions for random walks in classical …
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
In this paper we investigate commuting involution graphs in classical affine Weyl groups. Let $W$ be a classical Weyl group of rank $n$, with $\tilde W$ its corresponding affine Weyl group. Our main result is that if $X$ is a conjugacy…
The theory of random walks on finite graphs is well developed with numerous applications. In quantum walks, the propagation is governed by quantum mechanical rules; generalizing random walks to the quantum setting. They have been…
We investigate a Markov chain defined by Thomas Lam, which generalizes the multi-type TASEP on a ring to any Weyl group. For groups of type C we define an analogue of the multiline queues of Ferrari and Martin (which compute the stationary…
The Random Walks (RW) algorithm is one of the most e - cient and easy-to-use probabilistic segmentation methods. By combining contrast terms with prior terms, it provides accurate segmentations of medical images in a fully automated manner.…
We consider a minimal model of one-dimensional discrete-time random walk with step-reinforcement, introduced by Harbola, Kumar, and Lindenberg (2014): The walker can move forward (never backward), or remain at rest. For each $n=1,2,\cdots$,…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…
We prove the law of large numbers for the drift of random walks on the two-dimensional lamplighter group, under the assumption that the random walk has finite $(2+\epsilon)$-moment. This result is in contrast with classical examples of…
Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…
Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…
We consider a random walk $S_k$ with i.i.d. steps on a compact group equipped with a bi-invariant metric. We prove quantitative ergodic theorems for the sum $\sum_{k=1}^N f(S_k)$ with H\"older continuous test functions $f$, including the…
In this paper we apply techniques of spherical harmonic analysis to prove a local limit theorem, a rate of escape theorem, and a central limit theorem for isotropic random walks on arbitrary thick regular affine buildings of irreducible…
We consider a special case of random walk in random environment (RWRE) on Z^d where the environment is periodic (RWPE). Under natural conditions, we show that law of large numbers and central limit theorem holds. In the ballistic nearest…
Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…
We prove a quenched functional central limit theorem for a one-dimensional random walk driven by a simple symmetric exclusion process. This model can be viewed as a special case of the random walk in a balanced random environment, for which…
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
We consider super-diffusive L\'evy walks in $d \geqslant 2$ dimensions when the duration of a single step, i.e., a ballistic motion performed by a walker, is governed by a power-law tailed distribution of infinite variance and finite mean.…
The Random Walks (RW) algorithm is one of the most e - cient and easy-to-use probabilistic segmentation methods. By combining contrast terms with prior terms, it provides accurate segmentations of medical images in a fully automated manner.…
We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…
We consider a finite one-dimensional totally asymmetric simple exclusion process (TASEP) with four types of particles, $\{1,0,\bar{1},*\}$, in contact with reservoirs. Particles of species $0$ can neither enter nor exit the lattice, and…