Core-Periphery Analysis Using Principal Components of the Neighborhood-based Bridge Node Centrality Tuple

The neighborhood-based bridge node centrality (NBNC) tuple has been proposed in the literature to rank nodes for the extent they could serve as a bridge node. The NBNC tuple of a node v has three entries: (# components in NGv, 1-algebraic connectivity ratio of NGv and degree of node v), where NGv is the neighborhood graph of node v. The research presented in this paper conducts principal component analysis on dataset comprising of NBNC tuples of all the nodes and computes a weighted PC_NBNC score based on the entries for the nodes in the dominating principal components (variances ≥ 1.0). The proposed model is to classify nodes as core (or peripheral) if their weighted PC_NBNC score is ≥ 0.0 (or < 0). The study measures the fractions of core-core, core-peripheral and peripheral-peripheral links and the fractions of core and peripheral nodes and uses these measures to classify a real-world network as either core-heavy or peripheral-heavy. Accordingly, 48 of the 80 real-world networks are classified as core-heavy (observed to be dominated by core nodes and core-core links) and the remaining 32 networks are classified as peripheral-heavy (observed to be dominated by peripheral nodes).

Authors

Publication Details

Journal
Computer and Information Science
Published
2025-02-19
DOI
https://doi.org/10.5539/cis.v18n1p62
Primary Topic
Internet of Things and Social Network Interactions
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Core-Periphery Analysis Using Principal Components of the Neighborhood-based Bridge Node Centrality Tuple

Natarajan Meghanathan
Computer and Information Science
Internet of Things and Social Network Interactions
article

Core-Periphery Analysis Using Principal Components of the Neighborhood-based Bridge Node Centrality Tuple

Natarajan Meghanathan
article en

Abstract

The neighborhood-based bridge node centrality (NBNC) tuple has been proposed in the literature to rank nodes for the extent they could serve as a bridge node. The NBNC tuple of a node v has three entries: (# components in NGv, 1-algebraic connectivity ratio of NGv and degree of node v), where NGv is the neighborhood graph of node v. The research presented in this paper conducts principal component analysis on dataset comprising of NBNC tuples of all the nodes and computes a weighted PC_NBNC score based on the entries for the nodes in the dominating principal components (variances ≥ 1.0). The proposed model is to classify nodes as core (or peripheral) if their weighted PC_NBNC score is ≥ 0.0 (or < 0). The study measures the fractions of core-core, core-peripheral and peripheral-peripheral links and the fractions of core and peripheral nodes and uses these measures to classify a real-world network as either core-heavy or peripheral-heavy. Accordingly, 48 of the 80 real-world networks are classified as core-heavy (observed to be dominated by core nodes and core-core links) and the remaining 32 networks are classified as peripheral-heavy (observed to be dominated by peripheral nodes).

Computer and Information ScienceVol. 18(1)
National Science Foundation
Openalex Percentile: Top 97%
Internet of Things and Social Network Interactions
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.