Related papers: Invariance principle for biased Boostrap Random Wa…

We develop importance sampling based efficient simulation techniques for three commonly encountered rare event probabilities associated with random walks having i.i.d. regularly varying increments; namely, 1) the large deviation…

We study the $\beta$ analogue of the nonintersecting Poisson random walks. We derive a stochastic differential equation of the Stieltjes transform of the empirical measure process, which can be viewed as a dynamical version of the…

Multivariate Bernoulli autoregressive (BAR) processes model time series of events in which the likelihood of current events is determined by the times and locations of past events. These processes can be used to model nonlinear dynamical…

This article studies vertex reinforced random walks that are non-backtracking (denoted VRNBW), i.e. U-turns forbidden. With this last property and for a strong reinforcement, the emergence of a path may occur with positive probability.…

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

Starting from a sequence regarded as a walk through some set of values, we consider the associated loop-erased walk as a sequence of directed edges, with an edge from $i$ to $j$ if the loop erased walk makes a step from $i$ to $j$. We…

We study a large class of long-range random walks which take values on the vertices of an N dimensional hypercube. These processes are connected with multivariate Bernoulli autoregression.

Invariants are a set of properties over program attributes that are expected to be true during the execution of a program. Since developing those invariants manually can be costly and challenging, there are a myriad of approaches that…

We suggest to construct infinite stochastic binary sequences by associating one of the two symbols of the sequence with the renewal times of an underlying renewal process. Focusing on stationary binary sequences corresponding to delayed…

We introduce a simulation-based, amortised Bayesian inference scheme to infer the parameters of random walks. Our approach learns the posterior distribution of the walks' parameters with a likelihood-free method. In the first step a graph…

We investigate a population of binary mistake sequences that result from learning with parametric models of different order. We obtain estimates of their error, algorithmic complexity and divergence from a purely random Bernoulli sequence.…

Scale invariance is a central organizing principle in physics, underlying phenomena that range from critical behaviour in statistical mechanics to transport and chaos in nonlinear dynamical systems. Here we present a unified and physically…

We study the second order of the number of excursions of a simple random walk with a bias that drives a return toward the origin along the axes introduced by P. Andreoletti and P. Debs \cite{AndDeb3}. This is a crucial step toward deriving…

We study the persistence exponent for the first passage time of a random walk below the trajectory of another random walk. More precisely, let $\{B_n\}$ and $\{W_n\}$ be two centered, weakly dependent random walks. We establish that…

We prove an invariance principle for non-stationary random processes and establish a rate of convergence under a new type of mixing condition. The dependence is exponentially decaying in the gap between the past and the future and is…

The paper studies the counting process arising as a subset of births and deaths in a birth--death process on a finite state space. Whenever a birth or death occurs, the process is incremented or not depending on the outcome of an…

In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…

Let $r: S\times S\to \bb R_+$ be the jump rates of an irreducible random walk on a finite set $S$, reversible with respect to some probability measure $m$. For $\alpha >1$, let $g: \bb N\to \bb R_+$ be given by $g(0)=0$, $g(1)=1$, $g(k) =…

We analyze the Brownian Motion limit of a prototypical unit step reinforced random-walk on the half line. A reinforced random walk is one which changes the weight of any edge (or vertex) visited to increase the frequency of return visits.…

We prove quenched invariance principle for simple random walk on the unique infinite percolation cluster for a general class of percolation models on Z^d, d>=2, with long-range correlations introduced in arXiv:1212.2885, solving one of the…