English
Related papers

Related papers: Extreme slowdowns for one-dimensional excited rand…

200 papers

We consider the coherent exciton transport, modeled by continuous-time quantum walks, on Erd\"{o}s-R\'{e}ny graphs in the presence of a random distribution of traps. The role of trap concentration and of the substrate dilution is deepened…

Quantum Physics · Physics 2011-02-22 Elena Agliari

Let S_n=X_1+...+X_n be a sum of independent symmetric random variables such that |X_{i}|\leq 1. Denote by W_n=\epsilon_{1}+...+\epsilon_{n} a sum of independent random variables such that \prob{\eps_i = \pm 1} = 1/2. We prove that…

Probability · Mathematics 2019-11-13 Dainius Dzindzalieta , Matas Šileikis , Tomas Juškevičius

A discrete time quantum walker is considered in one dimension, where at each step, the translation can be more than one unit length chosen randomly. In the simplest case, the probability that the distance travelled is $\ell$ is taken as…

Quantum Physics · Physics 2018-10-17 Parongama Sen

We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.

Quantum Physics · Physics 2010-05-12 Norio Konno

We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Gamma. We consider all walks of length N on G, starting from v_i and ending at v_j To each such walk $w$…

Number Theory · Mathematics 2007-05-23 Igor Rivin

We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…

Combinatorics · Mathematics 2024-07-03 Hanmeng Zhan

We study a model of multi-excited random walk with non-nearest neighbour steps on $\mathbb Z$, in which the walk can jump from a vertex $x$ to either $x+1$ or $x-i$ with $i\in \{1,2,\dots,L\}$, $L\ge 1$. We first point out the multi-type…

Probability · Mathematics 2022-05-12 Tuan-Minh Nguyen

We study the simple random walk on stochastic hyperbolic half planar triangulations constructed in Angel and Ray [3]. We show that almost surely the walker escapes the boundary of the map in positive speed and that the return probability to…

Probability · Mathematics 2014-08-20 Omer Angel , Asaf Nachmias , Gourab Ray

Let $\Gamma$ be a countable group acting on a geodesic Gromov-hyperbolic metric space $X$ and $\mu$ a probability measure on $\Gamma$ whose support generates a non-elementary subsemigroup. Under the assumption that $\mu$ has a finite…

Probability · Mathematics 2021-07-14 Adrien Boulanger , Pierre Mathieu , Cagri Sert , Alessandro Sisto

We consider random walks with independent but not necessarily identical distributed increments. Assuming that the increments satisfy the well-known Lindeberg condition, we investigate the asymptotic behaviour of first-passage times over…

Probability · Mathematics 2016-11-03 Denis Denisov , Alexander Sakhanenko , Vitali Wachtel

In this paper, the leading term of the asymptotics of the number of possible final positions of a random walk on a directed Hamiltonian metric graph is found. Consideration of such dynamical systems could be motivated by problems of…

Mathematical Physics · Physics 2021-12-28 Daniil Pyatko , Vsevolod Chernyshev

Our work is motivated by Bourque and Pevzner's (2002) simulation study of the effectiveness of the parsimony method in studying genome rearrangement, and leads to a surprising result about the random transposition walk on the group of…

Probability · Mathematics 2007-05-23 Nathanael Berestycki , Rick Durrett

We consider an asymptotically stable multidimensional random walk $S(n)=(S_1(n),\ldots, S_d(n) )$. Let $\tau_x:=\min\{n>0: x_{1}+S_1(n)\le 0\}$ be the first time the random walk $S(n)$ leaves the upper half-space. We obtain the asymptotics…

Probability · Mathematics 2022-10-11 Denis Denisov , Vitali Wachtel

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

Probability · Mathematics 2018-07-19 Roberto I. Oliveira , Yuval Peres

Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…

Dynamical Systems · Mathematics 2022-10-18 Timothée Bénard

It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregular graphs, let $G$ be a random graph on $n$ vertices with…

Probability · Mathematics 2018-05-07 Anna Ben-Hamou , Eyal Lubetzky , Yuval Peres

Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…

Probability · Mathematics 2023-07-13 Ben Morris , Hamilton Samraj Santhakumar

We study the probability distribution $P(X_N=X,N)$ of the total displacement $X_N$ of an $N$-step run and tumble particle on a line, in presence of a constant nonzero drive $E$. While the central limit theorem predicts a standard Gaussian…

Statistical Mechanics · Physics 2020-05-01 Giacomo Gradenigo , Satya N. Majumdar

We define a dynamical simple symmetric random walk in one dimension, and show that there almost surely exist exceptional times at which the walk tends to infinity. This is in contrast to the usual dynamical simple symmetric random walk in…

Probability · Mathematics 2019-11-19 Martin Prigent , Matthew I. Roberts

The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…

Probability · Mathematics 2013-10-28 Valentin Féray
‹ Prev 1 8 9 10 Next ›