First Passage Percolation on Trees Let $T$ be a rooted Galton-Watson random tree generated accordingly to a probability distribution $\mu$. Now assign to each edge $e$ a random non-negative weight $w_e$ distributed a accordingly to a distribution $\nu$. We also assume that the weights are independent for different edges.
Let $T_{n}$ be the collection of nodes at (hop) distance $n$ from the root. For each $v\in T_{n}$, let $P_{v}$ denote the path from the root to $v$. Define
$$
Z_{v}=\sum_{e\\,\in P_{v}}{\\,w_e}.
$$
Now for each $n$ let $Y_{n}=\min_{v\in T_{n}}Z_{v}$. It was proved in Limit distributions for minimal displacement of branching random walks that the sequence of random variables
$$
\{Y_{n}-\mathbb{E}(Y_{n})\}_{n\geq 1}
$$
is tight.
My question are:

*

*Is it known what is the behavior of $\mathbb{E}(Y_{n})$ as $n$ increases in terms of $\mu$ and $\nu$?


*Is it known for the case $\mu=\delta_{k}$, i.e. when $T$ is a $k+1$ regular tree?
 A: This paper by Dekking and Host is quite old and much has been done in this area since. Today we know that under reasonable assumptions, there are constants $a\in\mathbb{R}$, $b\ge 0$, such that $E(Y_n) = an + b \log n + O(1)$. How to get the constant $a$ was known for quite a long time, see
Biggins, J. D. (1977). Chernoff’s Theorem in the Branching Random Walk. Journal of Applied Probability, 14(3), 630. doi:10.2307/3213469
For the second term and for almost sure behaviour of $Y_n$, see
Hu, Y., & Shi, Z. (2009). Minimal position and critical martingale convergence in branching random walks, and directed polymers on disordered trees. The Annals of Probability, 37(2), 742-789. doi:10.1214/08-AOP419
For the definite answer for the law of $Y_n$ in the non-lattice case, see
Aïdékon, E. (2011). Convergence in law of the minimum of a branching random walk. Retrieved from http://arxiv.org/abs/1101.1810
Note that all of this was already known long before for branching Brownian motion, see the references in the respective articles.
UPDATE: I forgot to add the important reference 
Addario-Berry, L., & Reed, B. (2009). Minima in branching random walks. The Annals of Probability, 37(3), 1044-1079. doi:10.1214/08-AOP428 
Here, the authors show the above-mentioned result for $E[Y_n]$ in almost complete generality, and exponential tails for $Y_n−E[Y_n]$ as well
