Dynamics of stochastic approximation algorithms
We provide a new exponential concentration inequality for first passage percolation valid for a wide class of edge times distributions. This improves and extends a result by Benjamini, Kalai and Schramm ( (2003)) which gave a variance bound for Bernoulli edge times. Our approach is based on some functional inequalities extending the work of Rossignol ( (2006)), Falik and Samorodnitsky ( (2007)).
Page 1