Core-periphery structure in networks: a statistical exposition
From MaRDI portal
Cites work
- A Block Model for Node Popularity in Networks with Community Structure
- A nonparametric view of network models and Newman–Girvan and other modularities
- An Efficient Heuristic Procedure for Partitioning Graphs
- Bayesian community detection
- Bayesian community detection
- Bayesian Variational Inference for Exponential Random Graph Models
- Community structure in social and biological networks
- Completely random measures
- Compound random measures and their use in Bayesian non-parametrics
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of spectral clustering
- Consistency of spectral clustering in stochastic block models
- Core-periphery structure in directed networks
- Core-periphery structure in networks (revisited)
- Detection of core-periphery structure in networks using spectral methods and geodesic paths
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Fast unfolding of communities in large networks
- Finding core-periphery structures in large networks
- Future paths for integer programming and links to artificial intelligence
- Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- Hypothesis testing for automated community detection in networks
- Latent Space Approaches to Social Network Analysis
- Multi-scale attributed node embedding
- Networks
- Optimization by simulated annealing
- Pseudo-likelihood methods for community detection in large sparse networks
- Scalable estimation of epidemic thresholds via node sampling
- Scan statistics on Enron graphs
- Sparse graphs using exchangeable random measures
- Sparse networks with core-periphery structure
- Spectral clustering in heterogeneous networks
- Statistical methods for network surveillance
- The average distances in random graphs with given expected degrees
- The centrality index of a graph
- The hierarchy of block models
Cited in
(4)- Investigating the relationship between k-core and s-core network decompositions
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks
- Graph sub-sampling for divide-and-conquer algorithms in large networks
- Investigating the Lisbon Treaty's impact on the co-citation network of the court of justice of the European union case law
This page was built for publication: Core-periphery structure in networks: a statistical exposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693378)
