en.m.wikipedia.org
Core–periphery structure
  (Redirected from Core-periphery)
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
This article has an unclear citation style. The references used may be made clearer with a different or consistent style of citation and footnoting. (March 2018) (Learn how and when to remove this template message)
This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (July 2015) (Learn how and when to remove this template message)
The lead section of this article may need to be rewritten. Use the lead layout guide to ensure the section follows Wikipedia's norms and is inclusive of all essential details.(October 2018) (Learn how and when to remove this template message)
(Learn how and when to remove this template message)
Core periphery structure is a network theory model based on Immanuel Wallerstein's world-systems theory.[citation needed] He formulated the chart in the 1980s.[clarification needed]
A Network with an idealized core–periphery structure
Models of core–periphery structures
There are two main intuitions behind the definition of core–periphery network structures; one assumes that a network can only have one core, whereas the other allows for the possibility of multiple cores. These two intuitive conceptions serve as the basis for two modes of core–periphery structures.
Discrete model
This model assumes that there are two classes of nodes. The first consists of a cohesive core sub-graph in which the nodes are highly interconnected, and the second is made up of a peripheral set of nodes that is loosely connected to the core. In an ideal core–periphery matrix, core nodes are adjacent to other core nodes and to some peripheral nodes while peripheral nodes are not connected with other peripheral nodes (Borgatti & Everett, 2000, p. 378). This requires, however, that there be an a priori partition that indicates whether a node belongs to the core or periphery.
In this idealized matrix, the blue block represents core-core links, the white block represents the absence of periphery links and the red quadrants represent core–periphery ties.
Continuous model
This model allows for the existence of three or more partitions of node classes. However, including more classes makes modifications to the discrete model more difficult.[clarification needed] Borgatti & Everett (1999) suggest that, in order to overcome this problem, each node be assigned a measure of ‘coreness’ that will determine its class. Nevertheless, the threshold of what constitutes a high ‘coreness’ value must be justified theoretically.
Discussion
Hubs are commonly found in empirical networks and pose a problem for community detection as they usually have strong ties to many communities. Identifying core–periphery structures can help circumvent this problem by categorizing hubs as part of the network's core (Rombach et al., 2014, p. 160). Likewise, though all core nodes have high centrality measures, not all nodes with high centrality measures belong to the core. It is possible to find that a set of highly central nodes in a graph does not make an internally cohesive subgraph (Borgatti & Everett, 2000)...
Uses in economics
The concept of center and periphery was first introduced by Raúl Prebisch in the 1950s. However, the qualitative notion that social networks can have a core–periphery structure has a long history in disciplines such as sociology, international relations (Nemeth & Smith, 1985), and economics (Snyder & Kick, 1979). Observed trade flows and diplomatic ties among countries fit this structure. Paul Krugman (1991) suggests that when transportation costs are low enough manufacturers concentrate in a single region known as the core and other regions (the periphery) limit themselves to the supply of agricultural goods.
See also
References
Last edited on 9 April 2021, at 14:57
Content is available under CC BY-SA 3.0 unless otherwise noted.
Privacy policy
Terms of Use
Desktop
HomeRandomNearbyLog inSettingsDonateAbout WikipediaDisclaimers
LanguageWatchEdit