English
Related papers

Related papers: John's Walk

200 papers

We consider a random walk on the support of an ergodic simple point process on R^d, d>1, furnished with independent energy marks. The jump rates of the random walk decay exponentially in the jump length and depend on the energy marks via a…

Mathematical Physics · Physics 2007-05-23 A. Faggionato , P. Mathieu

Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated…

Quantum Physics · Physics 2024-12-02 Shyam Dhamapurkar , Yuhang Dang , Saniya Wagh , Xiu-Hao Deng

For a homogeneous random walk in the quarter plane with nearest-neighbor transitions, starting from some state $(i_0,j_0)$, we study the event that the walk reaches the vertical axis, before reaching the horizontal axis. We derive an exact…

Probability · Mathematics 2013-06-18 Johan S. H. van Leeuwaarden , Kilian Raschel

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

Dynamical Systems · Mathematics 2015-08-17 Péter Pál Varjú

The paper analyzes a specific class of random walks on quotients of $X:=\text{SL}(k,{\Bbb R})/ \Gamma$ for a lattice $\Gamma$. Consider a one parameter diagonal subgroup, $\{g_t\}$, with an associated abelian expanding horosphere, $U\cong…

Dynamical Systems · Mathematics 2015-10-12 C. Davis Buenger

In this paper, we study the problem of sampling from distributions of the form p(x) \propto e^{-\beta f(x)} for some function f whose values and gradients we can query. This mode of access to f is natural in the scenarios in which such…

Probability · Mathematics 2020-09-22 Ankur Moitra , Andrej Risteski

Given a countably infinite group $G$ acting on some space $X$, an increasing family of finite subsets $G_n$ and $x\in X$, a natural question to ask is what asymptotical distribution the sets $G_nx$ form. More formally, we define for a…

Dynamical Systems · Mathematics 2020-09-23 Uriya Pumerantz

Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…

Probability · Mathematics 2017-08-11 Bala Rajaratnam , Narut Sereewattanawoot , Doug Sparks , Meng-Hsuan Wu

For the perimeter length $L_n$ and the area $A_n$ of the convex hull of the first $n$ steps of a planar random walk, this thesis study $n \to \infty$ mean and variance asymptotics and establish distributional limits. The results apply to…

Probability · Mathematics 2017-09-07 Chang Xu

We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any…

Quantum Physics · Physics 2011-04-21 Andre Ahlbrecht , Holger Vogts , Albert H. Werner , Reinhard F. Werner

We propose a method for zeroth order stochastic convex optimization that attains the suboptimality rate of $\tilde{\mathcal{O}}(n^{7}T^{-1/2})$ after $T$ queries for a convex bounded function $f:{\mathbb R}^n\to{\mathbb R}$. The method is…

Machine Learning · Computer Science 2014-02-13 Tengyuan Liang , Hariharan Narayanan , Alexander Rakhlin

We prove that the well-studied triangulation flip walk on a convex point set mixes in time O(n^3 log^3 n), the first progress since McShine and Tetali's O(n^5 log n) bound in 1997. In the process we give lower and upper bounds of…

Combinatorics · Mathematics 2023-05-05 David Eppstein , Daniel Frishberg

We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties for the environment as seen from the position of the walker,…

Probability · Mathematics 2013-10-04 Frank Redig , Florian Völlering

Determining the mixing time of Kac's random walk on the sphere $\mathrm{S}^{n-1}$ is a long-standing open problem. We show that the total variation mixing time of Kac's walk on $\mathrm{S}^{n-1}$ is between $\frac{1}{2} \, n \log(n)$ and…

Probability · Mathematics 2016-04-01 Natesh S. Pillai , Aaron Smith

We consider homogeneous open quantum random walks on a lattice with finite dimensional local Hilbert space and we study in particular the position process of the quantum trajectories of the walk. We prove that the properly rescaled position…

Probability · Mathematics 2022-06-08 Raffaella Carbone , Federico Girotti , Anderson Melchor Hernandez

We introduce ellipticity criteria for random walks in i.i.d. random environments under which we can extend the ballisticity conditions of Sznitman's and the polynomial effective criteria of Berger, Drewitz and Ramirez originally defined for…

Probability · Mathematics 2014-06-05 David Campos , Alejandro F. Ramirez

We consider a random walk on a closed manifold $M$ driven by a probability measure $\mu$ on the space of $C^2$ diffeomorphisms. Provided $\mu$ has compact support, satisfies certain gap and pinching conditions, and is weak-$*$ close to a…

Dynamical Systems · Mathematics 2026-05-27 Timothée Bénard , Zhiyuan Zhang

We study quenched distributions on random walks in a random potential on integer lattices of arbitrary dimension and with an arbitrary finite set of admissible steps. The potential can be unbounded and can depend on a few steps of the walk.…

Probability · Mathematics 2011-12-15 Firas Rassoul-Agha , Timo Seppalainen , Atilla Yilmaz

We consider homogeneous random walks in the quarter-plane. The necessary conditions which characterize random walks of which the invariant measure is a sum of geometric terms are provided in [2,3]. Based on these results, we first develop…

Probability · Mathematics 2015-02-26 Yanting Chen , Richard J. Boucherie , Jasper Goseling

Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…

Probability · Mathematics 2018-07-24 Jian Ding , Changji Xu
‹ Prev 1 3 4 5 6 7 10 Next ›