IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i17p2902-d1744871.html
   My bibliography  Save this article

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

Author

Listed:
  • Csaba Biró

    (Faculty of Informatics, Eszterházy Károly Catholic University, 3300 Eger, Hungary
    Faculty of Informatics, Eötvös Loránd University, 1117 Budapest, Hungary)

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.

Suggested Citation

  • Csaba Biró, 2025. "Hybrid Entropy-Based Metrics for k-Hop Environment Analysis in Complex Networks," Mathematics, MDPI, vol. 13(17), pages 1-27, September.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:17:p:2902-:d:1744871
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/17/2902/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/17/2902/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:17:p:2902-:d:1744871. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.