相关论文: On Number of Turns in Reduced Random Lattice Paths

Associated to a random walk on $\mathbb{Z}$ and a positive integer $n$, there is a return probability of the random walk returning to the origin after $n$ steps. An interesting question is when the set of return probabilities uniquely…

We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…

The aim of this article is to provide a simple sampling procedure to reconstruct any monotone path from its signature. For every N, we sample a lattice path of N steps with weights given by the coefficient of the corresponding word in the…

To what extent is the underlying distribution of a finitely supported unbiased random walk on $\mathbb{Z}$ determined by the sequence of times at which the walk returns to the origin? The main result of this paper is that, in various…

We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…

Rotor walk is a deterministic analogue of random walk. We study its recurrence and transience properties on Z^d for the initial configuration of all rotors aligned. If n particles in turn perform rotor walks starting from the origin, we…

We consider a recurrent random walk in random environment on a regular tree. Under suitable general assumptions upon the distribution of the environment, we show that the walk exhibits an unusual slow movement: the order of magnitude of the…

We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…

We study recurrence properties and the validity of the (weak) law of large numbers for (discrete time) processes which, in the simplest case, are obtained from simple symmetric random walk on $\Z$ by modifying the distribution of a step…

The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…

We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…

Consider a branching random walk, where the branching mechanism is governed by a Galton-Watson process, and the migration by a finite range symmetric irreducible random walk on the integer lattice $\mathbb{Z}^d$. Let $Z_n(z)$ be the number…

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

For a symmetric, homogeneous and irreducible random walk on d-dimensional integer lattice Z^d, having zero mean and a finite variance of jumps, we study the passage times (with possible infinite values) determined by the starting point x,…

For a random walk $S_n$ on $\mathbb{R}^d$ we study the asymptotic behaviour of the associated centre of mass process $G_n = n^{-1} \sum_{i=1}^n S_i$. For lattice distributions we give conditions for a local limit theorem to hold. We prove…

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…

We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

In this work, we are interested in the set of visited vertices of a tree $\mathbb{T}$ by a randomly biased random walk $\mathbb{X}:=(X_n,n \in \mathbb{N})$. The aim is to study a generalized range, that is to say the volume of the trace of…