Related papers: Rate functions for random walks on Random conuctan…
In this paper, we consider a generalization of the elephant random walk model. Compared to the usual elephant random walk, an interesting feature of this model is that the step sizes form a sequence of positive independent and identically…
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…
We discuss the quenched tail estimates for the random walk in random scenery. The random walk is the symmetric nearest neighbor walk and the random scenery is assumed to be independent and identically distributed, non-negative, and has a…
Functional limit theorem for continuous-time random walks (CTRW) are found in general case of dependent waiting times and jump sizes that are also position dependent. The limiting anomalous diffusion is described in terms of fractional…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
We introduce a random walk in random environment associated to an underlying directed polymer model in $1+1$ dimensions. This walk is the positive temperature counterpart of the competition interface of percolation and arises as the limit…
We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting random walks on the simplex of probability measures over a finite set. Due to a reinforcement mechanism, the increments of the walks are…
Let $G$ be a finitely generated group of polynomial volume growth equipped with a word-length $|\cdot|$. The goal of this paper is to develop techniques to study the behavior of random walks driven by symmetric measures $\mu$ such that, for…
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…
Randomized shortest paths (RSP) are a tool developed in recent years for different graph and network analysis applications, such as modelling movement or flow in networks. In essence, the RSP framework considers the temperature-dependent…
Although the theoretical behavior of one-dimensional random walks in random environments is well understood, the numerical evaluation of various characteristics of such processes has received relatively little attention. This paper develops…
We study space-time fluctuations around a characteristic line for a one-dimensional interacting system known as the random average process. The state of this system is a real-valued function on the integers. New values of the function are…
We propose a random walks based model to generate complex networks. Many authors studied and developed different methods and tools to analyze complex networks by random walk processes. Just to cite a few, random walks have been adopted to…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
Rotor walk is a deterministic analogue of simple random walk. For any given graph, we construct a rotor configuration for which the escape rate of the corresponding rotor walk is equal to the escape rate of simple random walk, and thus…
For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…
In the past decade, the use of ordinal patterns in the analysis of time series and dynamical systems has become an important and rich tool. Ordinal patterns (otherwise known as a permutation patterns) are found in time series by taking $n$…
In this paper we establish Functional Limit Theorems for the range of random walks in $\mathbb{Z}^d$ that are in the domain of attraction of a non-degenerate $\beta$-stable process in the weakly transient and recurrent regimes. These…
The article provides an explicit algebraic expression for the generating function of walks on graphs. Its proof is based on the scattering theory for the differential Laplace operator on non-compact graphs.
Donsker's invariance principle is shown to hold for random walks in rough path topology. As application, we obtain Donsker-type weak limit theorems for stochastic integrals and differential equations.