A graphon that is defined on and is H\"older continuous for some and can be represented by a graphon on that is H\"older continuous. We give examples that show that this reduction in smoothness to is the best possible, for any and ; for , the example is a dot product graphon and shows that the reduction is the best possible even for graphons that are polynomials. A motivation for studying the smoothness of graphon functions is that this represents a key assumption in non-parametric statistical network analysis. Our examples show that making a smoothness assumption in a particular dimension is not equivalent to making it in any other latent dimension.
View on arXiv