Mostrar el registro sencillo del ítem
Visibility in the topology of complex networks
dc.creator | Tsiotas D., Charakopoulos A. | en |
dc.date.accessioned | 2023-01-31T10:15:29Z | |
dc.date.available | 2023-01-31T10:15:29Z | |
dc.date.issued | 2018 | |
dc.identifier | 10.1016/j.physa.2018.03.055 | |
dc.identifier.issn | 03784371 | |
dc.identifier.uri | http://hdl.handle.net/11615/80015 | |
dc.description.abstract | Taking its inspiration from the visibility algorithm, which was proposed by Lacasa et al. (2008) to convert a time-series into a complex network, this paper develops and proposes a novel expansion of this algorithm that allows generating a visibility graph from a complex network instead of a time-series that is currently applicable. The purpose of this approach is to apply the idea of visibility from the field of time-series to complex networks in order to interpret the network topology as a landscape. Visibility in complex networks is a multivariate property producing an associated visibility graph that maps the ability of a node “to see” other nodes in the network that lie beyond the range of its neighborhood, in terms of a control-attribute. Within this context, this paper examines the visibility topology produced by connectivity (degree) in comparison with the original (source) network, in order to detect what patterns or forces describe the mechanism under which a network is converted to a visibility graph. The overall analysis shows that visibility is a property that increases the connectivity in networks, it may contribute to pattern recognition (among which the detection of the scale-free topology) and it is worth to be applied to complex networks in order to reveal the potential of signal processing beyond the range of its neighborhood. Generally, this paper promotes interdisciplinary research in complex networks providing new insights to network science. © 2018 Elsevier B.V. | en |
dc.language.iso | en | en |
dc.source | Physica A: Statistical Mechanics and its Applications | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85044939917&doi=10.1016%2fj.physa.2018.03.055&partnerID=40&md5=5cd8a7c826b65f48cc698b7bee353937 | |
dc.subject | Graph algorithms | en |
dc.subject | Graph theory | en |
dc.subject | Pattern recognition | en |
dc.subject | Signal processing | en |
dc.subject | Time series | en |
dc.subject | Time series analysis | en |
dc.subject | Visibility | en |
dc.subject | In networks | en |
dc.subject | Interdisciplinary research | en |
dc.subject | Network science | en |
dc.subject | Network topology | en |
dc.subject | Scale-free topologies | en |
dc.subject | Visibility graphs | en |
dc.subject | Complex networks | en |
dc.subject | Elsevier B.V. | en |
dc.title | Visibility in the topology of complex networks | en |
dc.type | journalArticle | en |
Ficheros en el ítem
Ficheros | Tamaño | Formato | Ver |
---|---|---|---|
No hay ficheros asociados a este ítem. |