Related papers: Independence times for iid sequences, random walks…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
We prove strong theorems for the local time at infinity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over…
We consider the moving particle process in Rd which is defined in the following way. There are two independent sequences (Tk) and (dk) of random variables. The variables Tk are non negative and form an increasing sequence, while variables…
We derive confidence intervals and confidence sequences for causal effects in situations where the back-door or front-door criteria are applicable. Our tightest confidence intervals hold in the standard setting where the training data…
We consider a population of $N$ labeled random walkers moving on a substrate, and an excitation jumping among the walkers upon contact. The label $\mathcal{X}(t)$ of the walker carrying the excitation at time $t$ can be viewed as a…
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.…
We establish limit theorems for U-statistics indexed by a random walk on Z^d and we express the limit in terms of some Levy sheet Z(s,t). Under some hypotheses, we prove that the limit process is Z(t,t) if the random walk is transient or…
While records and order statistics of independent and identically distributed (i.i.d.) random variables X_1, ..., X_N are fully understood, much less is known for strongly correlated random variables, which is often the situation…
Continuous time random walks have random waiting times between particle jumps. We define the correlated continuous time random walks (CTRWs) that converge to fractional Pearson diffusions (fPDs). The jumps in these CTRWs are obtained from…
We propose a variety of models of random walk, discrete in space and time, suitable for simulating stable random variables of arbitrary index $\alpha$ ($0< \alpha \le 2$), in the symmetric case. We show that by properly scaled transition to…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…
Levy walk (LW) process has been used as a simple model for describing anomalous diffusion in which the mean squared displacement of the walker grows non-linearly with time in contrast to the diffusive motion described by simple random walks…
Let $G$ be an infinite connected graph with vertex set $V$. Let $\{S_n: n \in \mathbb N_0 \}$ be the simple random walk on $G$ and let $\{ \xi(v) : v \in V \}$ be a collection of i.i.d. random variables which are independent of the random…
We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…
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$,…
In this paper, we study the law of the local time processes $(L_T^x(X),x\in \mathbb{R})$ associated to a spectrally negative L\'evy process $X$, in the cases $T=\tau_a^+$, the first passage time of $X$ above $a>0$ and $T=\tau(c)$, the first…
We compute exactly the mean number of records $\langle R_N \rangle$ for a time-series of size $N$ whose entries represent the positions of a discrete time random walker on the line. At each time step, the walker jumps by a length $\eta$…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
Continuous time random walks impose a random waiting time before each particle jump. Scaling limits of heavy tailed continuous time random walks are governed by fractional evolution equations. Space-fractional derivatives describe heavy…
A deterministic walk in a random environment can be understood as a general random process with finite-range dependence that starts repeating a loop once it reaches a site it has visited before. Such process lacks the Markov property. We…