Dynamic network models and graphon estimation
From MaRDI portal
Publication:2313290
DOI10.1214/18-AOS1751zbMath1466.62337arXiv1607.00673WikidataQ127817006 ScholiaQ127817006MaRDI QIDQ2313290
Publication date: 18 July 2019
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.00673
Nonparametric regression and quantile regression (62G08) Estimation in multivariate analysis (62H12) Random graphs (graph-theoretic aspects) (05C80) Minimax procedures in statistical decision theory (62C20)
Related Items (12)
Estimation of Subgraph Densities in Noisy Networks ⋮ Smoothing graphons for modelling exchangeable relational data ⋮ Symmetric Measures, Continuous Networks, and Dynamics ⋮ Unnamed Item ⋮ Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition ⋮ Spectral clustering in the dynamic stochastic block model ⋮ Two-way sparsity for time-varying networks with applications in genomics ⋮ Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model ⋮ Optimal change point detection and localization in sparse dynamic networks ⋮ Mixed Membership Estimation for Social Networks ⋮ Dynamic network models and graphon estimation ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Rate-optimal graphon estimation
- Minimax rates of community detection in stochastic block models
- Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach
- Locally adaptive dynamic networks
- Oracle inequalities for network models and sparse graphon estimation
- Limits of dense graph sequences
- Estimating time-varying networks
- A state-space mixed membership blockmodel for dynamic network tomography
- Statistical analysis of network data. Methods and models
- On semidefinite relaxations for the block model
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Dynamic network models and graphon estimation
- Adaptive estimation over anisotropic functional classes via oracle approach
- Sparse high-dimensional varying coefficient model: nonasymptotic minimax study
- Optimal Estimation and Completion of Matrices with Biclustering Structures
- A nonparametric view of network models and Newman–Girvan and other modularities
- Biclustering via Sparse Singular Value Decomposition
- A Survey of Statistical Network Models
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Statistical Clustering of Temporal Networks Through a Dynamic Stochastic Block Model
This page was built for publication: Dynamic network models and graphon estimation