Core-periphery structure in networks: a statistical exposition
From MaRDI portal
Publication:2693378
DOI10.1214/23-SS141OpenAlexW4322581140MaRDI QIDQ2693378
Srijan Sengupta, Eric Yanchenko
Publication date: 20 March 2023
Published in: Statistics Surveys (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.04455
Parametric hypothesis testing (62F03) Point estimation (62F10) Bayesian inference (62F15) Research exposition (monographs, survey articles) pertaining to statistics (62-02)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Pseudo-likelihood methods for community detection in large sparse networks
- Scan statistics on Enron graphs
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Bayesian community detection
- Future paths for integer programming and links to artificial intelligence
- Consistency of community detection in networks under degree-corrected stochastic block models
- Sparse networks with core-periphery structure
- Finding core-periphery structures in large networks
- The hierarchy of block models
- Scalable estimation of epidemic thresholds via node sampling
- Consistency of spectral clustering in stochastic block models
- Consistency of spectral clustering
- The centrality index of a graph
- Completely random measures
- Spectral clustering in heterogeneous networks
- A nonparametric view of network models and Newman–Girvan and other modularities
- An Efficient Heuristic Procedure for Partitioning Graphs
- Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem
- Latent Space Approaches to Social Network Analysis
- Community structure in social and biological networks
- Networks
- Detection of core–periphery structure in networks using spectral methods and geodesic paths
- Sparse Graphs Using Exchangeable Random Measures
- A Block Model for Node Popularity in Networks with Community Structure
- Multi-Scale attributed node embedding
- Bayesian Variational Inference for Exponential Random Graph Models
- Core–periphery structure in directed networks
- Fast unfolding of communities in large networks
- Bayesian Community Detection
- Core-Periphery Structure in Networks (Revisited)
- Statistical methods for network surveillance
- Compound Random Measures and their Use in Bayesian Non-Parametrics
- The average distances in random graphs with given expected degrees
- Hypothesis Testing for Automated Community Detection in Networks
This page was built for publication: Core-periphery structure in networks: a statistical exposition