Probability on trees: An introductory climb
Trees (05C05) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Applications of branching processes (60J85) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Probability on trees is a fascinating subject, intensively studied by many authors in the last decade. The structure of the present paper is similar to that of a short monograph. As a matter of fact, the author, one of the leading specialists in this area, claims that ``a more complete account is in the forthcoming book co-authored with Russel Lyons. The paper contains 21 chapters. The first 10 are devoted to basic facts about percolation on trees, branching processes and electrical networks, with an emphasis on several key techniques: moment estimates, the use of percolation to determine dimension, and the ``method of random paths to construct flows of finite energy. More advanced topics start from Chapter 11. A brief description of the content of these chapters follows. In Chapter 11 the method of random paths is refined. Chapters 12 and 13 contain a regularity property of subperiodic trees, and its application to random walks on groups. In Chapter 14 the author discusses capacity estimates for hitting probabilities; these are used in Chapter 15 to derive intersection-equivalence of fractal percolation and Brownian paths. The phase transition in a broadcasting model considered by computer scientists is analyzed in Chapter 16. In Chapter 17, the Ising model on a tree is used to construct a nearest-neighbor process on \(Z\) that is ``less predictable than simple random walk. The speed and recurrence properties of tree-indexed processes are studied in Chapters 18 and 19. In Chapter 20, a dynamical variant of percolation, where edges open and close according to independent Poisson processes, is considered. Finally, the author concludes in Chapter 21 by describing some results on stochastic domination between randomly labeled trees, and stating some open problems for other types of graphs. The material of this paper is presented in a fine instructive way. It might be useful to graduate students and probabilists as an introduction to the subject. For the entire collection see [Zbl 0930.00052].
- Intersections of Brownian motions
- A phase transition for a random cluster model on phylogenetic trees.
- Tree-indexed processes
- Thin and thick points for branching measure on a Galton-Watson tree
- Fractal percolation, porosity, and dimension
- Interlacements and the wired uniform spanning forest
- Conditions for recurrence and transience of a Markov chain on \(\mathbb Z^ +\) and estimation of a geometric success probability.
- The maximum of a branching random walk with semiexponential increments
- Level sets of additive Lévy processes
- On the speed of random walks on graphs.
- Enlargement of subgraphs of infinite graphs by Bernoulli percolation
- Sufficient condition for root reconstruction by parsimony on binary trees with general weights
- Recurrence versus transience for weight-dependent random connection models
- Hitting probabilities and intersections of time-space anisotropic random fields
- Multiple points of the Brownian sheet in critical dimensions
- Effective resistance of random trees
- Rumor processes in random environment on N and on Galton-Watson trees
- The speed of a branching system of random walks in random environment
- Phase ordering after a deep quench: the stochastic Ising and hard core gas models on a tree
- A tree approach to \(p\)-variation and to integration
- Probability on trees and networks
- The speed of random walks on trees and electric networks
- Cutoff for the noisy voter model
- Routeing on trees
- Images of the Brownian sheet
- Simultaneous multifractal analysis of the branching and visibility measure on a Galton-Watson tree
- Critical Brownian sheet does not have double points
- Phase transitions in phylogeny
- Speed of random walk and resistance
- On the multifractal spectrum of the branching measure on a Galton–Watson tree
- Optimal reward on a sparse tree with random edge weights
- Brownian motion and thermal capacity
- Phase transition on the convergence rate of parameter estimation under an Ornstein-Uhlenbeck diffusion on a tree
- Transience versus recurrence for scale-free spatial networks
- Uniform spanning forests of planar graphs
- Percolation Hamiltonians
- Hypercube percolation
- Tail estimates for homogenization theorems in random media
- On the hitting probabilities of limsup random fractals
- Transience of the vacant set for near-critical random interlacements in high dimensions
- Branching random walk with infinite progeny mean: a tale of two tails
- A Hilbert space approach to effective resistance metric
- Multiple intersections of space-time anisotropic Gaussian fields
- Branching number of a pseudogroup
- Sparse reconstruction in spin systems. I: iid spins
- Recurrence and transience of a Markov chain on \(\mathbb{Z}^+\) and evaluation of prior distributions for a Poisson mean
- Phase transition in the sample complexity of likelihood-based phylogeny inference
- Asymptotics of the p-capacity in the critical regime
- The maximal potential energy of biased random walks on trees
- Uniqueness, recurrence and integral-type functionals for birth-death processes on trees
- On the speed of random walks on random trees
- Random walks and percolation on trees
- Harmonic analysis of additive Lévy processes
- A law of large numbers for weighted majority
- A subdiffusive behaviour of recurrent random walk in random environment on a regular tree
- Critical random graphs: Diameter and mixing time
This page was built for publication: Probability on trees: An introductory climb
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941949)
