Related papers: Full Record Statistics of 1d Random Walks
In this paper, we systematically summarize and enhance the understanding of weak convergence and functional limits of record numbers in discrete-time random walks under Spitzer's condition, and extend these findings to $\sigma$--record…
We compute exactly the statistics of the number of records in a discrete-time random walk model on a line where the walker stays at a given position with a nonzero probability $0\leq p \leq 1$, while with the complementary probability…
We consider several variants of a class of random walks whose increment distributions depend on the average value of the process over its most recent $N$ steps. We investigate the speed of the process, and in particular, the limiting speed…
Record statistics is the study of how new highs or lows are created and sustained in any dynamical process. The study of the highest or lowest records constitute the study of extreme values. This paper represents an exploration of record…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…
We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…
Continuous-time random walks (CTRW) play important role in understanding of a wide range of phenomena. However, most theoretical studies of these models concentrate only on stationary-state dynamics. We present a new theoretical approach,…
A novel version of the Continuous-Time Random Walk (CTRW) model with memory is developed. This memory means the dependence between arbitrary number of successive jumps of the process, while waiting times between jumps are considered as…
We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…
We consider the statistics of occupation times, the number of visits at the origin and the survival probability for a wide class of stochastic processes, which can be classified as renewal processes. We show that the distribution of these…
Random walks on graphs are an essential primitive for many randomised algorithms and stochastic processes. It is natural to ask how much can be gained by running $k$ multiple random walks independently and in parallel. Although the cover…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…
The mean-squared displacement (MSD) is an averaged quantity widely used to assess anomalous diffusion. In many cases, such as molecular motors with finite processivity, dynamics of the system of interest produce trajectories of varying…
A sufficient condition for the uniqueness of multinomial sequential unbiased estimators is provided generalizing a classical result for binomial samples. Unbiased estimators are applied to infer the parameters of multidimensional or…
We study a simple run-and-tumble random walk whose switching frequency from run mode to tumble mode and the reverse depend on a stochastic signal. We consider a particularly sharp, step-like dependence, where the run to tumble switching…
The continuous time random walk model has been widely applied in various fields, including physics, biology, chemistry, finance, social phenomena, etc. In this work, we present an algorithm that utilizes a subordinate formula to generate…
We consider a ballistic random walk in an i.i.d. random environment that does not allow retreating in a certain fixed direction. Homogenization and regeneration techniques combine to prove a law of large numbers and an averaged invariance…
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various timescales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis…
We consider empirical multi-dimensional Rare Events Point Processes that keep track both of the time occurrence of extremal observations and of their severity, for stochastic processes arising from a dynamical system, by evaluating a given…
Functional limit theorem for continuous-time random walks (CTRW) are found in general case of dependent waiting times and jump sizes that are also position dependent. The limiting anomalous diffusion is described in terms of fractional…