Analysis of properties of Ising and Kuramoto models that are preserved in networks constructed by visualization algorithms.

Recently it has been shown that building networks from time series allows to study complex systems to characterize them when they go through a phase transition. This give us the opportunity to study this systems from a entire new point of view. In the present work we have used the natural and horizontal visualization algorithms to built networks of two popular models, which present phase transitions: the Ising model and the Kuramoto model. By measuring some topological quantities as the average degree, or the clustering coefficient, it was found that the networks retain the capability of detecting the phase transition of the system. From our results it is possible to establish that both visibility algorithms are capable of detecting the critical control parameter, as in every quantity analyzed (the average degree, the average path and the clustering coefficient) there is a minimum or a maximum value. In the case of the natural visualization algorithm, the average path results are much more noisy than in the other quantities in the study. Specially for the Kuramoto Model, which in this case does not allow a detection of the critical point at plain sight as for the other quantities. The horizontal visualization algorithm has proven to be more explicit in every quantity, as every one of them show a clear change of behavior before and after the critical point of the transition.