Content deleted Content added
ClueBot NG (talk | contribs) m Reverting possible vandalism by 24.179.31.32 to version by AnomieBOT. Report False Positive? Thanks, ClueBot NG. (3518665) (Bot) |
|||
Line 10:
===Discrete model===
This model assumes that there are two classes of nodes that are further broken down later. 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.
[[File:Core-Periphery Matrix.png|thumb|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.]]
| |||