Fernando J. Ballesteros

TL;DR: A simple and fast computational method, the visibility algorithm, that converts a time series into a graph, which inherits several properties of the series in its structure, enhancing the fact that power law degree distributions are related to fractality.

TL;DR: The horizontal visibility algorithm as mentioned in this paper is a geometrically simpler and analytically solvable version of our former algorithm, focusing on the mapping of random series series of independent identically distributed random variables.

TL;DR: This work presents the horizontal visibility algorithm, a geometrically simpler and analytically solvable version of the former algorithm, focusing on the mapping of random series (series of independent identically distributed random variables), and presents exact results on the topological properties of graphs associated with random series, namely, the degree distribution, the clustering coefficient, and the mean path length.

TL;DR: In this article, it was shown that a much better precision is sufficient to obtain photometric redshifts with enough precision (? z ) to measure BAOs along the line of sight, while a much worse precision will result in the effective loss of the radial information.

TL;DR: In this article, it was shown that a precision of sigma_z ~ 0.003(1 + z) is sufficient to measure BAO in the radial direction for bright, red galaxies, by using a filter system comprising about 40 filters, each with a width of ~100 A, from 4000 A to ~ 8000 A, supplemented by two broad-band filters.