Related papers: On sequences of records generated by planar random…
We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the…
Models of random walks are considered in which walkers are born at one location and die at all other locations with uniform death rate. Steady-state distributions of random walkers exhibit dimensionally dependent critical behavior as a…
In this paper, we are concerned with mean hitting time $\langle\mathcal{H}\rangle$ for random walks on recursive growth tree networks that are built based on an arbitrary tree as the seed via implementing various primitive graphic…
In this paper the multi-dimensional random walk models governed by distributed fractional order differential equations and multi-term fractional order differential equations are constructed. The scaling limits of these random walks to a…
In this paper, we study a class of random walks that build their own tree. At each step, the walker attaches a random number of leaves to its current position. The model can be seen as a subclass of the Random Walk in Changing Environments…
In this paper, we consider a stochastic process that may experience random reset events which relocate the system to its starting position. We focus our attention on a one-dimensional, monotonic continuous-time random walk with a constant…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…
The deviation principles of record numbers in random walk models have not been completely investigated, especially for the non-nearest neighbor cases. In this paper, we derive the asymptotic probabilities of large and moderate deviations…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…
Through the analysis of unbiased random walks on fractal trees and continuous time random walks, we show that even if a process is characterized by a mean square displacement (MSD) growing linearly with time (standard behaviour) its…
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…
It is well known that the mean field theory of directed polymers in a random medium exhibits replica symmetry breaking with a distribution of overlaps which consists of two delta functions. Here we show that the leading finite size…
We prove a law of large numbers for the range of rotor walks with random initial configuration on regular trees and on Galton-Watson trees. More precisely, we show that on the classes of trees under consideration, even in the case when the…
An ordinal pattern for a finite sequence of real numbers is a permutation that records the relative positions in the sequence. For random walks with steps drawn uniformly from $[-1,1]$, we show an ordinal pattern occurs with probability…
We study the densities of uniform random walks in the plane. A special focus is on the case of short walks with three or four steps and less completely those with five steps. As one of the main results, we obtain a hypergeometric…
We analyze random walk through fractal environments, embedded in 3-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
A method is described to count simple diagonal walks on $\mathbb{Z}^2$ with a fixed starting point and endpoint on one of the axes and a fixed winding angle around the origin. The method involves the decomposition of such walks into smaller…
The Fourier-Bessel expansion of a function on a circular disc yields a simple series representation for the end-to-end probability distribution function w(R,phi) encountered in a planar persistent random walk, where the direction taken in a…