Optimal graphon estimation in cut distance

16 Oct 2018 Klopp Olga CREST Verzelen Nicolas MISTEA

Consider the twin problems of estimating the connection probability matrix of an inhomogeneous random graph and the graphon of a W-random graph. We establish the minimax estimation rates with respect to the cut metric for classes of block constant matrices and step function graphons... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • STATISTICS THEORY
  • STATISTICS THEORY