Pages that link to "Item:Q2038283"
From MaRDI portal
The following pages link to Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing (Q2038283):
Displaying 16 items.
- Statistical limits of sparse mixture detection (Q2084466) (← links)
- Global and individualized community detection in inhomogeneous multilayer networks (Q2105190) (← links)
- Motif estimation via subgraph sampling: the fourth-moment phenomenon (Q2131263) (← links)
- Iterative algorithm for discrete structure recovery (Q2131266) (← links)
- Community detection in feature-rich networks using data recovery approach (Q2680181) (← links)
- Estimation of extremal properties in non-negative networks (Q3151651) (← links)
- (Q3655163) (← links)
- Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising (Q6059433) (← links)
- Power enhancement and phase transitions for global testing of the mixed membership stochastic block model (Q6103213) (← links)
- Bayesian learning of graph substructures (Q6122075) (← links)
- Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing (Q6309739) (← links)
- Asymptotic analysis of statistical estimators related to multigraphex processes under misspecification (Q6589566) (← links)
- Tractably modelling dependence in networks beyond exchangeability (Q6632619) (← links)
- Robust recovery of Robinson property in \(L^p\)-graphons: a cut-norm approach (Q6635185) (← links)
- Uniform Inference for Kernel Density Estimators with Dyadic Data (Q6651373) (← links)
- Computational lower bounds for graphon estimation via low-degree polynomials (Q6656622) (← links)
