scientific article; zbMATH DE number 7255138
From MaRDI portal
Publication:4969176
Monika Bhattacharjee, Moulinath Banerjee, George Michailidis
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1812.03090
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
estimationconvergence rateclustering algorithmcommunity detectionstochastic block modelchange pointErdős-Rényi random graphedge probability matrix
Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items (7)
Exact tests for offline changepoint detection in multichannel binary and count data with application to networks ⋮ Community detection for multilayer weighted networks ⋮ Multiple Change Point Detection in Reduced Rank High Dimensional Vector Autoregressive Models ⋮ Inference on the change point under a high dimensional sparse mean shift ⋮ Localising change points in piecewise polynomials of general degrees ⋮ Optimal change point detection and localization in sparse dynamic networks ⋮ Network Interpolation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast community detection by SCORE
- Rate-optimal graphon estimation
- Impact of regularization on spectral clustering
- 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
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral clustering in the dynamic stochastic block model
- Estimating time-varying networks
- A state-space mixed membership blockmodel for dynamic network tomography
- NP-hardness of Euclidean sum-of-squares clustering
- Algorithms for the optimal identification of segment neighborhoods
- Weak convergence and empirical processes. With applications to statistics
- Dynamic network models and graphon estimation
- Consistency of spectral clustering in stochastic block models
- Role of normalization in spectral clustering for stochastic blockmodels
- Co-clustering separately exchangeable network data
- Introduction to empirical processes and semiparametric inference
- Structural breaks in time series
- Statistical Analysis of Network Data with R
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Statistical Clustering of Temporal Networks Through a Dynamic Stochastic Block Model
- Concentration and regularization of random graphs
This page was built for publication:
