VisExpA: Visibility expansion algorithm in the topology of complex networks | Zendy

Dimitrios Tsiotas | Zendy; Avraam Charakopoulos | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

VisExpA: Visibility expansion algorithm in the topology of complex networks

Author(s) -

Dimitrios Tsiotas,

Avraam Charakopoulos

Publication year - 2019

Publication title -

softwarex

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.528

H-Index - 21

ISSN - 2352-7110

DOI - 10.1016/j.softx.2019.100379

Subject(s) - visibility graph , visibility , computer science , complex network , node (physics) , algorithm , graph , series (stratigraphy) , network topology , topology (electrical circuits) , field (mathematics) , theoretical computer science , mathematics , computer network , physics , paleontology , geometry , structural engineering , combinatorics , regular polygon , world wide web , pure mathematics , optics , biology , engineering

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research