Comparing gravity-based centralities across divergent network topologies: evidence from internet AS and citation DAGs

We compare eleven gravity-based centrality models across two divergent Directed Acyclic Graph (DAG) domains: Internet Autonomous System Networks (ASNs) and scientific citation networks. Using Kendall’s τ , Spearman’s ρ, and monotonicity metrics, we evaluate ranking resolution, benchmark comparison, and structural distinctiveness. Results show that gravity-based models achieve strong ranking resolution once leaf nodes are removed, and several variants remain robust even with leaves included in citation networks. The DKE, Entropy-Based, K-Shell Based, and Multi-Characteristics models perform best, while the Extended and Laplacian variants underperform. Closeness consistently emerges as the strongest classical baseline but remains structurally independent from gravity-based families. Correlation analyses reveal three distinct clusters of gravity-based models, indicating that different formulations capture complementary structural properties. We show that gravity-based models offer a scalable and adaptable framework for DAG analysis and motivate new gravity formulations that build on the discriminative strengths of Closeness.

Authors

Publication Details

Published
2026-01-16
DOI
https://doi.org/10.1117/12.3097387
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Comparing gravity-based centralities across divergent network topologies: evidence from internet AS and citation DAGs

Mahboobeh Zangiabady, Alberto Garcia‐Robledo, Jacco te Poel
Complex Network Analysis Techniques
article

Comparing gravity-based centralities across divergent network topologies: evidence from internet AS and citation DAGs

Mahboobeh Zangiabady, Alberto Garcia‐Robledo, Jacco te Poel
article en

Abstract

We compare eleven gravity-based centrality models across two divergent Directed Acyclic Graph (DAG) domains: Internet Autonomous System Networks (ASNs) and scientific citation networks. Using Kendall’s τ , Spearman’s ρ, and monotonicity metrics, we evaluate ranking resolution, benchmark comparison, and structural distinctiveness. Results show that gravity-based models achieve strong ranking resolution once leaf nodes are removed, and several variants remain robust even with leaves included in citation networks. The DKE, Entropy-Based, K-Shell Based, and Multi-Characteristics models perform best, while the Extended and Laplacian variants underperform. Closeness consistently emerges as the strongest classical baseline but remains structurally independent from gravity-based families. Correlation analyses reveal three distinct clusters of gravity-based models, indicating that different formulations capture complementary structural properties. We show that gravity-based models offer a scalable and adaptable framework for DAG analysis and motivate new gravity formulations that build on the discriminative strengths of Closeness.

Reduced inequalities
Openalex Percentile: Top 85%
Complex Network Analysis Techniques
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.