Related papers: Record statistics for random walk bridges
Consider a random walk $S_n=\sum_{i=1}^n X_i$ with independent and identically distributed real-valued increments $X_i$ of zero mean and finite variance. Assume that $X_i$ is non-lattice and has a moment of order $2+\delta$. For any $x\geq…
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
In this paper we prove that under certain assumptions the transient random walk in random environment with bounded jumps (in $\mathbb{Z}$) grows much slower than the speed $n$. Precisely, there is $0<s<1$, such that although $X_n\rto$ we…
We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
We consider line ensembles of non-intersecting random walks constrained by a hard wall, each tilted by the area underneath it with geometrically growing pre-factors $\mathfrak{b}^i$ where $\mathfrak{b}>1$. This is a model for the level…
We consider dynamical percolation on the complete graph $K_n$, where each edge refreshes its state at rate $\mu \ll 1/n$, and is then declared open with probability $p = \lambda/n$ where $\lambda > 1$. We study a random walk on this…
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 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…
Consider an arbitrary transient random walk on $\Z^d$ with $d\in\N$. Pick $\alpha\in[0,\infty)$ and let $L_n(\alpha)$ be the spatial sum of the $\alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range,…
We study a one-dimensional sluggish random walk with space-dependent transition probabilities between nearest-neighbour lattice sites. Motivated by trap models of slow dynamics, we consider a model in which the trap depth increases…
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…
Continuous time random walk models with decoupled waiting time density are studied. When the spatial one jump probability density belongs to the Levy distribution type and the total time transition is exponential a generalized…
We study the asymptotic behaviour of the probability that a weighted sum of centered i.i.d. random variables X_k does not exceed a constant barrier. For regular random walks, the results follow easily from classical fluctuation theory,…
We analyze the dynamics of random walks with long-term memory (binary chains with long-range correlations) in the presence of an absorbing boundary. An analytically solvable model is presented, in which a dynamical phase-transition occurs…
We derive a universal, exact asymptotic form of the splitting probability for symmetric continuous jump processes, which quantifies the probability $ \pi_{0,\underline{x}}(x_0)$ that the process crosses $x$ before 0 starting from a given…
We study fixed-length bridge paths -- half-space excursions that start and end at a planar boundary -- for three-dimensional random walks with Henyey-Greenstein scattering angles and exponentially distributed step lengths, using Monte Carlo…
The record age tau_k, defined as the time between the k-th and k+1-st record-breaking events, is a central observable of extreme-value statistics. In Markovian processes, the absence of memory makes tau_k independent of k. How memory breaks…
For a zero-mean, unit-variance second-order stationary univariate Gaussian process we derive the probability that a record at the time $n$, say $X_n$, takes place and derive its distribution function. We study the joint distribution of the…