On the estimation of network complexity: Dimension of graphons