English
Related papers

Related papers: Anomalous diffusion of random walk on random plana…

200 papers

We study the range $R_n$ of a random walk on the $d$-dimensional lattice $\mathbb{Z}^d$ indexed by a random tree with $n$ vertices. Under the assumption that the random walk is centered and has finite fourth moments, we prove in dimension…

Probability · Mathematics 2015-11-18 Jean-François Le Gall , Shen Lin

We study an annealed model of Uniform Infinite Planar Quadrangulation (UIPQ) with an infinite two-sided self-avoiding walk (SAW), which can also be described as the result of glueing together two independent uniform infinite…

Probability · Mathematics 2017-02-22 Alessandra Caraceni , Nicolas Curien

We prove diffusive lower bounds on the rate of escape of the random walk on infinite transitive graphs. Similar estimates hold for finite graphs, up to the relaxation time of the walk. Our approach uses nonconstant equivariant harmonic…

Probability · Mathematics 2013-10-04 James R. Lee , Yuval Peres

We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…

Probability · Mathematics 2007-11-20 Noga Alon , Chen Avin , Michal Koucky , Gady Kozma , Zvi Lotker , Mark R. Tuttle

Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…

Probability · Mathematics 2007-05-23 Yuval Peres , David Revelle

We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…

Probability · Mathematics 2018-09-20 Andrea Collevecchio , Paul Jung

We prove large-time $L^2$ and distributional limit theorems for perimeter and diameter of the convex hull of $N$ trajectories of planar random walks whose increments have finite second moments. Earlier work considered $N \in \{1,2\}$ and…

Probability · Mathematics 2025-09-23 Wojciech Cygan , Tomislav Kralj , Nikola Sandrić , Stjepan Šebek , Andrew Wade , Mo Dick Wong

We construct a continuous-time non-commutative random walk on $U(\mathfrak{gl}_N)$ with dilation maps $U(\mathfrak{gl}_N)\rightarrow L^2(U(N))^{\otimes\infty}$. This is an analog of a continuous-time non-commutative random walk on the group…

Representation Theory · Mathematics 2016-12-20 Jeffrey Kuan

We demonstrate that continuous time random walks in which successive waiting times are correlated by Gaussian statistics lead to anomalous diffusion with mean squared displacement <r^2(t)>~t^{2/3}. Long-ranged correlations of the waiting…

Statistical Mechanics · Physics 2015-05-14 Vincent Tejedor , Ralf Metzler

We study the persistence exponent for the first passage time of a random walk below the trajectory of another random walk. More precisely, let $\{B_n\}$ and $\{W_n\}$ be two centered, weakly dependent random walks. We establish that…

Probability · Mathematics 2019-05-21 Bastien Mallein , Piotr Miłoś

Let $ p_n(x)=\int_0^\infty J_0(xt)[J_0(t)]^n xt\,\mathrm{d}\, t$ be Kluyver's probability density for $n$-step uniform random walks in the Euclidean plane. Through connection to a similar problem in 2-dimensional quantum field theory, we…

Classical Analysis and ODEs · Mathematics 2019-11-22 Yajun Zhou

The peeling process is an algorithmic procedure that discovers a random planar map step by step. In generic cases such as the UIPT or the UIPQ, it is known [Curien & Le Gall, Scaling limits for the peeling process on random maps, Ann. Inst.…

Probability · Mathematics 2018-03-09 Nicolas Curien , Cyril Marzouk

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…

Data Structures and Algorithms · Computer Science 2024-09-17 Jingbang Chen , Mehrdad Ghadiri , Hoai-An Nguyen , Richard Peng , Junzhao Yang

We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…

Probability · Mathematics 2016-12-28 Erich Baur

We construct random walks on simple Lie groups that quickly converge to the Haar measure for all moments up to order $t$. Specifically, a step of the walk on the unitary or orthognoal group of dimension $2^{\mathsf n}$ is a random Pauli…

Quantum Physics · Physics 2025-11-03 Jeongwan Haah , Yunchao Liu , Xinyu Tan

We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…

Probability · Mathematics 2024-11-01 Chenlin Gu , Jianping Jiang , Yuval Peres , Zhan Shi , Hao Wu , Fan Yang

We prove a new inequality bounding the probability that the random walk on a group has small total displacement in terms of the spectral and isoperimetric profiles of the group. This inequality implies that if the random walk on the group…

Probability · Mathematics 2024-06-26 Tom Hutchcroft

In this paper, we deal with the inner boundary of random walk range, that is, the set of those points in a random walk range which have at least one neighbor site outside the range. If $L_n$ be the number of the inner boundary points of…

Probability · Mathematics 2014-12-25 Izumi Okada

Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…

Quantum Physics · Physics 2023-06-13 Matheus G. Andrade , Franklin de Lima Marquezino , Daniel R. Figueiredo

We show that on every Ramanujan graph $G$, the simple random walk exhibits cutoff: when $G$ has $n$ vertices and degree $d$, the total-variation distance of the walk from the uniform distribution at time $t=\frac{d}{d-2}\log_{d-1} n +…

Probability · Mathematics 2016-08-25 Eyal Lubetzky , Yuval Peres
‹ Prev 1 4 5 6 7 8 10 Next ›