A core-periphery profiling method that ranks nodes by coreness then k-core centrality identifies denser cores and often finds maximum cliques.
This is a widely studied social network in network science
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
dataset 1
citation-polarity summary
fields
physics.soc-ph 1years
2025 1verdicts
CONDITIONAL 1roles
dataset 1polarities
use dataset 1representative citing papers
citing papers explorer
-
An effective method for profiling core-periphery structures in complex networks
A core-periphery profiling method that ranks nodes by coreness then k-core centrality identifies denser cores and often finds maximum cliques.