VisExpA: Visibility expansion algorithm in the topology of complex networks

摘要

In this study, we provide the VisExpA (Visibility Expansion Algorithm), a computational code that implements a recently published method, which allows generating a visibility graph from a complex network instead of a time-series that is currently applicable. The proposed algorithm is applied to a complex network and it uses a node-wise control-attribute (network-nodes topological measure) to define the node-heights to which the original (time-series) visibility algorithm is applied. The VisExpA applies the idea of visibility graph from the field of time-series to complex networks and it allows interpreting the network topology as a landscape, making it a valuable tool of analysis in many disciplines.