arXiv subjects

Bartolo Luque

Publications and source records attributed to Bartolo Luque.

At least 19 recordsLinked to original sources

arXiv2022

Chaotic renormalization group flow and entropy gradients over Haros graphs

Haros graphs have been recently introduced as a set of graphs bijectively related to real numbers in the unit interval. Here we consider the iterated dynamics of a graph operator $\cal R$ over the set of Haros graphs. This operator was previously defined in the realm of graph-theoretical characterisation of low-dimensional nonlinear dynamics, and has a renormalization group (RG) structure. We find that the dynamics of $\cal R$ over Haros graphs is complex and includes unstable periodic orbits or arbitrary period and non-mixing aperiodic orbits, overall portraiting a chaotic RG flow. We identify a single RG stable fixed point whose basin of attraction is the set of rational numbers, associate periodic RG orbits with (pure) quadratic irrationals and aperiodic RG orbits with (non-mixing) families of non-quadratic algebraic irrationals and trascendental numbers. Finally, we show that the entropy gradients inside periodic RG orbits are constant. We discuss the possible physical interpretation of such chaotic RG flow and speculate on the entropy-constant periodic orbits as a possible confirmation of a (quantum field-theoretic) $c$-theorem applied inside the invariant set of a RG flow.

cond-mat.stat-mech↗

arXiv2022

Haros graphs: an exotic representation of real numbers

This paper introduces Haros graphs, a construction which provides a graph-theoretical representation of real numbers in the unit interval reached via paths in the Farey binary tree. We show how the topological structure of Haros graphs yields a natural classification of the reals numbers into a hierarchy of families. To unveil such classification, we introduce an entropic functional on these graphs and show that it can be expressed, thanks to its fractal nature, in terms of a generalised de Rham curve. We show that this entropy reaches a global maximum at the reciprocal of the Golden number and otherwise displays a rich hierarchy of local maxima and minima that relate to specific families of irrationals (noble numbers) and rationals, overall providing an exotic classification and representation of the reals numbers according to entropic principles. We close the paper with a number of conjectures and outline a research programme on Haros graphs.

math.NT↗

arXiv2018

On a dynamical approach to some prime number sequences

In this paper we show how the cross-disciplinary transfer of techniques from Dynamical Systems Theory to Number Theory can be a fruitful avenue for research. We illustrate this idea by exploring from a nonlinear and symbolic dynamics viewpoint certain patterns emerging in some residue sequences generated from the prime number sequence. We show that the sequence formed by the residues of the primes modulo $k$ are maximally chaotic and, while lacking forbidden patterns, display a non-trivial spectrum of Renyi entropies which suggest that every block of size $m>1$, while admissible, occurs with different probability. This non-uniform distribution of blocks for $m>1$ contrasts Dirichlet's theorem that guarantees equiprobability for $m=1$. We then explore in a similar fashion the sequence of prime gap residues. This sequence is again chaotic (positivity of Kolmogorov-Sinai entropy), however chaos is weaker as we find forbidden patterns for every block of size $m>1$. We relate the onset of these forbidden patterns with the divisibility properties of integers, and estimate the densities of gap block residues via Hardy-Littlewood $k$-tuple conjecture. We use this estimation to argue that the amount of admissible blocks is non-uniformly distributed, what supports the fact that the spectrum of Renyi entropies is again non-trivial in this case. We complete our analysis by applying the Chaos Game to these symbolic sequences, and comparing the IFS attractors found for the experimental sequences with appropriate null models.

math.NT↗

arXiv2018

On the thermodynamic origin of metabolic scaling

The origin and shape of metabolic scaling has been controversial since Kleiber found that basal metabolic rate of animals seemed to vary as a power law of their body mass with exponent 3/4, instead of 2/3, as a surface-to-volume argument predicts. The universality of exponent 3/4 -claimed in terms of the fractal properties of the nutrient network- has recently been challenged according to empirical evidence that observed a wealth of robust exponents deviating from 3/4. Here we present a conceptually simple thermodynamic framework, where the dependence of metabolic rate with body mass emerges from a trade-off between the energy dissipated as heat and the energy efficiently used by the organism to maintain its metabolism. This balance tunes the shape of an additive model from which different effective scalings can be recovered as particular cases, thereby reconciling previously inconsistent empirical evidence in mammals, birds, insects and even plants under a unified framework. This model is biologically motivated, fits remarkably well the data, and also explains additional features such as the relation between energy lost as heat and mass, the role and influence of different climatic environments or the difference found between endotherms and ectotherms.

physics.bio-ph↗

arXiv2016

