English
Related papers

Related papers: On the affine random walk on the torus

200 papers

Let $A \subset \mathbb{R}^d$, $d\ge 2$, be a compact convex set and let $\mu = \varrho_0 dx$ be a probability measure on $A$ equivalent to the restriction of Lebesgue measure. Let $\nu = \varrho_1 dx$ be a probability measure on $B_r :=…

Differential Geometry · Mathematics 2008-05-12 Vladimir I. Bogachev , Alexander V. Kolesnikov

We study the biased random walk in positive random conductances on $\mathbb {Z}^d$. This walk is transient in the direction of the bias. Our main result is that the random walk is ballistic if, and only if, the conductances have finite…

Probability · Mathematics 2013-12-16 Alexander Fribergh

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 suppose that the distributions of…

Probability · Mathematics 2011-12-06 Nadine Guillotin-Plantard , Françoise Pène

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…

Statistical Mechanics · Physics 2009-11-11 G. Oshanin , R. Voituriez , S. Nechaev , O. Vasilyev , F. Hivert

We consider a generalized version of a directionally reinforced random walk, which was originally introduced by Mauldin, Monticino, and von Weizs\"{a}cker in \cite{drw}. Our main result is a stable limit theorem for the position of the…

Probability · Mathematics 2011-11-08 Arka Ghosh , Reza Rasxtegar , Alexander Roitershtein

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…

Statistical Mechanics · Physics 2019-09-02 Reza Sepehrinia , Abbas Ali Saberi , Hor Dashti-Naserabadi

We bound the rate of convergence to uniformity for certain random walks on the complete monomial groups G \wr S_n for any group G. These results provide rates of convergence for random walks on a number of groups of interest: the…

Probability · Mathematics 2012-08-27 Clyde H. Schoolfield,

Deterministic walks over a random set of points in one and two dimensions (d=1,2) are considered. Points (``cities'') are randomly scattered in R^d following a uniform distribution. A walker (a ``tourist''), at each time step, goes to the…

Disordered Systems and Neural Networks · Physics 2016-08-31 Gilson F. Lima , Alexandre S. Martinez , Osame Kinouchi

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

Probability · Mathematics 2012-02-28 Mohammed Abdullah

In this paper, we construct a class of random measures $\mu^{\mathbf{n}}$ by infinite convolutions. Given infinitely many admissible pairs $\{(N_{k}, B_{k})\}_{k=1}^{\infty}$ and a positive integral sequence…

Functional Analysis · Mathematics 2025-04-23 Junjie Miao , Hongyi Liu , Hongbo Zhao

A functional approach for the study of the random walks in random sceneries (RWRS) is proposed. Under fairly general assumptions on the random walk and on the random scenery, functional limit theorems are proved. The method allows to study…

Probability · Mathematics 2009-03-06 Clément Dombry , Nadine Guillotin-Plantard

We consider random walks on non-amenable Baumslag-Solitar groups BS(p,q) and describe their Poisson-Furstenberg boundary. The latter is a probabilistic model for the long-time behaviour of the random walk. In our situation, we identify it…

Probability · Mathematics 2017-11-16 Johannes Cuno , Ecaterina Sava-Huss

We establish the existence of generalized Busemann functions and Gibbs-Dobrushin-Landford-Ruelle measures for a general class of lattice random walks in random potential with finitely many admissible steps. This class encompasses directed…

Probability · Mathematics 2025-01-16 Sean Groathouse , Christopher Janjigian , Firas Rassoul-Agha

Given $n$ independent random marked $d$-vectors $X_i$ with a common density, define the measure $\nu_n = \sum_i \xi_i $, where $\xi_i$ is a measure (not necessarily a point measure) determined by the (suitably rescaled) set of points near…

Probability · Mathematics 2007-05-23 Mathew D. Penrose

Squaring and adding $\pm 1$ mod p generates a curiously intractable random walk. A similar process over the finite field $\mathbf{F}_q$ (with $q=2^d$) leads to novel connections between elementary Galois theory and probability.

Probability · Mathematics 2021-07-08 Persi Diaconis , Jimmy He , I. Martin Isaacs

We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…

Probability · Mathematics 2023-07-26 Theo van Uem

We are interested in the random walk in random environment on an infinite tree. Lyons and Pemantle [11] give a precise recurrence/transience criterion. Our paper focuses on the almost sure asymptotic behaviours of a recurrent random walk…

Probability · Mathematics 2007-05-23 Yueyun Hu , Zhan Shi

Let $\mu_1, \mu_2$ be probability measures on $\mathrm{Diff}^1_+(S^1)$ satisfying a suitable moment condition and such that their supports genererate discrete groups acting proximally on $S^1$. Let $(f^n_\omega)_{n \in \mathbb{N}},…

Group Theory · Mathematics 2025-02-18 Martín Gilabert Vio

We consider the cover time for a simple random walk on the two-dimensional discrete torus of side length $n$. Dembo, Peres, Rosen, and Zeitouni [Ann. Math. 160:433-464, 2004] identified the leading term in the asymptotics for the cover time…

Probability · Mathematics 2020-04-21 Yoshihiro Abe

The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of…

Probability · Mathematics 2013-09-26 János Pach , Gábor Tardos