• Corpus ID: 207998302

# Random walk in a random environment and rst-passage percolation on trees

@inproceedings{Lyons1992RandomWI,
title={Random walk in a random environment and rst-passage percolation on trees},
author={Russell Lyons and Robin Pemantle},
year={1992}
}
• Published 2 April 2004
• Computer Science
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 circuit of the memory. Synchronization pulses which occur once each recirculation period are employed to determine which stage of the register to connect back to the memory, that is, to determine the amount of delay which must be inserted in the memory feedback loop to make the stored data synchronous…
85 Citations
Large deviations for transient random walks in random environment on a Galton–Watson tree
Consider a random walk in random environment on a supercritical Galton--Watson tree, and let $\tau_n$ be the hitting time of generation $n$. The paper presents a large deviation principle for
Bindweeds or random walks in random environments on multiplexed trees and their asympotics
• Mathematics
DRW
• 2003
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.
Submitted to the Annals of Probability PHASE TRANSITION FOR THE ONCE-REINFORCED RANDOM WALK ON Z D-LIKE TREES
• Mathematics
• 2017
In this short paper, we consider the Once-reinforced random walk with reinforcement parameter a on trees with bounded degree which are transient for the simple random walk. On each of these trees, we
General random walk in a random environment defined on Galton-Watson trees
• Mathematics
• 2014
We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive
Range and critical generations of a random walk on Galton-Watson trees
• Mathematics
• 2015
In this paper we consider a random walk in random environment on a tree and focus on the boundary case for the underlying branching potential. We study the range $R\_n$ of this walk up to time $n$
Slow movement of random walk in random environment on a regular tree
• Mathematics
• 2006
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
Maximal local time of randomly biased random walks on a Galton-Watson tree
• Mathematics
• 2020
We consider a recurrent random walk on a rooted tree in random environment given by a branching random walk. Up to the first return to the root, its edge local times form a Multi-type Galton-Watson
Randomly biased walks on subcritical trees
• Mathematics
• 2011
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton‐Watson tree. We do so for trees in which
Phase transition for the Once-reinforced random walk on $\mathbb{Z}^{d}$-like trees
• Mathematics
The Annals of Probability
• 2018
In this short paper, we consider the Once-reinforced random walk with reinforcement parameter $a$ on trees with bounded degree which are transient for the simple random walk. On each of these trees,
Random walks in random environment on trees and multiplicative chaos 1
• Mathematics
• 2001
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

## References

SHOWING 1-3 OF 3 REFERENCES
The Ising model and percolation on trees and tree-like graphs
We calculate the exact temperature of phase transition for the Ising model on an arbitrary infinite tree with arbitrary interaction strengths and no external field. In the same setting, we calculate
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
Phase transition in reinforced random walk and RWRE on trees
On donne a une marche aleatoire sur un arbre infini une sorte particuliere de retroaction positive de telle sorte que les aretes deja traversees aient plus de chances d'etre traversees dans le futur.