2019
DOI: 10.1209/0295-5075/125/68001
|View full text |Cite
|
Sign up to set email alerts
|

Detecting core-periphery structures by surprise

Abstract: Detecting the presence of mesoscale structures in complex networks is of primary importance. This is especially true for financial networks, whose structural organization deeply affects their resilience to events like default cascades, shocks propagation, etc. Several methods have been proposed, so far, to detect communities, i.e. groups of nodes whose internal connectivity is significantly large. Communities, however do not represent the only kind of mesoscale structures characterizing realworld networks: oth… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(14 citation statements)
references
References 36 publications
(81 reference statements)
0
8
0
Order By: Relevance
“…Hence, we also check for the presence of the "generalized" star graph structure also known as core-periphery structure, composed by a densely-connected core of nodes surrounded by a periphery of loosely-connected vertices. In order to do so, we implement a recently-proposed approach 20 , prescribing to minimize the score function known as bimodular surprise and reading…”
Section: /11mentioning
confidence: 99%
See 1 more Smart Citation
“…Hence, we also check for the presence of the "generalized" star graph structure also known as core-periphery structure, composed by a densely-connected core of nodes surrounded by a periphery of loosely-connected vertices. In order to do so, we implement a recently-proposed approach 20 , prescribing to minimize the score function known as bimodular surprise and reading…”
Section: /11mentioning
confidence: 99%
“…2 is the total number of node pairs, L = ∑ N i=1 ∑ N j=i+1 a i j is the total number of links, C is the number of node pairs in the core portion of the network, P is the number of node pairs in the periphery portion of the network, l c is the observed number of links in the core and l p is the observed number of links in the periphery. From a technical point of view, S is the p-value of a multivariate hypergeometric distribution 20 .…”
Section: /11mentioning
confidence: 99%
“…allows 𝒲 ⫽ to be compactly rewritten in a way that nicely mirrors that of its binary counterpart [42,43].…”
Section: Core-periphery Detectionmentioning
confidence: 99%
“…allows W to be compactly rewritten in a way that nicely mirrors that of its binary counterpart 25,26 .…”
Section: Core-periphery Detectionmentioning
confidence: 99%