 The first is a sampling metric, which says two graphs are close if their distributions of subgraphs are close.The second is an edge discrepancy metric, which says two graphs are close when their edge densities are close on all their corresponding subsets of vertices.Miraculously, a sequence of graphs converges when with respect to one distance precisely when it converges with respect to the other.