Network cross-validation by edge sampling
From MaRDI portal
Abstract: While many statistical models and methods are now available for network analysis, resampling network data remains a challenging problem. Cross-validation is a useful general tool for model selection and parameter tuning, but is not directly applicable to networks since splitting network nodes into groups requires deleting edges and destroys some of the network structure. Here we propose a new network resampling strategy based on splitting node pairs rather than nodes applicable to cross-validation for a wide range of network model selection tasks. We provide a theoretical justification for our method in a general setting and examples of how our method can be used in specific network model selection and parameter tuning tasks. Numerical results on simulated networks and on a citation network of statisticians show that this cross-validation approach works well for model selection.
Recommendations
Cited in
(44)- Two-sample test of stochastic block models
- Fast Network Community Detection With Profile-Pseudo Likelihood Methods
- Directed Community Detection With Network Embedding
- Goodness-of-fit test for latent block models
- Community detection via an efficient nonconvex optimization approach based on modularity
- Universal rank inference via residual subsampling with application to large networks
- Compressed spectral screening for large-scale differential correlation analysis with application in selecting glioblastoma gene modules
- GBTM: community detection and network reconstruction for noisy and time-evolving data
- Stock co-jump networks
- Overlapping community detection in networks via sparse spectral decomposition
- Detecting overlapping communities in networks using spectral methods
- A statistical framework for modern network science
- Network Estimation by Mixing: Adaptivity and More
- Exponential-Family Embedding With Application to Cell Developmental Trajectories for Single-Cell RNA-Seq Data
- Community detection in complex networks: from statistical foundations to data science applications
- Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals
- Consistent Estimation of the Number of Communities via Regularized Network Embedding
- Link Prediction for Egocentrically Sampled Networks
- Identifiability and parameter estimation of the overlapped stochastic co-block model
- randnet
- On the efficacy of higher-order spectral clustering under weighted stochastic block models
- Subsampling spectral clustering for stochastic block models in large-scale networks
- Spectral co-clustering in multi-layer directed networks
- On the Estimation of the Number of Communities for Sparse Networks
- PCABM: Pairwise Covariates-Adjusted Block Model for Community Detection
- Hypothesis testing for equality of latent positions in random graphs
- scientific article; zbMATH DE number 7370528 (Why is no real title available?)
- Two-sample test of stochastic block models via the maximum sampling entry-wise deviation
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- Adjusted chi-square test for degree-corrected block models
- Estimating the number of communities by spectral methods
- scientific article; zbMATH DE number 7370586 (Why is no real title available?)
- Edge sampling using local network information
- Optimal Estimation of the Number of Network Communities
- Applications of dual regularized Laplacian matrix for community detection
- Extended stochastic block models with application to criminal networks
- Hierarchical Community Detection by Recursive Partitioning
- Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models
- Community Detection in General Hypergraph Via Graph Embedding
- Consistent estimation of the number of communities in stochastic block models using cross-validation
- Fallacy of data-selective inference in modelling networks
- Community detection in attributed collaboration network for statisticians
- Special invited paper: the SCORE normalization, especially for heterogeneous network and text data
- Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes
This page was built for publication: Network cross-validation by edge sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q159623)
