Add to ORKGAbstract. Let; act on a countable set V with only nitely many orbits. Given a;-invariant random environment for a Markov chain on V and a random scenery, we exhibit, under certain conditions, an equivalent stationary measure for the environment and scenery from the viewpoint of the random walker. Such theorems have been very useful in investigations of percolation on quasi-transitive graphs
International audienceWe consider random walks in dynamic random environments given by Markovian dyn...
A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting ...
We study the random walk in a random environment on , where the environment is subject to a vanishin...
. Let \Gamma act on a countable set V with only finitely many orbits. Given a \Gamma-invariant rando...
We consider finite-state Markov chains driven by stationary ergodic invertible processes representin...
In this paper we give a survey of some recent results for random walk in random scenery (RWRS). On $...
none1noWe consider random walks in random environments on Z^d. Under a transitivity hypothesis that ...
An infinite graph G has the property that a random walk in random environment on G defined by i.i.d....
Abstract. In the present paper we consider a continuous time random walk on an anisotropic random la...
Abstract. We consider random iterated function systems giving rise to Markov chains in random (stati...
We study Markov chains on a lattice in a codimension-one stratified independent random environment, ...
In this paper we consider an arbitrary irreducible random walk on , d1, with i.i.d. increments, toge...
We prove a fixed versus random scenery distinguishability result (along the lines of Benjamini and K...
Abstract. We consider a random walk on a random graph (V;E), where V is the set of open sites under ...
We consider a discrete time random walk in a space-time i.i.d. random environment. We use a martinga...
International audienceWe consider random walks in dynamic random environments given by Markovian dyn...
A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting ...
We study the random walk in a random environment on , where the environment is subject to a vanishin...
. Let \Gamma act on a countable set V with only finitely many orbits. Given a \Gamma-invariant rando...
We consider finite-state Markov chains driven by stationary ergodic invertible processes representin...
In this paper we give a survey of some recent results for random walk in random scenery (RWRS). On $...
none1noWe consider random walks in random environments on Z^d. Under a transitivity hypothesis that ...
An infinite graph G has the property that a random walk in random environment on G defined by i.i.d....
Abstract. In the present paper we consider a continuous time random walk on an anisotropic random la...
Abstract. We consider random iterated function systems giving rise to Markov chains in random (stati...
We study Markov chains on a lattice in a codimension-one stratified independent random environment, ...
In this paper we consider an arbitrary irreducible random walk on , d1, with i.i.d. increments, toge...
We prove a fixed versus random scenery distinguishability result (along the lines of Benjamini and K...
Abstract. We consider a random walk on a random graph (V;E), where V is the set of open sites under ...
We consider a discrete time random walk in a space-time i.i.d. random environment. We use a martinga...
International audienceWe consider random walks in dynamic random environments given by Markovian dyn...
A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting ...
We study the random walk in a random environment on , where the environment is subject to a vanishin...