The following pages link to Rate-optimal graphon estimation (Q159635):
Displaying 42 items.
- Optimal change point detection and localization in sparse dynamic networks (Q97726) (← links)
- Network Cross-Validation for Determining the Number of Communities in Network Data (Q159626) (← links)
- Rate-optimal graphon estimation (Q159635) (← links)
- randnet (Q159656) (← links)
- Spectral clustering in the dynamic stochastic block model (Q668613) (← links)
- Local inference by penalization method for biclustering model (Q1631204) (← links)
- Optimal rates of statistical seriation (Q1715546) (← links)
- On semidefinite relaxations for the block model (Q1747735) (← links)
- Towards optimal estimation of bivariate isotonic matrices with unknown permutations (Q1996765) (← links)
- Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model (Q2008607) (← links)
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing (Q2038283) (← links)
- Network representation using graph root distributions (Q2039784) (← links)
- Consistent nonparametric estimation for heavy-tailed sparse graphs (Q2054468) (← links)
- A generalization of hierarchical exchangeability on trees to directed acyclic graphs (Q2077158) (← links)
- Random graph asymptotics for treatment effect estimation under network interference (Q2091844) (← links)
- Isotonic regression with unknown permutations: statistics, computation and adaptation (Q2119231) (← links)
- Edgeworth expansions for network moments (Q2131253) (← links)
- Reconstruction of line-embeddings of graphons (Q2136610) (← links)
- Bootstrapping exchangeable random graphs (Q2136635) (← links)
- Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator (Q2137006) (← links)
- Uniform estimation in stochastic block models is slow (Q2137819) (← links)
- Estimating the number of connected components in a graph via subgraph sampling (Q2174974) (← links)
- Estimation of Monge matrices (Q2203631) (← links)
- Posterior contraction rates for stochastic block models (Q2206755) (← links)
- A general framework for Bayes structured linear models (Q2215762) (← links)
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios (Q2225321) (← links)
- Maximum likelihood estimation of sparse networks with missing observations (Q2242863) (← links)
- Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces (Q2278679) (← links)
- Sampling and estimation for (sparse) exchangeable graphs (Q2284374) (← links)
- The geometry of continuous latent space models for network data (Q2292395) (← links)
- Consistent structure estimation of exponential-family random graph models with block structure (Q2295031) (← links)
- Optimal graphon estimation in cut distance (Q2312687) (← links)
- Dynamic network models and graphon estimation (Q2313290) (← links)
- Structured matrix estimation and completion (Q2325396) (← links)
- Iterative Collaborative Filtering for Sparse Matrix Estimation (Q5060494) (← links)
- (Q5136293) (← links)
- Modularity Maximization for Graphons (Q6038778) (← links)
- Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising (Q6059433) (← links)
- Multi‐subject stochastic blockmodels with mixed effects for adaptive analysis of individual differences in human brain network cluster structure (Q6067695) (← links)
- Linear panel regressions with two-way unobserved heterogeneity (Q6090548) (← links)
- Learning sparse graphons and the generalized Kesten-Stigum threshold (Q6172190) (← links)
- On sparsity, power-law, and clustering properties of graphex processes (Q6198068) (← links)
