Related papers: Divisibility and primality in random walks
Random walkers characterized by random positions and random velocities lead to normal diffusion. A random walk was originally proposed by Einstein to model Brownian motion and to demonstrate the existence of atoms and molecules. Such a…
We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…
We present continuum models that describe the evolution of the position of a random walker on a growing network using four different growth algorithms. Three of these involve a random element, including one in which the motility rate of the…
This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a function of its summands as their number tends to infinity. In the large deviation range of the…
A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard $n$-dimensional…
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…
We present a simple model of a random walk with partial memory, which we call the \emph{random memory walk}. We introduce this model motivated by the belief that it mimics the behavior of the once-reinforced random walk in high dimensions…
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…
This thesis examines edge-reinforced random walks with some modifications to the standard definition. An overview of known results relating to the standard model is given and the proof of recurrence for the standard linearly edge-reinforced…
We consider random walks on the nonnegative integers in a space-time dependent random environment. We assume that transition probabilities are given by independent $\mathrm{Beta}(\mu,\mu)$ distributed random variables, with a specific…
We propose results of the investigation of properties of the random sums of random variables. We consider the case, where the number of summands is the first moment of an event occurrence. An integral equation is presented that determines…
The Bernoulli sieve is a random allocation scheme obtained by placing independent points with the uniform [0,1] law into the intervals made up by successive positions of a multiplicative random walk with factors taking values in the…
We consider iterated preimages of curves by random products of birational transformations of the plane. Following a recent work of Diller and Roeder, we study the action of the Cremona group on the inverse limit of the spaces of currents in…
We study the recurrence properties of a random walk in a stratified medium.
In one-dimensional diffusive processes with discrete steps characterized by geometrically decaying magnitudes, the usual Gaussian broadening familiar from Brownian motion is replaced by bounded probability distributions over particle…
We present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found…
We characterize ballistic behavior for general i.i.d. random walks in random environments on $\mathbb{Z}$ with bounded jumps. The two characterizations we provide do not use uniform ellipticity conditions. They are natural in the sense that…
Strong ratio limit theorems associated with a broad class of spread out random walks on unimodular groups were proved in the preceding paper, where these random walks were assumed to have the convergence parameter $R=1$. In the present…
Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a…
We consider the distribution of the binomial probability mass function (pmf) among arithmetic progressions and obtain an average-type theorem. As applications, we consider the possible visits to a kind of sieved sets of integers or lattice…