Dynamic network models and graphon estimation
From MaRDI portal
Abstract: In the present paper we consider a dynamic stochastic network model. The objective is estimation of the tensor of connection probabilities when it is generated by a Dynamic Stochastic Block Model (DSBM) or a dynamic graphon. In particular, in the context of the DSBM, we derive a penalized least squares estimator of and show that satisfies an oracle inequality and also attains minimax lower bounds for the risk. We extend those results to estimation of when it is generated by a dynamic graphon function. The estimators constructed in the paper are adaptive to the unknown number of blocks in the context of the DSBM or to the smoothness of the graphon function. The technique relies on the vectorization of the model and leads to much simpler mathematical arguments than the ones used previously in the stationary set up. In addition, all results in the paper are non-asymptotic and allow a variety of extensions.
Recommendations
- Spectral clustering in the dynamic stochastic block model
- Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model
- Oracle inequalities for network models and sparse graphon estimation
- When is non-trivial estimation possible for graphons and stochastic block models?
- Block matrix models for dynamic networks
Cites work
- A nonparametric view of network models and Newman–Girvan and other modularities
- A state-space mixed membership blockmodel for dynamic network tomography
- A survey of statistical network models
- Achieving optimal misclassification proportion in stochastic block models
- Adaptive estimation over anisotropic functional classes via oracle approach
- Biclustering via sparse singular value decomposition
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach
- Dynamic network models and graphon estimation
- Estimating time-varying networks
- Large networks and graph limits
- Limits of dense graph sequences
- Locally adaptive dynamic networks
- Minimax rates of community detection in stochastic block models
- On semidefinite relaxations for the block model
- Optimal estimation and completion of matrices with biclustering structures
- Oracle inequalities for network models and sparse graphon estimation
- Rate-optimal graphon estimation
- Sparse high-dimensional varying coefficient model: nonasymptotic minimax study
- Statistical analysis of network data. Methods and models
- Statistical clustering of temporal networks through a dynamic stochastic block model
Cited in
(40)- Multiple network embedding for anomaly detection in time series of graphs
- A Time-Varying Network for Cryptocurrencies
- scientific article; zbMATH DE number 5233442 (Why is no real title available?)
- Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model
- Euclidean Mirrors and Dynamics in Network Time Series
- Symmetric measures, continuous networks, and dynamics
- Dynamic graph models and their properties
- Tracking a Markov-Modulated Stationary Degree Distribution of a Dynamic Random Graph
- Networks with correlated edge processes
- Dynamic network models and graphon estimation
- Estimation of the parameters in an expanding dynamic network model
- Modeling Network Populations via Graph Distances
- scientific article; zbMATH DE number 4130439 (Why is no real title available?)
- Smoothing graphons for modelling exchangeable relational data
- scientific article; zbMATH DE number 7415089 (Why is no real title available?)
- Dynamic chain graph models for time series network data
- Two-way sparsity for time-varying networks with applications in genomics
- A framework for imperfectly observed networks
- Dynamic graph models
- Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition
- Semiparametric estimation for dynamic networks with shifted connecting intensities
- Random interval distillation for detection of change-points in Markov chain Bernoulli networks
- When is non-trivial estimation possible for graphons and stochastic block models?
- Estimation of Subgraph Densities in Noisy Networks
- Block matrix models for dynamic networks
- Graphical models for complex networks: an application to Italian museums
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
- A two-way heterogeneity model for dynamic networks
- Optimal change point detection and localization in sparse dynamic networks
- Rate-optimal graphon estimation
- Dynamic Graphs in the Sliding-Window Model
- scientific article; zbMATH DE number 7255138 (Why is no real title available?)
- Computational lower bounds for graphon estimation via low-degree polynomials
- Computational and statistical thresholds in multi-layer stochastic block models
- Spectral clustering in the dynamic stochastic block model
- scientific article; zbMATH DE number 5125602 (Why is no real title available?)
- Mixed Membership Estimation for Social Networks
- Learning brain connectivity in social cognition with dynamic network regression
- Randomized spectral clustering for large-scale multi-layer networks
- Oracle inequalities for network models and sparse graphon estimation
This page was built for publication: Dynamic network models and graphon estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2313290)
