Learning Sparse Graphons and the Generalized Kesten-Stigum Threshold

Li Shuangping
Li Shuangping
Cited by: 0|Bibtex|Views16
Other Links: arxiv.org

Abstract:

The problem of learning graphons has attracted considerable attention across several scientific communities, with significant progress over the recent years in sparser regimes. Yet, the current techniques still require diverging degrees in order to succeed with efficient algorithms in the challenging cases where the local structure of t...More

Code:

Data:

Your rating :
0

 

Tags
Comments