Preferential attachment random graphs evolve in time by sequentially adding vertices and edges in a random way so that connections to vertices having high degree are favored. In this talk we will use an interesting coupling of random variables to derive a distributional transformation that can be used to obtain rates of convergence for degree distributions in these graphs. Joint work with Erol...