English
Related papers

Related papers: Span observables - "When is a foraging rabbit no l…

200 papers

We consider a random walk $Y$ moving on a L\'evy random medium, namely a one-dimensional renewal point process with inter-distances between points that are in the domain of attraction of a stable law. The focus is on the characterization of…

Probability · Mathematics 2025-05-29 Alessandra Bianchi , Giampaolo Cristadoro , Gaia Pozzoli

We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…

Disordered Systems and Neural Networks · Physics 2025-02-14 Oleg Evnin , Weerawit Horinouchi

We analyze the mean time t_{app} that a randomly moving particle spends in a bounded domain (sphere) before it escapes through a small window in the domain's boundary. A particle is assumed to diffuse freely in the bulk until it approaches…

Soft Condensed Matter · Physics 2015-05-18 G. Oshanin , M. Tamm , O. Vasilyev

We consider a minimal model of persistent random searcher with short range memory. We calculate exactly for such searcher the mean first-passage time to a target in a bounded domain and find that it admits a non trivial minimum as function…

Statistical Mechanics · Physics 2012-02-28 V. Tejedor , R. Voituriez , O. Bénichou

This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…

Probability · Mathematics 2011-03-31 Kohei Uchiyama

One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…

Statistical Mechanics · Physics 2016-03-23 Rüdiger Kürsten

We investigate the motion of a run-and-tumble particle (RTP) in one dimension. We find the exact probability distribution of the particle with and without diffusion on the infinite line, as well as in a finite interval. In the infinite…

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

Probability · Mathematics 2016-06-14 Jonathon Peterson

We introduce the pushy random walk, where a walker can push multiple obstacles, thereby penetrating large distances in environments with finite obstacle density. This process provides a minimal model for experimentally observed interactions…

Statistical Mechanics · Physics 2026-04-07 Ofek Lauber Bonomo , Itamar Shitrit , Shlomi Reuveni , Sidney Redner

We study the extreme value statistics of a run and tumble particle (RTP) in one dimension till its first passage to the origin starting from the position $x_0~(>0)$. This model has recently drawn a lot of interest due to its biological…

Statistical Mechanics · Physics 2022-12-07 Prashant Singh , Saikat Santra , Anupam Kundu

We study a generalization of the standard trapping problem of random walk theory in which particles move subdiffusively on a one-dimensional lattice. We consider the cases in which the lattice is filled with a one-sided and a two-sided…

Statistical Mechanics · Physics 2007-05-23 S. B. Yuste , L. Acedo

We consider a three dimensional spatial network, where $N$ nodes are randomly distributed within a cube $L\times L\times L$. Each two nodes are connected if their mutual distance does not excess a given cutoff $a$. We analyse numerically…

Computational Physics · Physics 2009-04-26 Joanna Natkaniec , Krzysztof Kulakowski

In this paper, I introduce a random attention span model (RAS) which uses stopping time to identify decision-makers' behavior under limited attention. Unlike many limited attention models, the RAS identifies preferences using time variation…

Theoretical Economics · Economics 2024-05-21 Dazhuo Wei

Randomized shortest paths (RSP) are a tool developed in recent years for different graph and network analysis applications, such as modelling movement or flow in networks. In essence, the RSP framework considers the temperature-dependent…

Social and Information Networks · Computer Science 2021-12-17 Ilkka Kivimäki , Bram Van Moorter , Manuela Panzacchi , Jari Saramäki , Marco Saerens

We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the transition matrix. This is not possible in general, but at least…

Probability · Mathematics 2007-05-23 Itai Benjamini , Gady Kozma , Laszlo Lovasz , Dan Romik , Gabor Tardos

Given a domain G, a reflection vector field d(.) on the boundary of G, and drift and dispersion coefficients b(.) and \sigma(.), let L be the usual second-order elliptic operator associated with b(.) and \sigma(.). Under suitable…

Probability · Mathematics 2012-04-24 Weining Kang , Kavita Ramanan

Suppose that S is an asymptotically stable random walk with norming sequence c_{n} and that T_{x} is the time that S first enters (x,\inf), where x\ge 0. The asymptotic behaviour of P(T_0=n) has been described in a recent paper of Vatutin…

Probability · Mathematics 2010-06-29 Ronald Doney

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

We study the excited random walk, in which a walk that is at a site that contains cookies eats one cookie and then hops to the right with probability p and to the left with probability q=1-p. If the walk hops onto an empty site, there is no…

Probability · Mathematics 2009-11-10 T. Antal , S. Redner

We develop a novel and powerful method of exactly calculating various transport characteristics of waves in one-dimensional random media with (or without) coherent absorption or amplification. Using the method, we compute the probability…

Disordered Systems and Neural Networks · Physics 2009-10-31 Kihong Kim