English
Related papers

Related papers: John's Walk

200 papers

We study the mixing time of a random walk on the torus, alternated with a Lebesgue measure preserving Bernoulli map. Without the Bernoulli map, the mixing time of the random walk alone is $O(1/\epsilon^2)$, where $\epsilon$ is the step…

Probability · Mathematics 2023-03-28 Gautam Iyer , Ethan Lu , James Nolen

Finding a largest Euclidean ball in a given convex body $K \subset \mathbb{R}^d$ and finding a largest volume ellipsoid in $K$ are two problems of fundamentally different nature. The first is a purely Euclidean problem, where we consider…

Metric Geometry · Mathematics 2025-08-05 Grigory Ivanov , Zsolt Lángi , Márton Naszódi , Ádám Sagmeister

We prove sharp rates of convergence to the Ewens equilibrium distribution for a family of Metropolis algorithms based on the random transposition shuffle on the symmetric group, with starting point at the identity. The proofs rely heavily…

Probability · Mathematics 2015-05-29 Yunjiang Jiang

For a discrete time quantum walk (QW) on the $N$-cycle, allowing for decoherence on the coin, we derive a number of new results, including an explicit formula for the position probability distribution. For a QW of this type, we show that…

Quantum Physics · Physics 2015-05-13 Chaobin Liu , Nelson Petulante

Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…

Mathematical Physics · Physics 2021-08-11 Yuliy Baryshnikov

We prove Gaussian concentration inequalities for maximal displacement of compactly supported random walks on a compactly generated locally compact group with polynomial growth. Concentration inequalities with different exponents hold for…

Probability · Mathematics 2026-01-28 Jérémie Brieussel , Romain Tessera , Tianyi Zheng

Let $G$ be a real Lie group, $\Lambda\subseteq G$ a lattice, and $X=G/\Lambda$. We fix a probability measure $\mu$ on $G$ and consider the left random walk induced on $X$. It is assumed that $\mu$ is aperiodic, has a finite first moment,…

Probability · Mathematics 2021-12-14 Timothée Bénard

We consider a random walk on a homogeneous Poisson point process with energy marks. The jump rates decay exponentially in the A-power of the jump length and depend on the energy marks via a Boltzmann--like factor. The case A=1 corresponds…

Probability · Mathematics 2015-05-14 P. Caputo , A. Faggionato , T. Prescott

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…

Probability · Mathematics 2010-02-10 Fabienne Castell , Nadine Guillotin-Plantard , Françoise Pène , Bruno Schapira

We study random walk with unbounded jumps in random environment. The environment is stationary and ergodic, uniformly elliptic and decays polynomially with speed $Dj^{-(3+\varepsilon_0)}$ for some small $\varepsilon_0>0$ and proper $D>0.$…

Probability · Mathematics 2014-09-30 Hua-Ming Wang

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

In this paper, we mainly concerned about deriving the general formula to count the possible positions of $n$ step random walk in $\mathbb{Z}^d$ with unit length in each step, which we denoted as $|P_n^{d}|$. For our results, we firstly…

Combinatorics · Mathematics 2022-10-04 Luchen Shi , Will McCance , Hongjie Zeng

The outer Lowner-John method is widely used in sensor fusion applications to find the smallest ellipsoid that can approximate the intersection of a set of ellipsoids, described by positive definite covariance matrices modeling the quality…

Systems and Control · Electrical Eng. & Systems 2023-05-25 Rodrigo Aldana-Lopez , Eduardo Sebastian , Rosario Aragues , Eduardo Montijano , Carlos Sagues

We consider the random walk Metropolis algorithm on $\mathbb{R}^n$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one-dimensional law. In the limit $n\to\infty$, it is well known (see [Ann.…

Probability · Mathematics 2016-08-14 Benjamin Jourdain , Tony Lelièvre , Błażej Miasojedow

A bijection is given between fixed point free involutions of $\{1,2,...,2N\}$ with maximum decreasing subsequence size $2p$ and two classes of vicious (non-intersecting) random walker configurations confined to the half line lattice points…

Combinatorics · Mathematics 2009-11-07 T. H. Baker , P. J. Forrester

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,

We analyze the differences between the horizontal and the vertical component of the simple random walk on the 2-dimensional comb. In particular we evaluate by combinatorial methods the asymptotic behaviour of the expected value of the…

Probability · Mathematics 2007-05-23 Daniela Bertacchi

Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…

Combinatorics · Mathematics 2019-11-07 Kilian Raschel , Amélie Trotignon

We study an homogeneous irreducible markovian random walk in a square lattice of arbitrary dimension, with an antisymmetric perturbation acting only in one point. We compute exactly spatial correction to the diffusive behaviour in the…

Probability · Mathematics 2016-05-24 Giuseppe Genovese , Renato Lucà

We consider random walks on ``balanced multislices'' of any ``grid'' that respects the ``symmetries'' of the grid, and show that a broad class of such walks are good spectral expanders. (A grid is a set of points of the form $\mathcal{S}^n$…

Computational Complexity · Computer Science 2025-07-16 Prashanth Amireddy , Amik Raj Behera , Srikanth Srinivasan , Madhu Sudan