18 citations · 28 across the 4 of their papers we have counts for
4 papers
First-passage percolation on ladder-like graphs with heterogeneous exponential times
Henrik Renlund
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are inde…
Limit theorems for stochastic approximation algorithms
Henrik Renlund
We prove a central limit theorem applicable to one dimensional stochastic approximation algorithms that converge to a point where the error terms of the algorithm do not vanish. We…
Generalized Polya urns via stochastic approximation
Henrik Renlund
We collect, survey and develop methods of (one-dimensional) stochastic approximation in a framework that seems suitable to handle fairly broad generalizations of Polya urns. To sho…
First-passage percolation with exponential times on a ladder
Henrik Renlund
We consider first-passage percolation on a ladder, i.e. the graph {0,1,...}*{0,1} where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean…