Quasiperiodic graphs: structural design, scaling and entropic properties

A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions represented by the Farey tree is inherited by their associated graphs. We are able to establish, via Renormalization Group (RG) theory, the architecture of the quasiperiodic graphs produced by irrational winding numbers with pure periodic continued fraction. And finally, we demonstrate that the RG fixed-point degree distributions are recovered via optimization of a suitably defined graph entropy

Speech earthquakes: scaling and universality in human voice

Submitted for publicationSubmitted for publicationSpeech is a distinctive complex feature of human capabilities. In order to understand the physics underlying speech production, in this work we empirically analyse the statistics of large human speech datasets ranging several languages. We first show that during speech the energy is unevenly released and power-law distributed, reporting a universal robust Gutenberg-Richter-like law in speech. We further show that such earthquakes in speech show temporal correlations, as the interevent statistics are again power-law distributed. Since this feature takes place in the intra-phoneme range, we conjecture that the responsible for this complex phenomenon is not cognitive, but it resides on the physiological speech production mechanism. Moreover, we show that these waiting time distributions are scale invariant under a renormalisation group transformation, suggesting that the process of speech generation is indeed operating close to a critical point. These results are put in contrast with current paradigms in speech processing, which point towards low dimensional deterministic chaos as the origin of nonlinear traits in speech fluctuations. As these latter fluctuations are indeed the aspects that humanize synthetic speech, these findings may have an impact in future speech synthesis technologies. Results are robust and independent of the communication language or the number of speakers, pointing towards an universal pattern and yet another hint of complexity in human speech

Macroporous materials: microfluidic fabrication, functionalization and applications

This article provides an up-to-date highly comprehensive overview (594 references) on the state of the art of the synthesis and design of macroporous materials using microfluidics and their applications in different fields

Parlar la ciutat.

Reseña de: Topología del espacio urbano. Palabras, imágenes y experiencias que definen la ciudad. Abada, Madrid, 2014

Detecting series periodicity with horizontal visibility graphs

The horizontal visibility algorithm has been recently introduced as a mapping between time series and networks. The challenge lies in characterizing the structure of time series (and the processes that generated those series) using the powerful tools of graph theory. Recent works have shown that the visibility graphs inherit several degrees of correlations from their associated series, and therefore such graph theoretical characterization is in principle possible. However, both the mathematical grounding of this promising theory and its applications are on its infancy. Following this line, here we address the question of detecting hidden periodicity in series polluted with a certain amount of noise. We first put forward some generic properties of horizontal visibility graphs which allow us to define a (graph theoretical) noise reduction filter. Accordingly, we evaluate its performance for the task of calculating the period of noisy periodic signals, and compare our results with standard time domain (autocorrelation) methods. Finally, potentials, limitations and applications are discussed.Comment: To be published in International Journal of Bifurcation and Chao

Highest weight Macdonald and Jack Polynomials

Fractional quantum Hall states of particles in the lowest Landau levels are described by multivariate polynomials. The incompressible liquid states when described on a sphere are fully invariant under the rotation group. Excited quasiparticle/quasihole states are member of multiplets under the rotation group and generically there is a nontrivial highest weight member of the multiplet from which all states can be constructed. Some of the trial states proposed in the literature belong to classical families of symmetric polynomials. In this paper we study Macdonald and Jack polynomials that are highest weight states. For Macdonald polynomials it is a (q,t)-deformation of the raising angular momentum operator that defines the highest weight condition. By specialization of the parameters we obtain a classification of the highest weight Jack polynomials. Our results are valid in the case of staircase and rectangular partition indexing the polynomials.Comment: 17 pages, published versio

Chaos control in random Boolean networks by reducing mean damage percolation rate

Chaos control in Random Boolean networks is implemented by freezing part of the network to drive it from chaotic to ordered phase. However, controlled nodes are only viewed as passive blocks to prevent perturbation spread. This paper proposes a new control method in which controlled nodes can exert an active impact on the network. Controlled nodes and frozen values are deliberately selected according to the information of connection and Boolean functions. Simulation results show that the number of nodes needed to achieve control is largely reduced compared to previous method. Theoretical analysis is also given to estimate the least fraction of nodes needed to achieve control.Comment: 10 pages, 2 figure

Time series irreversibility: a visibility graph approach

We propose a method to measure real-valued time series irreversibility which combines two differ- ent tools: the horizontal visibility algorithm and the Kullback-Leibler divergence. This method maps a time series to a directed network according to a geometric criterion. The degree of irreversibility of the series is then estimated by the Kullback-Leibler divergence (i.e. the distinguishability) between the in and out degree distributions of the associated graph. The method is computationally effi- cient, does not require any ad hoc symbolization process, and naturally takes into account multiple scales. We find that the method correctly distinguishes between reversible and irreversible station- ary time series, including analytical and numerical studies of its performance for: (i) reversible stochastic processes (uncorrelated and Gaussian linearly correlated), (ii) irreversible stochastic pro- cesses (a discrete flashing ratchet in an asymmetric potential), (iii) reversible (conservative) and irreversible (dissipative) chaotic maps, and (iv) dissipative chaotic maps in the presence of noise. Two alternative graph functionals, the degree and the degree-degree distributions, can be used as the Kullback-Leibler divergence argument. The former is simpler and more intuitive and can be used as a benchmark, but in the case of an irreversible process with null net current, the degree-degree distribution has to be considered to identifiy the irreversible nature of the series.Comment: submitted for publicatio

The Visibility Graph: a new method for estimating the Hurst exponent of fractional Brownian motion

Fractional Brownian motion (fBm) has been used as a theoretical framework to study real time series appearing in diverse scientific fields. Because its intrinsic non-stationarity and long range dependence, its characterization via the Hurst parameter H requires sophisticated techniques that often yield ambiguous results. In this work we show that fBm series map into a scale free visibility graph whose degree distribution is a function of H. Concretely, it is shown that the exponent of the power law degree distribution depends linearly on H. This also applies to fractional Gaussian noises (fGn) and generic f^(-b) noises. Taking advantage of these facts, we propose a brand new methodology to quantify long range dependence in these series. Its reliability is confirmed with extensive numerical simulations and analytical developments. Finally, we illustrate this method quantifying the persistent behavior of human gait dynamics.Comment: 5 pages, submitted for publicatio

Morfología polínica de las especies de cítricos cultivadas en Andalucía occidental (España)

. Morfología polínica de las especies de cítricos cultivadas en Andalucía occidental (España). Se estudia la morfología polínica de seis especies de cítricos de los géneros Citrus (C. aurantium, C. deliciosa, C. grandis, C. limon y C. sinensis) y Fortunella (F. margarita), con los microscopios óptico y electrónico de barrido. Por los caracteres estudiados (polaridad, simetría, contorno (en visión ecuatorial y corte óptico meridiano y visión polar y corte ecuatorial), tamaño, número, tipo y dimensiones de las aberturas, grosor de la exina y ornamentación) se describe la morfología del polen y se discuten los resultados obtenidos.No es posible la separación de los dos géneros, pero se pueden diferenciar parte de las especies del género Citrus