Core-Periphery Structure in Networks (Revisited)
DOI10.1137/17M1130046zbMath1368.62170arXiv1202.2684MaRDI QIDQ5348331
Mason A. Porter, James H. Fowler, Puck Rombach, Peter J. Mucha
Publication date: 15 August 2017
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.2684
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Applications of graph theory to circuits and networks (94C15)
Related Items (19)
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Statistical models for cores decomposition of an undirected random graph
- An algorithm for drawing general undirected graphs
- Complex networks: structure and dynamics
- Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Communities in Networks
- Community structure in social and biological networks
- Detection of core–periphery structure in networks using spectral methods and geodesic paths
- Regular equivalence: General theory
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- Network partition via a bound of the spectral radius
- Ak-shell decomposition method for weighted networks
- Fast unfolding of communities in large networks
- Indirect Blockmodeling of 3-Way Networks
- Core-Periphery Structure in Networks
- The average distances in random graphs with given expected degrees
- Networks
This page was built for publication: Core-Periphery Structure in Networks (Revisited)