Minima in branching random walks (Q2270609)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minima in branching random walks |
scientific article |
Statements
Minima in branching random walks (English)
0 references
28 July 2009
0 references
The authors investigate a supercritical branching random walk: A Galton-Watson tree where each edge is supplemented with a (iid) weight and where each node is labeled by the sum of weights on the edges from the node to the root. Let \(M(n)\) be the minimum over the labels of all nodes in counting distance \(n\) from the root. The main result of the paper is a characterization of the asymptotic behaviour of the mean \(E(M(n))\) conditioned on that the branching random walk survives. For the case of bounded branching and weight size the results complement results from the literature such that the behaviour of the mean \(E(M(n))\) is completely characterized.
0 references
branching random walks
0 references
branching processes
0 references
random trees
0 references
Biggins-Hammersley-Kingman theorem
0 references
0 references
0 references
0 references