Related papers: Most likely paths to error when estimating the mea…
The Join-the-Shortest-Queue routing policy is studied in an asymptotic regime where the number of processors $n$ scales with the arrival rate. A large deviation principle (LDP) for the occupancy process is established, as $n\to \infty$, in…
The purpose of this paper is to investigate the asymptotic behavior of the multi-dimensional elephant random walk (MERW). It is a non-Markovian random walk which has a complete memory of its entire history. A wide range of literature is…
We take the point of view of a particle performing random walk with bounded jumps on $\mathbb{Z}^d$ in a stationary and ergodic random environment. We prove the quenched large deviation principle (LDP) for the pair empirical measure of the…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…
Random walk sampling methods have been widely used in graph sampling in recent years, while it has bias towards higher degree nodes in the sample. To overcome this deficiency, classical methods such as MHRW design weighted walking by…
We numerically estimate the leading asymptotic behavior of the length $L_{n}$ of the longest increasing subsequence of random walks with step increments following Student's $t$-distribution with parameter in the range $1/2 \leq \nu \leq 5$.…
In this paper, we are interested in the asymptotic behaviour of the sequence of processes $(W_n(s,t))_{s,t\in[0,1]}$ with \begin{equation*} W_n(s,t):=\sum_{k=1}^{\lfloor nt\rfloor}\big(1_{\{\xi_{S_k}\leq s\}}-s\big) \end{equation*} where…
Much work in the study of large deviations for random graph models is focused on the dense regime where the theory of graphons has emerged as a principal tool. These tools do not give a good approach to large deviation problems for random…
We consider a one-dimensional recurrent random walk in random environment (RWRE) when the environment is i.i.d. with a parametric, finitely supported distribution. Based on a single observation of the path, we provide a maximum likelihood…
We discuss large deviation properties of continuous-time random walks (CTRW) and present a general expression for the large deviation rate in CTRW in terms of the corresponding rates for the distributions of steps' lengths and waiting…
This paper is devoted to the asymptotic analysis of the reinforced elephant random walk (RERW) using a martingale approach. In the diffusive and critical regimes, we establish the almost sure convergence, the law of iterated logarithm and…
We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…
A random walk with echoed steps (RWES) is a process $\{\tilde{S}_n\}_{n\geq1}=\{\tilde{X}_1+\cdots+\tilde{X}_n\}_{n\geq1}$ that inserts memory and echo into an ordinary random walk (ORW) with i.i.d. steps, $X_1+\cdots+X_n$. The RWES is…
We consider a family of one-dimensional self interacting walks whose dynamics characterized by a monotone weight function $w$ on $\mathbb{N}\cup \{0\}$. The weight function takes the form $w(n) = (1 + 2^p Bn^{-p} + O(n^{-1-\kappa}))^{-1}$,…
We consider a random walk in random environment with random holding times, that is, the random walk jumping to one of its nearest neighbors with some transition probability after a random holding time. Both the transition probabilities and…
Let $L = (L(t))_{t\geq 0}$ be a multivariate L\'evy process with L\'evy measure $\nu(dy) = \exp(-f(|y|)) dy$ for a smoothly regularly varying function $f$ of index $\alpha>1$. The process $L$ is renormalized as $X^\varepsilon(t) =…
A random walk (or a Wiener process), possibly with drift, is observed in a noisy or delayed fashion. The problem considered in this paper is to estimate the first time \tau the random walk reaches a given level. Specifically, the p-moment…
We study the problem of searching for a fixed path $\epsilon_0\epsilon_1\cdots\epsilon_l$ on a network through random walks. We analyze the first hitting time of tracking the path, and obtain exact expression of mean first hitting time…
We consider a one-dimensional random walk (RW) with a continuous and symmetric jump distribution, $f(\eta)$, characterized by a L\'evy index $\mu \in (0,2]$, which includes standard random walks ($\mu=2$) and L\'evy flights ($0<\mu<2$). We…
The reflected process of a random walk or L\'evy process arises in many areas of applied probability, and a question of particular interest is how the tail of the distribution of the heights of the excursions away from zero behaves…