Related papers: On Random Walks with a General Moving Barrier
This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…
We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…
We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any $m$ and $k$ a random walk with $k$-wise independent steps which has no stationary distribution modulo $m$.
We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
Random walk in random environment (RWRE) is a fundamental model of statistical mechanics, describing the movement of a particle in a highly disordered and inhomogeneous medium as a random walk with random jump probabilities. It has been…
We consider the branching random walk in random environment with a random absorption wall. When we add this barrier, we discuss some topics related to the survival probability. We assume that the random environment is i.i.d., $S_i$ is a…
We study random walks with stochastic resetting to the initial position on arbitrary networks. We obtain the stationary probability distribution as well as the mean and global first passage times, which allow us to characterize the effect…
We study the convex hull of the set of points visited by a two-dimensional random walker of T discrete time steps. Two natural observables that characterize the convex hull in two dimensions are its perimeter L and area A. While the mean…
Excursion set theory, where density perturbations evolve stochastically with the smoothing scale, provides a method for computing the mass function of cosmological structures like dark matter halos, sheets and filaments. The computation of…
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,…
We show how the excursion set moving barrier model for halo abundances may be generalized to the local non-Gaussian f_{nl} model. Our estimate assumes that the distribution of step sizes depends on f_{nl}, but that they are otherwise…
In this article, we study branching random walks on graphs modeling division-mutation processes inspired by adaptive immunity. We apply the theory of expander graphs on mutation rules in evolutionary processes and obtain estimates for the…
For the perimeter length and the area of the convex hull of the first $n$ steps of a planar random walk, we study $n \to \infty$ mean and variance asymptotics and establish non-Gaussian distributional limits. Our results apply to random…
There have been extensive studies of a random walk among a field of immobile traps (or obstacles), where one is interested in the probability of survival as well as the law of the random walk conditioned on its survival up to time $t$. In…
In this paper we present analytical and random walk based solutions to diffusion in semi-permeable layered media with varying diffusivity. We propose a new random walk transit model (hybrid model) based on treating the membrane permeability…
We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is a non-compact simple Lie group and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense subgroup.…
In this paper we present a combinatorial optimisation view on the routing problem for connectionless packet networks by using the metaphor of a landscape. We examine the main properties of the routing landscapes as we define them and how…
Given a random walk a method is presented to produce a matrix of transition probabilities that is consistent with that random walk. The method is a kind of reverse application of the usual ergodicity and is tested by using a transition…
In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…