Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure

@article{Lyons1995ErgodicTO,
  title={Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure},
  author={Russell Lyons and Robin Pemantle and Yuval Peres},
  journal={Ergodic Theory and Dynamical Systems},
  year={1995},
  volume={15},
  pages={593 - 619}
}
Abstract We consider simple random walk on the family tree T of a nondegenerate supercritical Galton—Watson branching process and show that the resulting harmonic measure has a.s. strictly smaller Hausdorff dimension than that of the whole boundary of T. Concretely, this implies that an exponentially small fraction of the nth level of T carries most of the harmonic measure. First-order asymptotics for the rate of escape, Green function and the Avez entropy of the random walk are also determined… 
The harmonic measure of critical Galton-Watson trees
We consider simple random walk on a critical Galton–Watson tree conditioned to have height greater than n. It is well known that the cardinality of the set of vertices of the tree at generation n is
Dimension Drop for Transient Random Walks on Galton-Watson Trees in Random Environments
We prove that the dimension drop phenomenon holds for the harmonic measure associated to a transient random walk in a random environment (as defined by R. Lyons and R. Pemantle in 1992 and
Typical behavior of the harmonic measure in critical Galton-Watson trees
We study the typical behavior of the harmonic measure of balls in large critical Galton-Watson trees whose offspring distribution has finite variance. The harmonic measure considered here refers to
Invariant Measures, Hausdorff Dimension and Dimension Drop of some Harmonic Measures on Galton-Watson Trees
We consider infinite Galton-Watson trees without leaves together with i.i.d. random variables called marks on each of their vertices. We define a class of flow rules on marked Galton-Watson trees for
How Fast and where does a Random Walker Move on a Random Tree
The oldest model of random trees is that of Galton and Watson. In joint work with Robin Pemantle and Yuval Peres, described informally here, we consider simple random walk on the family tree T of a
Average properties of random walks on Galton-Watson trees
Large deviations for random walks on Galton–Watson trees: averaging and uncertainty
Abstract. In the study of large deviations for random walks in random environment, a key distinction has emerged between quenched asymptotics, conditional on the environment, and annealed
Biased random walks on Galton–Watson trees
Summary. We consider random walks with a bias toward the root on the family tree T of a supercritical Galton–Watson branching process and show that the speed is positive whenever the walk is
Harmonic measure for biased random walk in a supercritical Galton–Watson tree
We consider random walks $\lambda$-biased towards the root on a Galton-Watson tree, whose offspring distribution $(p_k)_{k\geq 1}$ is non-degenerate and has finite mean $m>1$. In the transient regime
...
...

References

SHOWING 1-10 OF 19 REFERENCES
What is ergodic theory
Ergodic theory involves the study of transformations on measure spaces. Interchanging the words “measurable function” and “probability density function” translates many results from real analysis to
Random Walks and Percolation on Trees
There is a way to define an average number of branches per vertex for an arbitrary infinite locally finite tree. It equals the exponential of the Hausdorff dimension of the boundary in an appropriate
Random walks and electric networks
TLDR
The goal will be to interpret Polya’s beautiful theorem that a random walker on an infinite street network in d-dimensional space is bound to return to the starting point when d = 2, but has a positive probability of escaping to infinity without returning to the Starting Point when d ≥ 3, and to prove the theorem using techniques from classical electrical theory.
Dimension, entropy and Lyapunov exponents
  • L. Young
  • Mathematics
    Ergodic Theory and Dynamical Systems
  • 1982
Abstract We consider diffeomorphisms of surfaces leaving invariant an ergodic Borel probability measure μ. Define HD (μ) to be the infimum of Hausdorff dimension of sets having full μ-measure. We
Markov Processes, Structure and Asymptotic Behavior
I Basic Notions and Illustrations.- 0. Summary.- 1. Markov Processes and Transition Probability Functions.- 2. Markov Chains.- 3. Independent Random Variables.- 4. Some Continuous Parameter Markov
Subdiffusive behavior of random walk on a random cluster
On considere deux cas de marche aleatoire {X n } n≥0 sur un graphe aleatoire #7B-G. Dans le cas ou #7B-G est l'arbre d'un processus de branchement critique, conditionne par la non-extinction, si h(x)
Hausdorff dimension of harmonic measures on negatively curved manifolds
We show by probabilistic means that harmonic measures on manifolds, whose curvature is sandwiched between two negative constants have positive Hausdorff dimensions. A lower bound for harmonic
RANDOM ELECTRICAL NETWORKS ON COMPLETE GRAPHS
This paper contains the proofs of Theorems 2 and 3 of the article entitled Random electrical networks on complete graphs, written by the same authors and published in the Journal of the London
Trees Generated by a Simple Branching Process
Random walks and percolation on trees, Ann
  • 1990
...
...