Abstract: We study the extremes of branching random walks under the assumption that underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or have lighter tails.

Abstract: In 1971, Graham and Pollak showed that if $D_T$ is the distance matrix of a tree $T$ on $n$ nodes, then $\det(D_T)$ depends only on $n$, not $T$.

Abstract: We study the value of price discrimination in large random networks.

Abstract: Recently there has been a great interest in the analytic understanding of the behavior of large server systems with randomized routing.

Abstract: We consider the model-free reinforcement learning problem and study the popular Q-learning algorithm with linear function approximation for finding the optimal policy.