On a random walk that grows its own tree
From MaRDI portal
Publication:2042843
Recommendations
Cites work
- Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs
- Edge-attractor random walks on dynamic networks
- Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure
- Mixing times of random walks on dynamic configuration models
- Modelling development of epidemics with dynamic small-world networks
- On the speed of once-reinforced biased random walk on trees
- On the transience of processes defined on Galton-Watson trees
- Once edge-reinforced random walk on a tree
- Phase transition for the once-reinforced random walk on \(\mathbb{Z}^{d}\)-like trees
- Random walk attachment graphs
- Random walk in changing environment
- Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times
- The point of view of the particle on the law of large numbers for random walks in a mixing random environment
- Transience in growing subgraphs via evolving sets
- Transience of edge-reinforced random walk
- Transient and slim versus recurrent and fat: random walks and the trees they grow
Cited in
(8)- Out-of-equilibrium random walks
- On random walk on growing graphs
- A pseudo-random network mobile automaton with linear growth
- Erratum to: ``Tree builder random walk: recurrence, transience and ballisticity
- Transient and slim versus recurrent and fat: random walks and the trees they grow
- Compressibility of random walker trajectories on growing networks
- Tree builder random walk: recurrence, transience and ballisticity
- Growing random graphs with quantum rules
This page was built for publication: On a random walk that grows its own tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2042843)
