Related papers: Some old and basic facts about random walks on gro…
In the book [FIM], original methods were proposed to determine the invariant measure of random walks in the quarter plane with small jumps, the general solution being obtained via reduction to boundary value problems. Among other things, an…
In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless…
We study behavior in space and time of random walks in an i.i.d. random environment on Z^d, d>=3. It is assumed that the measure governing the environment is isotropic and concentrated on environments that are small perturbations of the…
Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…
In this paper we survey the theory of random walks on buildings and associated groups of Lie type and Kac-Moody groups. We begin with an introduction to the theory of Coxeter systems and buildings, taking a largely combinatorial…
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we…
. In this paper we give a survey of some recent results for random walk in random scenery (RWRS). On $\mathbb {Z}^d$, $d\geq 1$, we are given a random walk with i.i.d. increments and a random scenery with i.i.d. components. The walk and the…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
The line of investigation of the present paper goes back to a classical work of W. H. Gustafson of the 1973, in which it is described the probability that two randomly chosen group elements commute. In the same work, he gave some bounds for…
In this paper, we discuss asymptotic behavior of the capacity of the range of symmetric simple random walks on finitely generated groups. We show the corresponding strong law of large numbers and central limit theorem.
In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…
Several cycle lexicographical orders are found to describe the relative likelihood of elements of the random walks on the symmetric group generated by the conjugacy classes of transpositions, 3-cycles, and n-cycles. Spectral analysis finds…
We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a…
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 several variants of a class of random walks whose increment distributions depend on the average value of the process over its most recent $N$ steps. We investigate the speed of the process, and in particular, the limiting speed…
In this paper, we systematically summarize and enhance the understanding of weak convergence and functional limits of record numbers in discrete-time random walks under Spitzer's condition, and extend these findings to $\sigma$--record…
Random walks and Lorentz processes serve as fundamental models for Brownian motion. The study of random walks is a favorite object of probability theory, whereas that of Lorentz processes belongs to the theory of hyperbolic dynamical…
Record numbers are basic statistics in random walks, whose deviation principles are not very clear so far. In this paper, the asymptotic probabilities of large and moderate deviations for numbers of weak records in right continuous or left…
This paper states a law of large numbers for a random walk in a random iid environment on ${\mathbb Z}^d$, where the environment follows some Dirichlet distribution. Moreover, we give explicit bounds for the asymptotic velocity of the…
We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups $S_n$ and $A_n$. We consider the following models: random transposition, transpose top with…