Emergence of linguistic laws in human voice

Linguistic laws constitute one of the quantitative cornerstones of modern cognitive sciences and have been routinely investigated in written corpora, or in the equivalent transcription of oral corpora. This means that inferences of statistical patterns of language in acoustics are biased by the arbitrary, language-dependent segmentation of the signal, and virtually precludes the possibility of making comparative studies between human voice and other animal communication systems. Here we bridge this gap by proposing a method that allows to measure such patterns in acoustic signals of arbitrary origin, without needs to have access to the language corpus underneath. The method has been applied to six different human languages, recovering successfully some well-known laws of human communication at timescales even below the phoneme and finding yet another link between complexity and criticality in a biological system. These methods further pave the way for new comparative studies in animal communication or the analysis of signals of unknown code.

physics.soc-ph↗

arXiv2016

Canonical Horizontal Visibility Graphs are uniquely determined by their degree sequence

Horizontal visibility graphs (HVGs) are graphs constructed in correspondence with number sequences that have been introduced and explored recently in the context of graph-theoretical time series analysis. In most of the cases simple measures based on the degree sequence (or functionals of these such as entropies over degree and joint degree distributions) appear to be highly informative features for automatic classification and provide nontrivial information on the associated dynam- ical process, working even better than more sophisticated topological metrics. It is thus an open question why these seemingly simple measures capture so much information. Here we prove that, under suitable conditions, there exist a bijection between the adjacency matrix of an HVG and its degree sequence, and we give an explicit construction of such bijection. As a consequence, under these conditions HVGs are unigraphs and the degree sequence fully encapsulates all the information of these graphs, thereby giving a plausible reason for its apparently unreasonable effectiveness.

physics.data-an↗

arXiv2016

Walking on exoplanets: Is Star Wars right?

As the number of detected extrasolar planets increases, exoplanet databases become a valuable resource, confirming some details about planetary formation, but also challenging our theories with new unexpected properties.

astro-ph.EP↗

arXiv2014

Speech earthquakes: scaling and universality in human voice

Speech 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.

physics.soc-ph↗

arXiv2013

Quasiperiodic graphs at the onset of chaos

We examine the connectivity fluctuations across networks obtained when the horizontal visibility (HV) algorithm is used on trajectories generated by nonlinear circle maps at the quasiperiodic transition to chaos. The resultant HV graph is highly anomalous as the degrees fluctuate at all scales with amplitude that increases with the size of the network. We determine families of Pesin-like identities between entropy growth rates and generalized graph-theoretical Lyapunov exponents. An irrational winding number with pure periodic continued fraction characterizes each family. We illustrate our results for the so-called golden, silver and bronze numbers.

nlin.CD↗

arXiv2013

Phase transitions in Number Theory: from the Birthday Problem to Sidon Sets

In this work, we show how number theoretical problems can be fruitfully approached with the tools of statistical physics. We focus on g-Sidon sets, which describe sequences of integers whose pairwise sums are different, and propose a random decision problem which addresses the probability of a random set of k integers to be g-Sidon. First, we provide numerical evidence showing that there is a crossover between satisfiable and unsatisfiable phases which converts to an abrupt phase transition in a properly defined thermodynamic limit. Initially assuming independence, we then develop a mean field theory for the g-Sidon decision problem. We further improve the mean field theory, which is only qualitatively correct, by incorporating deviations from independence, yielding results in good quantitative agreement with the numerics for both finite systems and in the thermodynamic limit. Connections between the generalized birthday problem in probability theory, the number theory of Sidon sets and the properties of q-Potts models in condensed matter physics are briefly discussed.

cond-mat.stat-mech↗

arXiv2013

Horizontal Visibility graphs generated by type-I intermittency

The type-I intermittency route to (or out of) chaos is investigated within the Horizontal Visibility graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct, according to the Horizontal Visibility algorithm, their associated graphs. We show how the alternation of laminar episodes and chaotic bursts has a fingerprint in the resulting graph structure. Accordingly, we derive a phenomenological theory that predicts quantitative values of several network parameters. In particular, we predict that the characteristic power law scaling of the mean length of laminar trend sizes is fully inherited in the variance of the graph degree distribution, in good agreement with the numerics. We also report numerical evidence on how the characteristic power-law scaling of the Lyapunov exponent as a function of the distance to the tangent bifurcation is inherited in the graph by an analogous scaling of the block entropy over the degree distribution. Furthermore, we are able to recast the full set of HV graphs generated by intermittent dynamics into a renormalization group framework, where the fixed points of its graph-theoretical RG flow account for the different types of dynamics. We also establish that the nontrivial fixed point of this flow coincides with the tangency condition and that the corresponding invariant graph exhibit extremal entropic properties.

