In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Advances in Applied Probability, Vol. 45, No. 3 (SEPTEMBER 2013), pp. 876-893 (18 pages) For a family of linear preferential attachment graphs, we provide rates of convergence for the total variation ...