相关论文: Drift and entropy growth for random walks on group…

We derive the asymptotic distribution of ordinal-pattern frequencies under weak dependence conditions and investigate the long-run covariance matrix not only analytically for moving-average, Gaussian, and the novel generalized coin-tossing…

We introduce a generalisation of Sch\"{u}tz and Trimper's elephant random walk to finitely generated groups. We focus on the simplest non-abelian setting, i.e. groups whose Cayley graphs are homogeneous trees of degree $d \ge 3$. We show…

In this article, we study the maximal displacement in a branching random walk. We prove that its asymptotic behaviour consists in a first almost sure ballistic term, a negative logarithmic correction in probability and stochastically…

We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…

We discuss the qualitatively new properties of random walks on groups that arise in the situation when the entropy of the step distribution is infinite.

We consider point process convergence for sequences of iid random walks. The objective is to derive asymptotic theory for the largest extremes of these random walks. We show convergence of the maximum random walk to the Gumbel or the…

We study certain self-interacting walks on the set of integers, that choose to jump to the right or to the left randomly but influenced by the number of times they have previously jumped along the edges in the finite neighbourhood of their…

In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…

We study symmetric random walks on finitely generated groups of orientation-preserving homeomorphisms of the real line. We establish an oscillation property for the induced Markov chain on the line that implies a weak form of recurrence.…

A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.

We study tail behaviour of the distribution of the area under the positive excursion of a random walk which has negative drift and light-tailed increments. We determine the asymptotics for local probabilities for the area and prove a local…

This paper states a law of large numbers for a random walk in a random iid environment on ${\mathbb Z}^d$, where the environment follows some Dirichlet distribution. Moreover, we give explicit bounds for the asymptotic velocity of the…

We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…

By developing the entropy theory of random walks on equivalence relations and analyzing the asymptotic geometry of horospheric products we describe the Poisson boundary for random walks on random horospheric products of trees.

The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…

Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…

We introduce a multidimensional walk with memory and random tendency. The asymptotic behaviour is characterized, proving a law of large numbers and showing a phase transition from diffusive to superdiffusive regimes. In first case, we…

A simple symmetric random walk is considered on a spider that is a collection of half lines (we call them legs) joined at the origin. We establish a strong approximation of this random walk by the so-called Brownian spider. Transition…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…