English
Related papers

Related papers: Winning quick and dirty: the greedy random walk

200 papers

In this paper, we study the scaling limit of a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. If the probability of…

Probability · Mathematics 2018-11-30 Raphael Forien

We study biological evolution in a high-dimensional genotype space in the regime of rare mutations and strong selection. The population performs an uphill walk which terminates at local fitness maxima. Assigning fitness randomly to…

Populations and Evolution · Quantitative Biology 2015-05-28 Johannes Neidhart , Joachim Krug

We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N),…

Physics Education · Physics 2009-11-10 P. L. Krapivsky , S. Redner

We study a self-attractive random walk such that each trajectory of length $N$ is penalised by a factor proportional to $\exp ( - |R_N|)$, where $R_N$ is the set of sites visited by the walk. We show that the range of such a walk is close…

Probability · Mathematics 2020-03-04 Nathanael Berestycki , Raphael Cerf

Under suitable moment assumptions, we show that a genuinely d-dimensional step-reinforced random walk undergoes a phase transition between recurrence and transience in dimensions $d=1,2$, and that it is transient for all reinforcement…

Probability · Mathematics 2025-05-29 Shuo Qin

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

Combinatorics · Mathematics 2010-09-27 Omer Angel , Alexander E. Holroyd

Quantum walks with long-range steps $R^{-\gamma}$ ($R$ being the distance between sites) on a discrete line behave in similar ways for all $\gamma\geq2$. This is in contrast to classical random walks, which for $\gamma >3$ belong to a…

Quantum Physics · Physics 2009-11-13 Oliver Muelken , Volker Pernice , Alexander Blumen

Kinetically-grown self-avoiding walks have been studied on Watts-Strogatz small-world networks, rewired from a two-dimensional square lattice. The maximum length L of this kind of walks is limited in regular lattices by an attrition effect,…

Disordered Systems and Neural Networks · Physics 2009-11-13 Carlos P. Herrero

We study the random walk on the symmetric group $S_n$ generated by the conjugacy class of cycles of length $k$. We show that the convergence to uniform measure of this walk has a cut-off in total variation distance after $\frac{n}{k} log n$…

Probability · Mathematics 2016-05-04 Bob Hough

We consider the possible visits to visible points of a random walker moving up and right in the integer lattice (with probability $\alpha$ and $1-\alpha$, respectively) and starting from the origin. We show that, almost surely, the…

Number Theory · Mathematics 2015-12-16 Javier Cilleruelo , José L. Fernández , Pablo Fernández

The Rademacher random walk associated with a deterministic sequence $(a_n)_{n \geq 1}$ is the walk which starts at zero and, at step $i$, independently steps either up or down by $a_i$ with equal probability. We continue the study begun by…

Probability · Mathematics 2025-12-22 Satyaki Bhattacharya , Edward Crane , Tom Johnston

Let S_i be a random walk with standard exponential increments. We call \sum_{i=1}^k S_i its k-step area. The random variable V = \inf_{k \ge 1} \frac{2}{k(k+1)} \sum_{i=1}^k S_i plays important role in the study of so-called one-dimensional…

Probability · Mathematics 2007-05-23 Vladislav Vysotsky

We consider the probability that a two-dimensional random walk starting from the origin never returns to the half-line $ (- \infty,0] \times {0}$ before time $n$. Let $X^{(1)}=(X_{1},X_{2})$ be the increment of the two-dimensional random…

Probability · Mathematics 2012-12-13 Yasunari Fukai

We review recent studies demonstrating a nonuniversal (continuously variable) survival exponent for history-dependent random walks, and analyze a new example, the hard movable partial reflector. These processes serve as a simplified models…

Statistical Mechanics · Physics 2015-06-24 Ronald Dickman , Francisco Fontenele Araujo , Daniel ben-Avraham

We consider reflecting random walks on the nonnegative integers with drift of order 1/x at height x. We establish explicit asymptotics for various probabilities associated to such walks, including the distribution of the hitting time of 0…

Probability · Mathematics 2015-03-13 Kenneth S. Alexander

We consider a discrete-time random walk where the random increment at time step $t$ depends on the full history of the process. We calculate exactly the mean and variance of the position and discuss its dependence on the initial condition…

Statistical Mechanics · Physics 2009-11-10 Gunter M. Schütz , Steffen Trimper

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…

Statistical Mechanics · Physics 2019-09-02 Reza Sepehrinia , Abbas Ali Saberi , Hor Dashti-Naserabadi

We consider random walks with continuous and symmetric step distributions. We prove universal asymptotics for the average proportion of the age of the kth longest lasting record for k=1,2,... and for the probability that the record of the…

Probability · Mathematics 2017-01-12 Réka Szabó , Bálint Vető

We study a model of stochastic evolutionary game dynamics in which the probabilities that agents choose suboptimal actions are dependent on payoff consequences. We prove a sample path large deviation principle, characterizing the rate of…

Probability · Mathematics 2017-08-10 William H. Sandholm , Mathias Staudigl

Let $X = (X_1, X_2)$ be a 2-dimensional random variable and $X(n), n \in \mathbb{N}$ a sequence of i.i.d. copies of $X$. The associated random walk is $S(n)= X(1) + \cdots +X(n)$. The corresponding absorbed-reflected walk $W(n), n \in…

Probability · Mathematics 2022-06-10 Marc Peigné , Wolfgang Woess