Pages that link to "Item:Q524462"
From MaRDI portal
The following pages link to Oracle inequalities for network models and sparse graphon estimation (Q524462):
Displayed 35 items.
- Two-sample Hypothesis Testing for Inhomogeneous Random Graphs (Q126111) (← links)
- Spectral clustering in the dynamic stochastic block model (Q668613) (← links)
- Local inference by penalization method for biclustering model (Q1631204) (← 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)
- Adaptive estimation of nonparametric geometric graphs (Q2035746) (← 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)
- Limit theorems for distributions invariant under groups of transformations (Q2091824) (← links)
- Edgeworth expansions for network moments (Q2131253) (← links)
- Markov random geometric graph, MRGG: a growth model for temporal dynamic networks (Q2136619) (← 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)
- Estimation of Monge matrices (Q2203631) (← links)
- Outlier detection in networks with missing links (Q2242182) (← links)
- Maximum likelihood estimation of sparse networks with missing observations (Q2242863) (← links)
- Optimal graphon estimation in cut distance (Q2312687) (← links)
- Dynamic network models and graphon estimation (Q2313290) (← links)
- Structured matrix estimation and completion (Q2325396) (← links)
- Sparse exchangeable graphs and their limits via graphon processes (Q4558542) (← links)
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting (Q4633061) (← links)
- (Q4969035) (← links)
- (Q4969176) (← links)
- (Q5053171) (← links)
- (Q5053173) (← links)
- Iterative Collaborative Filtering for Sparse Matrix Estimation (Q5060494) (← links)
- Testing for Equivalence of Network Distribution Using Subgraph Counts (Q5065993) (← links)
- Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research) (Q5118665) (← links)
- (Q5136293) (← links)
- (Q5159418) (← links)
- How to Calculate the Barycenter of a Weighted Graph (Q5219691) (← links)
- Learning sparse graphons and the generalized Kesten-Stigum threshold (Q6172190) (← links)