Abstract

We introduce distance entropy as a measure of homogeneity in the distribution of path lengths between a given node and its neighbours in a complex network. Distance entropy defines a new centrality measure whose properties are investigated for a variety of synthetic network models. By coupling distance entropy information with closeness centrality, we introduce a network cartography which allows one to reduce the degeneracy of ranking based on closeness alone. We apply this methodology to the empirical multiplex lexical network encoding the linguistic relationships known to English speaking toddlers. We show that the distance entropy cartography better predicts how children learn words compared to closeness centrality. Our results highlight the importance of distance entropy for gaining insights from distance patterns in complex networks.

Highlights

  • Network science provides a powerful framework for modelling and understanding how individual entities give rise to complex—and often unexpected—phenomena by interacting with each other [1,2,3,4,5,6]

  • By coupling distance entropy information with closeness centrality, we introduce a network cartography which allows one to reduce the degeneracy of ranking based on closeness alone

  • We introduce a new type of distance entropy, characterising the distribution of path lengths from a given node in a network

Read more

Summary

Introduction

Network science provides a powerful framework for modelling and understanding how individual entities give rise to complex—and often unexpected—phenomena by interacting with each other [1,2,3,4,5,6]. Defining the centrality of nodes in complex networks is an important question for determining the role of individual agents in a variety of dynamical processes such as information flow and influence maximisation [7,8,9], network growth [1], and resilience to cascade failures [10,11]. In many of these processes, centrality can be defined by means of network distance—that is, the minimum number of links separating any two nodes. Our results provide compelling evidence for the importance of considering information measures relative to shortest paths for gaining insights into real-world complex systems

Introducing a New Distance Entropy
Distance Entropy and Network Models
Homogeneous Random Graphs
Small-World Networks
Barabasi–Albert Networks
Cartography Based on Distance Entropy and Closeness Centrality
Applying Distance Entropy Cartography to Multiplex Lexical Networks
Findings
Discussion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.