Hybrid Entropy-Based Metrics for k-Hop Environment Analysis in Complex Networks

Two hybrid, entropy-guided node metrics are proposed for the k-hop environment: Entropy-Weighted Redundancy (EWR) and Normalized Entropy Density (NED). The central idea is to couple local Shannon entropy with neighborhood density/redundancy so that structural heterogeneity around a vertex is captured even when classical indices (e.g., degree or clustering) are similar. The metrics are formally defined and shown to be bounded, isomorphism-invariant, and stable under small edge edits. Their behavior is assessed on representative topologies (Erdős–Rényi, Barabási–Albert, Watts–Strogatz, random geometric graphs, and the Zephyr quantum architecture). Across these settings, EWR and NED display predominantly negative correlation with degree and provide information largely orthogonal to standard centralities; vertices with identical degree can differ by factors of two to three in the proposed scores, revealing bridges and heterogeneous regions. These properties indicate utility for vulnerability assessment, topology-aware optimization, and layout heuristics in engineered and quantum networks.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-09-08
DOI
https://doi.org/10.3390/math13172902
Citations
1
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
1.32

Funders

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

Hybrid Entropy-Based Metrics for k-Hop Environment Analysis in Complex Networks

Csaba Bíró
1 citations
Mathematics
Complex Network Analysis Techniques
1.32
article

Hybrid Entropy-Based Metrics for k-Hop Environment Analysis in Complex Networks

Csaba Bíró
article en
1 citations

Abstract

Two hybrid, entropy-guided node metrics are proposed for the k-hop environment: Entropy-Weighted Redundancy (EWR) and Normalized Entropy Density (NED). The central idea is to couple local Shannon entropy with neighborhood density/redundancy so that structural heterogeneity around a vertex is captured even when classical indices (e.g., degree or clustering) are similar. The metrics are formally defined and shown to be bounded, isomorphism-invariant, and stable under small edge edits. Their behavior is assessed on representative topologies (Erdős–Rényi, Barabási–Albert, Watts–Strogatz, random geometric graphs, and the Zephyr quantum architecture). Across these settings, EWR and NED display predominantly negative correlation with degree and provide information largely orthogonal to standard centralities; vertices with identical degree can differ by factors of two to three in the proposed scores, revealing bridges and heterogeneous regions. These properties indicate utility for vulnerability assessment, topology-aware optimization, and layout heuristics in engineered and quantum networks.

MathematicsVol. 13(17)
Eötvös Loránd University (HU), Eszterhazy Karoly Catholic University (HU)
Nemzeti Kutatási, Fejlesztési és Innovaciós Alap, National Research, Development and Innovation Office
Openalex Percentile: Top 16%
Complex Network Analysis Techniques
1.32
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.