Related papers: A train track directed random walk on $Out(F_r)$

This paper studies a family of random walks defined on the finite ordinals using their order reversing involutions. Starting at $x \in \{0,1,\ldots,n-1\}$, an element $y \le x$ is chosen according to a prescribed probability distribution,…

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

We study periodic wind-tree models, unbounded planar billiards with periodically located rectangular obstacles. For a class of rational parameters we show the existence of completely periodic directions, and recurrence; for another class of…

We consider a random walk on the mapping class group of a surface of finite type. We assume that the random walk is determined by a probability measure whose support is finite and generates a non-elementary subgroup $H$. We further assume…

Diffusion is modeled on the recently proposed Hanoi networks by studying the mean- square displacement of random walks with time, <r^2>~t^{2/d_w}. It is found that diffusion - the quintessential mode of transport throughout Nature -…

We consider random walks on the cone of $m \times m$ positive definite matrices, where the underlying random matrices have orthogonally invariant distributions on the cone and the Riemannian metric is the measure of distance on the cone. By…

We provide first evidence that under certain conditions, 1/2-spin fermions may naturally behave like a Grover search, looking for topological defects in a material. The theoretical framework is that of discrete-time quantum walks (QW), i.e.…

As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…

This paper gives conditions for the rightmost particle in the $n$th generation of a multitype branching random walk to have a speed, in the sense that its location divided by n converges to a constant as n goes to infinity. Furthermore, a…

We study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any $\varepsilon>0$ there exists $C>1$ such that the trace of the simple random walk of length $(1+\varepsilon)n\ln{n}$ on the random…

In this paper we study a random walk on an affine building of type $\tilde{A}_r$, whose radial part, when suitably normalized, converges to the Brownian motion of the Weyl chamber. This gives a new discrete approximation of this process,…

We find uniform lower bounds on the drift for a large family of random walks on graph products, of the form $ \mathbb{P} (|Z_{n}| \leq \kappa n) \leq e ^{-\kappa n} $ for $ \kappa > 0 $. This includes the simple random walk for a…

. 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…

We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…

We give criteria for ergodicity, transience and null recurrence for the random walk in random environment on {0,1,2,...}, with reflection at the origin, where the random environment is subject to a vanishing perturbation. Our results…

Continuing from the author's previous article 'Random walks and contracting elements I', we study random walks on (possibly asymmetric) metric spaces using the bounded geodesic image property (BGIP) of certain isometries. As an application,…

We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…

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…

A global picture of a random particle movement is given by the convex hull of the visited points. We obtained numerically the probability distributions of the volume and surface of the convex hulls of a selection of three types of…

We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in $\tilde{O}(n^{4/3}m^{1/2}+n^{2})$ time (The $\tilde{O}(\cdot)$ notation hides $\operatorname{polylog}(n)$…