Related papers: Classification on the average of random walks

We introduce a novel operator to describe a random walk process on a simplicial complex. Walkers are allowed to wonder across simplices of various dimensions, bridging nodes to edges, and edges to triangles, via a nested organization that…

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 study the analogues of irreducibility, period, and communicating classes for open quantum random walks, as defined by Attal et al. (J. Stat. Phys., 2012). We recover results similar to the standard ones for Markov chains, in terms of…

Benjamini, Haggstrom, Peres and Steif introduced the concept of a dynamical random walk. This is a continuous family of random walks, {S_n(t)}. Benjamini et. al. proved that if d=3 or d=4 then there is an exceptional set of t such that…

The authors propose a new variation of random walks called ladder chains $L(r,s,p)$. We extend concepts such as ruin probability, hitting time, transience and recurrence of random walks to ladder chain. Take $L(2,2,p)$ for instance, we find…

We introduce a general model of trapping for random walks on graphs. We give the possible scaling limits of these Randomly Trapped Random Walks on $\mathbb {Z}$. These scaling limits include the well-known fractional kinetics process, the…

We study recurrence properties and the validity of the (weak) law of large numbers for (discrete time) processes which, in the simplest case, are obtained from simple symmetric random walk on $\Z$ by modifying the distribution of a step…

This paper considers 1-dimensional generalized random walks in random scenery. That is, the steps of the walk are generated by an arbitrary stationary process, and also the scenery is a priori arbitrary stationary. Under an ergodicity…

The paper deals with a new class of random walks strictly connected with the Pareto distribution. We consider stochastic processes in the sense of generalized convolution or weak generalized convolution following the idea given in [1]. The…

In a recent letter [PRL 80 (1998) 3539] Fisher, Le Doussal and Monthus report new predictions for the persistence properties of Sinai's model, which they obtain by using an approximate real space renormalization group scheme. In this…

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…

We compute the average shape of trajectories of some one--dimensional stochastic processes x(t) in the (t,x) plane during an excursion, i.e. between two successive returns to a reference value, finding that it obeys a scaling form. For…

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…

We consider a model of random walk in ${\mathbb Z}^2$ with (fixed or random) orientation of the horizontal lines (layers) and with non constant iid probability to stay on these lines. We prove the transience of the walk for any fixed…

Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…

Random walks over directed graphs are used to model activities in many domains, such as social networks, influence propagation, and Bayesian graphical models. They are often used to compute the importance or centrality of individual nodes…

This note contains old instead of new results about random walks on groups, which may serve as a small supplement to the author's monograph ``Random Walks on Infinite Graphs and Groups'' (Cambridge Univ. Press 2000/2009). First, we exhibit…

We investigate the paramater of the average range of $M$-Lipschitz mapping of a given graph. We focus on well-known classes such as paths, complete graphs, complete bipartite graphs and cycles and show closed formulas for computing this…

We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…

In this article, the continuous time random walk on the circle is studied. We derive the corresponding generalized master equation and discuss the effects of topology, especially important when Levy flights are allowed. Then, we work out…