• Corpus ID: 14142199

Random walks in random environment on trees and multiplicative chaos 1

  title={Random walks in random environment on trees and multiplicative chaos 1},
  author={Mikhail Menshikov and Dimitri Petritis},
  journal={arXiv: Probability},
We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random environment. A related problem, with only one type of vertices and quite stringent conditions on the transition probabilities but on general trees has been considered previously in the literature (15). In the presentation we give here, we restrict the study of the… 
On Random Walks in Random Environment on Trees and Their Relationship with Multiplicative Chaos
The purpose of this paper is to report on recent results concerning random walks in a random environment on monochromatic and coloured trees and their relationship with multiplicative chaos. The
Bindweeds or random walks in random environments on multiplexed trees and their asympotics
The large time asymptotic behaviour of a new model of random walk, term the bindweed model, evolving in a random environment on an infinite multiplexed tree is studied and it is shown to coincide with the critical value of a matrix-valued multiplicative cascade on the ordinary tree.
On pricing futures options on random binomial tree
A new model is developed by randomizing the environment and call such model a random binomial tree that enables calculations reflecting the real market since it consider the two states of market normal and extra ordinal.


Critical Random Walk in Random Environment on Trees
We study the behavior of random walk in random environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the
Lyapunov functions for random walks and strings in random environment
We study two typical examples of countable Markov chains in random environment using the Lyapunov functions method: random walk and random string in random environment. In each case we construct an
A multiplicative random cascade refers to a positive T -martingale in the sense of Kahane on the ultrametric space T = {0, 1, . . . , b− 1}. A new approach to the study of multiplicative cascades is
Reversibility and Stochastic Networks
This classic in stochastic network modelling broke new ground when it was published in 1979, and it remains a superb introduction to reversibility and its applications. The book concerns behaviour in
Fixed points of the smoothing transformation
SummaryLet W1,..., WN be N nonnegative random variables and let $$\mathfrak{M}$$ be the class of all probability measures on [0, ∞). Define a transformation T on $$\mathfrak{M}$$ by letting Tμ be
Random walk in a random environment and rst-passage percolation on trees
A delay line refresh memory stores the bits to be displayed on a visual display means such as a television receiver. A shift register in the feedback loop applies the stored bits back to the input
Large deviations for multiplicative chaos
The local singularities for a class of random measures, obtained by random iterated multiplications, are investigated using the thermodynamic formalism. This analysis can be interpreted as a rigorous
Topics in the Constructive Theory of Countable Markov Chains
Introduction and history 1. Preliminaries 2. General criteria 3. Explicit construction of Lyapunov functions 4. Ideology of induced chains 5. Random walks in two dimensional complexes 6. Stability 7.
Sur une extension de la notion de loi semi-stable
© Gauthier-Villars, 1990, tous droits réservés. L’accès aux archives de la revue « Annales de l’I. H. P., section B » (http://www.elsevier.com/locate/anihpb) implique l’accord avec les conditions