Related papers: Large excursions and conditioned laws for recursiv…

Random walks with memory typically involve rules where a preference for either revisiting or avoiding those sites visited in the past are introduced somehow. Such effects have a direct consequence on the statistics of first-passage and…

We study exit times from a set for a family of multivariate autoregressive processes with normally distributed noise. By using the large deviation principle, and other methods, we show that the asymptotic behavior of the exit time depends…

Many scientific questions can be framed as asking for a first passage time (FPT), which generically describes the time it takes a random "searcher" to find a "target." The important timescale in a variety of biophysical systems is the time…

Let $\omega=(\omega_i)_{i\in\mathbb Z}=(\mu^{L}_i,...,\mu^{1}_i,\lambda_i)_{i\in \mathbb Z}$, which serves as the environment, be a sequence of i.i.d. random nonnegative vectors, with $L\ge1$ a positive integer. We study birth and death…

The L\'evy walk process for the lower interval of the time of flight distribution ($\alpha<1$) and with finite resting time between consecutive flights is discussed. The motion is restricted to a region bounded by two absorbing barriers and…

The Large Deviation Principle is established for stochastic models defined by past-dependent non linear recursions with small noise. In the Markov case we use the result to obtain an explicit expression for the asymptotics of exit time.

In this paper, we provide a methodology for computing the probability distribution of sojourn times for a wide class of Markov chains. Our methodology consists in writing out linear systems and matrix equations for generating functions…

The deterministic random walk is a deterministic process analogous to a random walk. While there are some results on the cover time of the rotor-router model, which is a deterministic random walk corresponding to a simple random walk,…

We consider simple exclusion processes on Z for which the underlying random walk has a finite first moment and a non-zero mean and whose initial distributions are product measures with different densities to the left and to the right of the…

In this paper we consider the one-dimensional quantum random walk X^{varphi} _n at time n starting from initial qubit state varphi determined by 2 times 2 unitary matrix U. We give a combinatorial expression for the characteristic function…

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

A branching process in random environment $(Z_n, n \in \N)$ is a generalization of Galton Watson processes where at each generation the reproduction law is picked randomly. In this paper we give several results which belong to the class of…

We study the convergence of the $M/G/1$ processor-sharing, queue length process in the heavy traffic regime, in the finite variance case. To do so, we combine results pertaining to L\'{e}vy processes, branching processes and queuing theory.…

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…

We study the generalization of the G/G/1 queue obtained by relaxing the assumption of independence between inter-arrival times and service requirements. The analysis is carried out for the class of multivariate matrix exponential…

We consider the passage time problem for L\'evy processes, emphasising heavy tailed cases. Results are obtained under quite mild assumptions, namely, drift to $-\infty$ a.s. of the process, possibly at a linear rate (the finite mean case),…

In this article we study a problem related to the first passage and inverse first passage time problems for Brownian motions originally formulated by Jackson, Kreinin and Zhang (2009). Specifically, define $\tau_X = \inf\{t>0:W_t + X \le…

We study $I(T)$, the number of inversions in a tree $T$ with its vertices labeled uniformly at random, which is a generalization of inversions in permutations. We first show that the cumulants of $I(T)$ have explicit formulas involving the…

Let $(Y_n)$ be a sequence of i.i.d. $\mathbb Z$-valued random variables with law $\mu$. The reflected random walk $(X_n)$ is defined recursively by $X_0=x \in \mathbb N_0, X_{n+1}=|X_n+Y_{n+1}|$. Under mild hypotheses on the law $\mu$, it…