English
Related papers

Related papers: Universal Order Statistics of Random Walks

200 papers

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…

Quantum Physics · Physics 2015-03-13 Apoorva Patel , Md. Aminoor Rahaman

The probability distribution of random walks on linear structures generated by random walks in $d$-dimensional space, $P_d(r,t)$, is analytically studied for the case $\xi\equiv r/t^{1/4}\ll1$. It is shown to obey the scaling form…

Condensed Matter · Physics 2019-08-17 Savely Rabinovich , H. Eduardo Roman , Shlomo Havlin , Armin Bunde

We study the long-time behavior of the probability density associated with the decoupled continuous-time random walk which is characterized by a superheavy-tailed distribution of waiting times. It is shown that if the random walk is…

Statistical Mechanics · Physics 2011-05-02 S. I. Denisov , H. Kantz

We study the maximal displacement of branching random walks in a class of time inhomogeneous environments. Specifically, binary branching random walks with Gaussian increments will be considered, where the variances of the increments change…

Probability · Mathematics 2011-12-07 Ofer Zeitouni , Ming Fang

We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…

Combinatorics · Mathematics 2019-02-11 Kiana Mittelstaedt

In this manuscript we consider the set of Dyck paths equipped with the uniform measure, and we study the statistical properties of a deformation of the observable "area below the Dyck path" as the size $N$ of the path goes to infinity. The…

Combinatorics · Mathematics 2020-10-29 Sergio Caracciolo , Vittorio Erba , Andrea Sportiello

Brownian motion is a Gaussian process described by the central limit theorem. However, exponential decays of the positional probability density function $P(X,t)$ of packets of spreading random walkers, were observed in numerous situations…

Statistical Mechanics · Physics 2020-02-18 Eli Barkai , Stanislav Burov

We study the large deviations of one-dimensional excited random walks. We prove a large deviation principle for both the hitting times and the position of the random walk and give a qualitative description of the respective rate functions.…

Probability · Mathematics 2016-06-14 Jonathon Peterson

We investigate the work fluctuations in an overdamped non-equilibrium process that is stopped at a stochastic time. The latter is characterized by a first passage event that marks the completion of the non-equilibrium process. In…

Statistical Mechanics · Physics 2024-03-20 Iago N Mamede , Prashant Singh , Arnab Pal , Carlos E. Fiore , Karel Proesmans

We develop a framework to determine the complete statistical behavior of a fundamental quantity in the theory of random walks, namely, the probability that $n_1$, $n_2$, $n_3$, . . . distinct sites are visited at times $t_1$, $t_2$, $t_3$,…

Statistical Mechanics · Physics 2022-06-22 Léo Régnier , Maxim Dolgushev , Sidney Redner , Olivier Bénichou

We consider a class of discrete-time random walks with directed unit steps on the integer line. The direction of the steps is reversed at the time instants of events in a discrete-time renewal process and is maintained at uneventful time…

Probability · Mathematics 2023-01-04 Thomas M. Michelitsch , Federico Polito , Alejandro P. Riascos

A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distribution after N steps is determined by reshuffling the first N distributions that arise in a classical random walk with the same initial…

Quantum Physics · Physics 2009-11-10 Anthony J. Bracken , Demosthenes Ellinas , Ioannis Tsohantjis

For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…

Probability · Mathematics 2025-05-12 Aritra Majumdar , Krishanu Maulik

The classicalization of a decoherent discrete-time quantum walk on a line or an n-cycle can be demonstrated in various ways that do not necessarily provide a geometry-independent description. For example, the position probability…

Quantum Physics · Physics 2010-06-25 R. Srikanth , Subhashish Banerjee , C. M. Chandrashekar

We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…

Data Structures and Algorithms · Computer Science 2024-06-04 Vedat Levi Alev , Shravas Rao

In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…

Probability · Mathematics 2018-05-25 Oriane Blondel , Marcelo R. Hilario , Augusto Teixeira

We study the record statistics of random walks after $n$ steps, $x_0, x_1,\ldots, x_n$, with arbitrary symmetric and continuous distribution $p(\eta)$ of the jumps $\eta_i = x_i - x_{i-1}$. We consider the age of the records, i.e. the time…

Statistical Mechanics · Physics 2014-06-09 Claude Godreche , Satya N. Majumdar , Gregory Schehr

Anomalous diffusion phenomena occur on length scales spanning from intracellular to astrophysical ranges. A specific form of decay at large argument of the probability density function of rescaled displacement (scaling function) is derived…

Statistical Mechanics · Physics 2023-05-23 Attilio L. Stella , Aleksei Chechkin , Gianluca Teza

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…

Data Structures and Algorithms · Computer Science 2021-02-16 Amartya Shankha Biswas , Edward Pyne , Ronitt Rubinfeld

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