Core-periphery structure in networks (revisited)
From MaRDI portal
Publication:5348331
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) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)
Abstract: Intermediate-scale (or `meso-scale') structures in networks have received considerable attention, as the algorithmic detection of such structures makes it possible to discover network features that are not apparent either at the local scale of nodes and edges or at the global scale of summary statistics. Numerous types of meso-scale structures can occur in networks, but investigations of such features have focused predominantly on the identification and study of community structure. In this paper, we develop a new method to investigate the meso-scale feature known as core-periphery structure, which entails identifying densely-connected core nodes and sparsely-connected periphery nodes. In contrast to communities, the nodes in a core are also reasonably well-connected to those in the periphery. Our new method of computing core-periphery structure can identify multiple cores in a network and takes different possible cores into account. We illustrate the differences between our method and several existing methods for identifying which nodes belong to a core, and we use our technique to examine core-periphery structure in examples of friendship, collaboration, transportation, and voting networks.
Recommendations
Cites work
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- A \(k\)-shell decomposition method for weighted networks
- An algorithm for drawing general undirected graphs
- Cliques in regular graphs and the core-periphery problem in social networks
- Communities in 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
- Community structure in social and biological networks
- Complex networks: structure and dynamics
- Core-periphery structure in networks
- Detection of core-periphery structure in networks using spectral methods and geodesic paths
- Fast unfolding of communities in large networks
- Indirect Blockmodeling of 3-Way Networks
- Network partition via a bound of the spectral radius
- Networks. An introduction.
- Optimization by simulated annealing
- Regular equivalence: General theory
- Statistical models for cores decomposition of an undirected random graph
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- The average distances in random graphs with given expected degrees
Cited in
(37)- An improved belief propagation algorithm for detecting mesoscale structure in complex networks
- Absence of a resolution limit in in-block nestedness
- A spectral method for bipartizing a network and detecting a large anti-community
- Twin subgraphs and core-semiperiphery-periphery structures
- Financial contagion in a stochastic block model
- An integrated model for fire sales and default contagion
- The weak core and the structure of elites in social multiplex networks
- Core-periphery structure in networks
- On a matrix-based measure of the degree of coreness of a node in a network
- Double phase transition of the Ising model in core-periphery networks
- Investigating the relationship between \(k\)-core and \(s\)-core network decompositions
- Percolation on complex networks: theory and application
- Cliques in regular graphs and the core-periphery problem in social networks
- Unfolding the core structure of the reciprocal graph of a massive online social network
- Core-periphery models via integer programming: maximizing the influence of the core
- Relating modularity maximization and stochastic block models in multilayer networks
- Multilayer brain networks
- Stochastic block models are a discrete surface tension
- Fast algorithms for determining (generalized) core groups in social networks
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks
- Characterizing core-periphery structure of complex network by \(h\)-core and fingerprint curve
- Centrality metrics and localization in core-periphery networks
- Core-periphery structure in networks: a statistical exposition
- Detection of core-periphery structure in networks using spectral methods and geodesic paths
- Hitting times for second-order random walks
- Sparse networks with core-periphery structure
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Identifying well-connected communities in real-world and synthetic networks
- Formalising and detecting community structures in real world complex networks
- Generalized \(K\)-core percolation in networks with community structure
- Core-periphery structure in directed networks
- Efficient search for informational cores in complex systems: application to brain networks
- Core-Periphery Detection in Hypergraphs
- Counterparty credit limits: the impact of a risk-mitigation measure on everyday trading
- A fast algorithm for integrative community detection of multi-layer networks
- Functionability in complex networks: Leading nodes for the transition from structural to functional networks through remote asynchronization
- Resilience of core-periphery networks in the case of rich-club
This page was built for publication: Core-periphery structure in networks (revisited)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348331)
