Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Computational lower bounds for graphon estimation via low-degree polynomials

From MaRDI portal
Publication:6656622
Jump to:navigation, search

DOI10.1214/24-aos2437MaRDI QIDQ6656622

Chao Gao, Yuetian Luo

Publication date: 3 January 2025

Published in: The Annals of Statistics (Search for Journal in Brave)



zbMATH Keywords

community detectionlow-degree polynomialsgraphon estimationcomputational lower boundKesten-Stigum thresholdstatistical-computational tradeoffs


Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric estimation (62G05) Random graphs (graph-theoretic aspects) (05C80) Minimax procedures in statistical decision theory (62C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)








This page was built for publication: Computational lower bounds for graphon estimation via low-degree polynomials

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6656622&oldid=40233204"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 20:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki