English
Related papers

Related papers: The influence of memory in deterministic walks in …

200 papers

We survey recent results of normal and anomalous diffusion of two types of random motions with long memory in ${\Bbb R}^d$ or ${\Bbb Z}^d$. The first class consists of random walks on ${\Bbb Z}^d$ in divergence-free random drift field,…

Probability · Mathematics 2019-01-01 Bálint Tóth

Self-interacting random walks are endowed with long range memory effects that emerge from the interaction of the random walker at time $t$ with the territory that it has visited at earlier times $t'<t$. This class of non Markovian random…

Statistical Mechanics · Physics 2021-09-28 Alex Barbier--Chebbah , Olivier Benichou , Raphael Voituriez

We study the emergence of correlations between $N$ components of the position of a diffusive walker in $N$ dimensions that starts at the origin and resets to previously visited sites with certain probabilities. This is equivalent to $N$…

Statistical Mechanics · Physics 2026-03-31 Denis Boyer , Satya N. Majumdar

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

Probability · Mathematics 2022-09-30 Ercan Sönmez , Arnaud Rousselle

We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…

Statistical Mechanics · Physics 2017-04-03 A. V. Nazarenko , V. Blavatska

We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…

Probability · Mathematics 2011-10-27 Ron Rosenthal

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 study the favourite sites of a random walk evolving in a sparse random environment on the set of integers. The walker moves symmetrically apart from some randomly chosen sites where we impose random drift. We prove annealed limit…

Probability · Mathematics 2025-08-04 Alicja Kołodziejska

When the memory parameter of the elephant random walk is above a critical threshold, the process becomes superdiffusive and, once suitably normalised, converges to a non-Gaussian random variable. In a recent paper by the three first…

Probability · Mathematics 2024-09-12 Hélène Guérin , Lucile Laulin , Kilian Raschel , Thomas Simon

Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…

Physics and Society · Physics 2015-01-14 Leo Speidel , Renaud Lambiotte , Kazuyuki Aihara , Naoki Masuda

Human close-range proximity interactions are the key determinant for spreading processes like knowledge diffusion, norm adoption, and infectious disease transmission. These dynamical processes can be modeled with time-respecting paths on…

Physics and Society · Physics 2026-05-28 Silvia Guerrini , Ciro Cattuto , Lorenzo Dall'Amico

We study the phenomenon of weak ergodicity breaking for a class of globally correlated random walk dynamics defined over a finite set of states. The persistence in a given state or the transition to another one depends on the whole previous…

Statistical Mechanics · Physics 2016-12-28 Adrian A. Budini

The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…

We introduce a class of discrete random walk model driven by global memory effects. At any time the right-left transitions depend on the whole previous history of the walker, being defined by an urn-like memory mechanism. The characteristic…

Statistical Mechanics · Physics 2016-12-28 Adrian A. Budini

Very recently, a fundamental observable has been introduced and analyzed to quantify the exploration of random walks: the time $\tau_k$ required for a random walk to find a site that it never visited previously, when the walk has already…

Statistical Mechanics · Physics 2024-06-21 L. Régnier , M. Dolgushev , O. Bénichou

We introduce history-dependent discrete-time quantum random walk models by adding uncorrelated memory terms and also by modifying Hamiltonian of the walker to include couplings with memory-keeping agents. We next numerically study the…

Quantum Physics · Physics 2009-07-10 J. B. Stang , A. T. Rezakhani , B. C. Sanders

We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…

Probability · Mathematics 2016-08-08 Bojan Basrak , Drago Špoljarić

Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…

Quantum Physics · Physics 2013-05-08 Peter P. Rohde , Gavin K. Brennen , Alexei Gilchrist

Understanding how simple local interactions give rise to emergent exploration patterns is a fundamental question in statistical physics. We introduce a minimal model of two coupled agents that avoid retracing their own paths while being…

Populations and Evolution · Quantitative Biology 2026-03-24 Nick Dashti , M. N. Najafi , Debra J. Searles

The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…

Data Structures and Algorithms · Computer Science 2010-07-20 John Alexandris , Gregory Karagiorgos 'and' Ioannis Stavrakakis