Core-periphery organization of complex networks.

@article{Holme2005CoreperipheryOO,
  title={Core-periphery organization of complex networks.},
  author={Petter Holme},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2005},
  volume={72 4 Pt 2},
  pages={
          046111
        }
}
  • P. Holme
  • Published 6 June 2005
  • Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Networks may, or may not, be wired to have a core that is both itself densely connected and central in terms of graph distance. In this study we propose a coefficient to measure if the network has such a clear-cut core-periphery dichotomy. We measure this coefficient for a number of real-world and model networks and find that different classes of networks have their characteristic values. Among other things we conclude that geographically embedded transportation networks have a strong core… 

Figures and Tables from this paper

Finding multiple core-periphery pairs in networks
TLDR
This work proposes a scalable algorithm to detect multiple nonoverlapping groups of core-periphery structure in a network and illustrates the algorithm using synthesized and empirical networks.
Multicores-periphery structure in networks
TLDR
The multicores-periphery structure is defined and an algorithm to identify the optimal partition of multiple cores and the periphery in general networks is introduced to demonstrate the performance of the algorithm by applying it to a well-known social network and a patent technology network.
Core-Periphery Structure in Networks (Revisited)
TLDR
This paper develops a new method to investigate the meso-scale feature known as core-periphery structure, which entails identifying densely connected core nodes and sparsely connected peripheral nodes in a network.
Core-Periphery Structure in Networks
TLDR
This paper develops a new method to investigate the meso-scale feature known as core-periphery structure, which entails identifying densely connected core nodes and sparsely connected peripheral nodes in a network.
Random Spatial Network Models for Core-Periphery Structure
TLDR
This work develops a generative, random network model with core-periphery structure that jointly accounts for topological and spatial information by "core scores'' of vertices and demonstrates how the core scores can be used in downstream data mining tasks, such as predicting airline traffic and classifying fungal networks.
Detecting Core-Periphery Structure in Spatial Networks
TLDR
This paper proposes a random network model for spatial networks with core-periphery structure inspired by the Kleinberg small-world model, which uses a vertex core score to indicate the "coreness" of each vertex, and connects each pair of vertices with a probability parameterized by their distance and core scores.
Natural emergence of a core structure in networks via clique percolation
Networks are often presented as containing a “core” and a “periphery.” The existence of a core suggests that some vertices are central and form the skeleton of the network, to which all other
Density-Based and Transport-Based Core-Periphery Structures in Networks
TLDR
It is illustrated that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks, and a family of generative models of roadlike networks is developed, which demonstrate that the correlations between different measures of coreness can be very different for different types of networks.
Structure and dynamics of core/periphery networks
TLDR
The current knowledge of the structure and dynamics of "traditional" core/periphery networks, rich-clubs, nested, bow-tie and onion networks are summarized and network modules are discriminated between global and local cores.
...
...

References

SHOWING 1-10 OF 64 REFERENCES
Models of core/periphery structures
Modeling the world-wide airport network
TLDR
A new model is proposed that explains the behavior of the world-wide airport network in terms of the geo-political constraints that affect the growth of the airport network and hypothesizes that in other infrastructures, critical locations might not coincide with highly-connected hubs.
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
The Structure and Function of Complex Networks
TLDR
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Mixing patterns in networks.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
TLDR
This work proposes a number of measures of assortative mixing appropriate to the various mixing types, and applies them to a variety of real-world networks, showing that assortsative mixing is a pervasive phenomenon found in many networks.
The rich-club phenomenon in the Internet topology
TLDR
It is shown that the Internet topology at the autonomous system (AS) level has a rich-club phenomenon, which is a simple qualitative way to differentiate between power law topologies and provides a criterion for new network models.
Assortative mixing in networks.
  • M. Newman
  • Computer Science
    Physical review letters
  • 2002
TLDR
This work proposes a model of an assortatively mixed network and finds that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.
Shape and efficiency in spatial distribution networks
TLDR
This work proposes two models of network growth that offer explanations of how this situation might arise and finds that distribution networks appear remarkably close to optimal where both these properties are concerned.
Statistical mechanics of complex networks
TLDR
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
...
...