Emergence of core–peripheries in networks

  title={Emergence of core–peripheries in networks},
  author={Trivik Verma and Fabian Russmann and Nuno A. M. Ara{\'u}jo and Jan Nagler and Hans J. Herrmann},
  journal={Nature Communications},
A number of important transport networks, such as the airline and trade networks of the world, exhibit a characteristic core–periphery structure, wherein a few nodes are highly interconnected and the rest of the network frays into a tree. Mechanisms underlying the emergence of core–peripheries, however, remain elusive. Here, we demonstrate that a simple pruning process based on removal of underutilized links and redistribution of loads can lead to the emergence of core–peripheries. Links are… 

Finding multiple core-periphery pairs in networks

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.

Multiscale core-periphery structure in a global liner shipping network

An algorithm to detect core-periphery pairs in a network is developed, which allows one to find core and peripheral nodes on different scales and uses a configuration model that accounts for the fact that the network is obtained by the one-mode projection of a bipartite network.

Articulation points in complex networks

It is found that a greedy articulation point removal process provides a different perspective on the organizational principles of complex networks and results in a rich phase diagram with two fundamentally different types of percolation transitions that shed light on the design of more resilient infrastructure networks and the effective destruction of terrorist communication networks.

Core-Periphery Structure in Networks (Revisited)

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.

(2019). Multiscale core-periphery structure in a global liner shipping network. Scientific Reports , , [404].

Maritime transport accounts for a majority of trades in volume, of which 70% in value is carried by container ships that transit regular routes on fixed schedules in the ocean. In the present paper,

Random Spatial Network Models for Core-Periphery Structure

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

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.

K-core robustness in ecological and financial networks

This work finds that high occupancy of nodes in the inner and outer k-shells and low occupancy in the middle shells of financial and ecological networks provide resilience against both local targeted and global attacks, suggesting that the “U-shaped” occupancy histogram and its implications for network health may indeed be universal.

Portfolio optimization based on network topology




Core-periphery organization of complex networks.

  • P. Holme
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
This study proposes a coefficient to measure if the network has such a clear-cut core-periphery dichotomy and measures this coefficient for a number of real-world and model networks and finds that different classes of networks have their characteristic values.

Emergence of hierarchy in cost-driven growth of spatial networks

A generic model for the growth of spatial networks based on the general concept of cost–benefit analysis is introduced and it is shown that spatial hierarchy emerges naturally, with structures composed of various hubs controlling geographically separated service areas, and appears as a large-scale consequence of local cost– benefit considerations.

Profiling core-periphery network structure by random walkers

It is shown that the core-periphery structure can effectively be profiled by elaborating the behaviour of a random walker, providing a global topological portrait.

Revealing the structure of the world airline network

It is empirically revealed that the WAN is a redundant and resilient network for long distance air travel, but otherwise breaks down completely due to removal of short and apparently insignificant connections.

Core-Periphery Structure in Networks

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.

The evolution of the world trade web: a weighted-network analysis

This paper employs a weighted network approach to study the empirical properties of the web of trade relationships among world countries, and its evolution over time. We show that most countries are

K-core Organization of Complex Networks

It is shown that in networks with a finite mean number zeta2 of the second-nearest neighbors, the emergence of a k-core is a hybrid phase transition, and in contrast, ifZeta2 diverges, the networks contain an infinite sequence of k-cores which are ultrarobust against random damage.

Models of core/periphery structures

Modelling the air transport with complex networks: A short review

This paper discusses possible networks that can be defined for the air transport and focuses on networks of airports connected by flights, reviewing several papers investigating the topology of these networks and their dynamics for time scales ranging from years to intraday intervals.

Modularity and community structure in networks.

  • M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2006
It is shown that the modularity of a network can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which is called modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times.