English
Related papers

Related papers: Total variation bound for Kac's random walk

200 papers

Mixing of finite time-homogeneous Markov chains is well understood nowadays, with a rich set of techniques to estimate their mixing time. In this paper, we study the mixing time of random walks in dynamic random environments. To that end,…

Probability · Mathematics 2023-09-27 Raphael Erb

For first passage percolation (FPP) on Euclidean lattices $\mathbb{Z}^d$ with $d\ge 2$, it is expected that the variance of the first passage time between two points grows sublinearly in the distance with a universal exponent strictly…

Probability · Mathematics 2026-04-02 Riddhipratim Basu , Vladas Sidoravicius , Allan Sly

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for $N$-fold star power graph, which are invariant under the quantum…

Quantum Physics · Physics 2015-05-13 S. Salimi

We consider discrete-time branching random walks with a radially symmetric distribution. Independently of each other individuals generate offspring whose relative locations are given by a copy of a radially symmetric point process…

Probability · Mathematics 2025-08-11 Viktor Bezborodov , Nina Gantert

By viewing the $N$-simplex as the set of positions of $N-1$ ordered particles on the unit interval, the adjacent walk is the continuous time Markov chain obtained by updating independently at rate 1 the position of each particle with a…

Probability · Mathematics 2020-11-16 Pietro Caputo , Cyril Labbé , Hubert Lacoin

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…

Probability · Mathematics 2019-03-29 Ross G. Pinsky

We study the random walk in random environment on {0,1,2,...}, where the environment is subject to a vanishing (random) perturbation. The two particular cases we consider are: (i) random walk in random environment perturbed from Sinai's…

Probability · Mathematics 2008-05-13 M. V. Menshikov , Andrew R. Wade

Consider a continuous time random walk in $\mathbb{Z}$ with independent and exponentially distributed jumps $\pm1$. The model in this paper consists in an infinite number of such random walks starting from the complement of…

Mathematical Physics · Physics 2013-07-25 Mark Adler , Patrik L. Ferrari , Pierre van Moerbeke

Let $\{S_n, n\geq1\}$ be a random walk wih independent and identically distributed increments and let $\{g_n,n\geq1\}$ be a sequence of real numbers. Let $T_g$ denote the first time when $S_n$ leaves $(g_n,\infty)$. Assume that the random…

Probability · Mathematics 2018-01-15 Denis Denisov , Alexander Sakhanenko , Vitali Wachtel

We study the convergence rate of translation-invariant discrete-time quantum dynamics on a one-dimensional lattice. We prove that the cumulative distributions function of the ballistically scaled position $X(n)/{n}$ after $n$ steps…

Mathematical Physics · Physics 2026-01-27 Benjamin Hinrichs , Pascal Mittenbühler

Cauchy's formula was originally established for random straight paths crossing a body $B \subset \mathbb{R}^{n}$ and basically relates the average chord length through $B$ to the ratio between the volume and the surface of the body itself.…

Statistical Mechanics · Physics 2014-09-03 Alain Mazzolo , Clélia de Mulatier , Andrea Zoia

Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…

Quantum Physics · Physics 2007-05-23 Peter C. Richter

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

Probability · Mathematics 2010-01-13 Remco van der Hofstad , Mark Holmes

Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…

Discrete Mathematics · Computer Science 2022-01-19 Nobutaka Shimizu , Takeharu Shiraga

We define a random walk of a particle in $\mathbb{R}^3$ where the space is rotating. The particle is not glued to the space and will collide with it at random times, resulting in changes in its velocity and direction. After many collisions,…

Probability · Mathematics 2023-12-06 Alberto M. Campos , Tarcísio P. R. Campos

Motivated by the Dikin walk, we develop aspects of an interior-point theory for sampling in high dimension. Specifically, we introduce a symmetric parameter and the notion of strong self-concordance. These properties imply that the…

Data Structures and Algorithms · Computer Science 2020-07-13 Aditi Laddha , Yin Tat Lee , Santosh Vempala

Consider an arbitrary transient random walk on $\Z^d$ with $d\in\N$. Pick $\alpha\in[0,\infty)$ and let $L_n(\alpha)$ be the spatial sum of the $\alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range,…

Probability · Mathematics 2008-05-07 Mathias Becker , Wolfgang Konig

Let $G$ be a connected simple real Lie group, $\Lambda_{0}\subseteq G$ a lattice and $\Lambda \unlhd \Lambda_{0}$ a normal subgroup such that $\Lambda_{0}/\Lambda\simeq \mathbb{Z}^d$. We study the drift of a random walk on the…

Dynamical Systems · Mathematics 2021-12-21 Timothée Bénard

We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a…

Probability · Mathematics 2013-03-21 Erol A. Peköz , Adrian Röllin , Nathan Ross

We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…

Probability · Mathematics 2011-10-27 Ron Rosenthal