Oracle inequalities for network models and sparse graphon estimation
From MaRDI portal
Publication:524462
DOI10.1214/16-AOS1454zbMath1367.62090arXiv1507.04118OpenAlexW2962962954MaRDI QIDQ524462
Nicolas Verzelen, Olga Klopp, Alexandre B. Tsybakov
Publication date: 2 May 2017
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.04118
Inequalities; stochastic orderings (60E15) Nonparametric estimation (62G05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05)
Related Items
Edgeworth expansions for network moments, Local inference by penalization method for biclustering model, Markov random geometric graph, MRGG: a growth model for temporal dynamic networks, Bootstrapping exchangeable random graphs, Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator, Uniform estimation in stochastic block models is slow, Iterative Collaborative Filtering for Sparse Matrix Estimation, Testing for Equivalence of Network Distribution Using Subgraph Counts, Unnamed Item, Unnamed Item, Learning sparse graphons and the generalized Kesten-Stigum threshold, Estimation of Monge matrices, Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research), Spectral clustering in the dynamic stochastic block model, Outlier detection in networks with missing links, Maximum likelihood estimation of sparse networks with missing observations, Unnamed Item, Unnamed Item, On semidefinite relaxations for the block model, Sparse exchangeable graphs and their limits via graphon processes, Towards optimal estimation of bivariate isotonic matrices with unknown permutations, Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model, Two-sample Hypothesis Testing for Inhomogeneous Random Graphs, Adaptive estimation of nonparametric geometric graphs, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, Network representation using graph root distributions, How to Calculate the Barycenter of a Weighted Graph, Consistent nonparametric estimation for heavy-tailed sparse graphs, Optimal graphon estimation in cut distance, Dynamic network models and graphon estimation, Analysis of spectral clustering algorithms for community detection: the general bipartite setting, Unnamed Item, Structured matrix estimation and completion, Limit theorems for distributions invariant under groups of transformations, Unnamed Item