nlin.CD↗

arXiv2013

Nestedness in mutualistic networks

James et al. (2012) presented simulations that apparently falsify the analytical result by Bastolla et al. (2009), who showed that nested mutualistic interactions decrease interspecific competition and increase biodiversity in model ecosystems. This contradiction, however, mainly stems from the incorrect application of formulas derived for fully connected networks to empirical, sparse networks.

q-bio.PE↗

arXiv2012

Feigenbaum graphs at the onset of chaos

We analyze the properties of the self-similar network obtained from the trajectories of unimodal maps at the transition to chaos via the horizontal visibility (HV) algorithm. We first show that this network is uniquely determined by the encoded sequence of positions in the dynamics within the Feigenbaum attractor and it is universal in that it is independent of the shape and nonlinearity of the maps in this class. We then find that the network degrees fluctuate at all scales with an amplitude that increases as the size of the network grows. This suggests the definition of a graph-theoretical Lyapunov exponent that measures the expansion rate of trajectories in network space. On good agreement with the map's counterpart, while at the onset of chaos this exponent vanishes, the subexponential expansion and contraction of network degrees can be fully described via a Tsallis-type scalar deformation of the expansion rate, that yields a discrete spectrum of non-null generalized exponents. We further explore the possibility of defining an entropy growth rate that describes the amount of information created along the trajectories in network space. Making use of the trajectory distributions in the map's accumulation point and the scaling properties of the associated network, we show that such entropic growth rate coincides with the spectrum of graph-theoretical exponents, what appears as a set of Pesin-like identities in the network.

nlin.CD↗

arXiv2012

Phase transition in the Countdown problem

Here we present a combinatorial decision problem, inspired by the celebrated quiz show called the countdown, that involves the computation of a given target number T from a set of k randomly chosen integers along with a set of arithmetic operations. We find that the probability of winning the game evidences a threshold phenomenon that can be understood in the terms of an algorithmic phase transition as a function of the set size k. Numerical simulations show that such probability sharply transitions from zero to one at some critical value of the control parameter, hence separating the algorithm's parameter space in different phases. We also find that the system is maximally efficient close to the critical point. We then derive analytical expressions that match the numerical results for finite size and permit us to extrapolate the behavior in the thermodynamic limit.

cond-mat.stat-mech↗

arXiv2012

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.

nlin.CD↗

arXiv2012

Analytical properties of horizontal visibility graphs in the Feigenbaum scenario

Time series are proficiently converted into graphs via the horizontal visibility (HV) algorithm, which prompts interest in its capability for capturing the nature of different classes of series in a network context. We have recently shown [1] that dynamical systems can be studied from a novel perspective via the use of this method. Specifically, the period-doubling and band-splitting attractor cascades that characterize unimodal maps transform into families of graphs that turn out to be independent of map nonlinearity or other particulars. Here we provide an in depth description of the HV treatment of the Feigenbaum scenario, together with analytical derivations that relate to the degree distributions, mean distances, clustering coefficients, etc., associated to the bifurcation cascades and their accumulation points. We describe how the resultant families of graphs can be framed into a renormalization group scheme in which fixed-point graphs reveal their scaling properties. These fixed points are then re-derived from an entropy optimization process defined for the graph sets, confirming a suggested connection between renormalization group and entropy optimization. Finally, we provide analytical and numerical results for the graph entropy and show that it emulates the Lyapunov exponent of the map independently of its sign.

physics.data-an↗

arXiv2011

Feigenbaum graphs: a complex network perspective of chaos

The recently formulated theory of horizontal visibility graphs transforms time series into graphs and allows the possibility of studying dynamical systems through the characterization of their associated networks. This method leads to a natural graph-theoretical description of nonlinear systems with qualities in the spirit of symbolic dynamics. We support our claim via the case study of the period-doubling and band-splitting attractor cascades that characterize unimodal maps. We provide a universal analytical description of this classic scenario in terms of the horizontal visibility graphs associated with the dynamics within the attractors, that we call Feigenbaum graphs, independent of map nonlinearity or other particulars. We derive exact results for their degree distribution and related quantities, recast them in the context of the renormalization group and find that its fixed points coincide with those of network entropy optimization. Furthermore, we show that the network entropy mimics the Lyapunov exponent of the map independently of its sign, hinting at a Pesin-like relation equally valid out of chaos.

nlin.CD↗

arXiv2011

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.

physics.data-an↗