Pasar al contenido principal

MAS ALLA DE LAS INTERACCIONES ENTRE PARES DE NODOS EN LAS REDES COMPLEJAS: TEORIA, EXPERIMENTOS Y APLICACIONES (BEPAINT)

PID2020-113737GB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2020
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD REY JUAN CARLOS

Resultados relacionados

Resultados totales (Incluyendo duplicados): 10
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

20 years of ordinal patterns: Perspectives and challenges

  • Leyva Callejas, Inmaculada
  • Martínez, Johann H.
  • Masoller, Cristina
  • Rosso, Osvaldo A.
  • Zanin, Massimiliano
In 2002, in a seminal article, Christoph Bandt and Bernd Pompe proposed a new methodology for the analysis of complex time series, now known as Ordinal Analysis. The ordinal methodology is based on the computation of symbols (known as ordinal patters) which are defined in terms of the temporal ordering of data points in a time series, and whose probabilities are known as ordinal probabilities. With the ordinal probabilities the Shannon entropy can be calculated, which is the permutation entropy. Since it was proposed, the ordinal method has found applications in fields as diverse as biomedicine and climatology. However, some properties of ordinal probabilities are still not fully understood, and how to combine the ordinal approach of feature extraction with machine learning techniques for model identification, time series classification or forecasting, remains a challenge. The objective of this perspective article is to present some recent advances and to discuss some open problems., C.M. acknowledges funding from the ICREA ACADEMIA program, Generalitat de Catalunya; M.Z. from the European Research Council (ERC) under grant agreement No 851255; M.Z. and J.M. from the Spanish State Research Agency through Grant MDM-2017-0711 funded by MCIN/AEI/10.13039/501100011033; I.L. from the Spanish State Research Agency through Grant PID2020-113737GB-I00., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Haros graphs: an exotic representation of real numbers

  • Calero-Sanz, Jorge
  • Luque, Bartolo
  • Lacasa, Lucas
This article 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 real 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 generalized 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 article with a number of conjectures and outline a research programme on Haros graphs., J.C. and B.L. acknowledge funding from Spanish Ministry of Science and Innovation under project M2505 (PID2020-113737GB-I00). L.L. acknowledges funding from projects DYNDEEP (EUR2021-122007), MISLAND (PID2020-114324GB-C22) and through the Severo Ochoa and María de Maeztu Program for Centers and Units of Excellence in R&D (MDM-2017-0711), all of them funded by the Spanish Ministry of Science and Innovation via AEI., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Haros graphs: an exotic representation of real numbers

  • Calero-Sanz, Jorge
  • Luque, Bartolo
  • Lacasa, Lucas
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., J.C. and B.L. acknowledge funding from Spanish Ministry of Science and Innovation under project M2505 (PID2020-113737GB-I00). L.L. acknowledges funding from projects DYNDEEP (EUR2021-122007), MISLAND (PID2020-114324GB-C22) and through the Severo Ochoa and María de Maeztu Program for Centers and Units of Excellence in R&D (MDM-2017-0711), all of them funded by the Spanish Ministry of Science and Innovation via AEI., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Chaotic renormalization group flow and entropy gradients over Haros graphs

  • Calero-Sanz, Jorge
  • Luque, Bartolo
  • Lacasa, Lucas
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 R over the set of Haros graphs. This operator was previously defined in the realm of graph-theoretical characterization of low-dimensional nonlinear dynamics and has a renormalization group (RG) structure. We find that the dynamics of R over Haros graphs is complex and includes unstable periodic orbits of arbitrary period and nonmixing aperiodic orbits, overall portraiting a chaotic RG flow. We identify a single RG stable fixed point whose basin of attraction is associated with the set of rational numbers, and find periodic RG orbits that relate to (pure) quadratic irrationals and aperiodic RG orbits, related with (nonmixing) families of nonquadratic algebraic irrationals and transcendental numbers. Finally, we show that the graph entropy of Haros graphs is globally decreasing as the RG flows towards its stable fixed point, albeit in a strictly nonmonotonic way, and that such graph entropy remains constant inside the periodic RG orbit associated to a subset of irrationals, the so-called metallic ratios. We discuss the possible physical interpretation of such chaotic RG flow and put results regarding entropy gradients along RG flow in the context of c-theorems., J.C. and B.L. acknowledge funding from project M2505 (PID2020-113737GB-I00) funded by MCIN/AEI/10.13039/501100011033. L.L. acknowledges funding from project MISLAND (PID2020-114324GB-C22) funded by MCIN/AEI/10.13039/501100011033, from project DYNDEEP (EUR2021-122007) funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”, and the María de Maeztu Project CEX2021-001164-M funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Chaotic renormalization group flow and entropy gradients over Haros graphs

  • Calero-Sanz, Jorge
  • Luque, Bartolo
  • Lacasa, Lucas
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 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 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., JC and BL acknowledge funding from Spanish Ministry of Science and Innovation under project M2505 (PID2020-113737GB-I00). LL acknowledges funding from project DYNDEEP (EUR2021-122007) and MISLAND (PID2020-114324GB-C22), both projects funded by the Spanish Ministry of Science and Innovation, and Severo Ochoa and Mar´ıa de Maeztu Program for Centers and Units of Excellence in R&D (MDM-2017-0711) funded by MCIN/AEI/10.13039/501100011033., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Identifiability of complex networks

  • Zanin, Massimiliano
  • Buldú, Javier M.
We discuss the core principles underpinning the concept of identifiability, providing an overview of relevant literature concerning this phenomenon within the domain of complex networks. We delve into the potentialities and inherent constraints associated with the analysis of identifiability in real networked systems. Through this exploration, we establish a comprehensive classification scheme for network identifiability, distinguishing i) structural, ii) functional, and iii) meta-identifiability categories. We explain the principal conceptual distinctions characterising each category. Finally, we deliberate upon the contextual frameworks where system identifiability can be achieved, also highlighting the factors that impede structural, functional, and meta-identifiability., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 851255). This work has been partially supported by the María de Maeztu project CEX2021-001164-M funded by the MCIN/AEI/10.13039/501100011033. JB is funded by Ministerio de Ciencia e Innovación (project PID2020-113737GB-I00)., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

On the complementarity of ordinal patterns-based entropy and time asymmetry metrics

  • Martínez, Johann H.
  • Ramasco, José J.
  • Zanin, Massimiliano
Entropy and time asymmetry are two intertwined aspects of a system's dynamics, with the production of entropy marking a clear direction in the temporal dimension. In the last few years, metrics to quantify both properties in time series have been designed around the same concept, i.e., the use of ordinal patterns. In spite of this, the relationship between these two families of metrics is yet not well understood. In this contribution, we study this problem by constructing an entropy-time asymmetry plane and evaluating it on a large set of synthetic and real-world time series. We show how the two metrics can at times behave independently, the main reason being the presence of patterns with turning points; due to this, they yield complementary information about the underlying systems, and they have different discriminating performance., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 851255). J.H.M. acknowledges funding from the project PID2020-113737GB-I00 of MCIN/AEI/10.13039/501100011033. J.J.R. acknowledges support from MCIN/AEI/10.13039/501100011033/FEDER/EU under project APASOS (PID2021-122256NB-C22). This work has been partially supported by the Maríia de Maeztu project CEX2021-001164-M funded by the MCIN/AEI/10.13039/501100011033., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., Peer reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

20 years of ordinal patterns: perspectives and challenges

  • Leyva Callejas, Inmaculada
  • Martínez, Johann H.
  • Masoller Alonso, Cristina|||0000-0003-0768-2019
  • Rosso, Osvaldo A.
  • Zanin, Massimiliano
In 2002, in a seminal article, Bandt and Pompe proposed a new methodology for the analysis of complex time series, now known as Ordinal Analysis. The ordinal methodology is based on the computation of symbols (known as ordinal patters) which are defined in terms of the temporal ordering of data points in a time series, and whose probabilities are known as ordinal probabilities. With the ordinal probabilities the Shannon entropy can be calculated, which is the permutation entropy. Since it was proposed, the ordinal method has found applications in fields as diverse as biomedicine and climatology. However, some properties of ordinal probabilities are still not fully understood, and how to combine the ordinal approach of feature extraction with machine learning techniques for model identification, time series classification or forecasting, remains a challenge. The objective of this perspective article is to present some recent advances and to discuss some open problems., The authors acknowledge hospitality of the Max Planck Institute for the Physics of Complex Systems, where a collaboration was established and this work started. C.M. acknowledges funding from the ICREA ACADEMIA pro- gram, Generalitat de Catalunya; M.Z. from the Euro- pean Research Council (ERC) under grant agreement No 851255; MZ and JHM. from the Spanish State Re- search Agency through Grant MDM-2017-0711 funded by MCIN/AEI/10.13039/501100011033; I.L. from the Spanish State Research Agency through Grant PID2020- 113737GB-I00. JHM acknowledges J. M. Buldú for valu- able comments and J. J. Ramasco for his assistance., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

20 years of ordinal patterns: perspectives and challenges

  • Leyva Callejas, Inmaculada
  • Martínez, Johann H.
  • Masoller Alonso, Cristina
  • Rosso, Osvaldo A.
  • Zanin, Massimiliano
In 2002, in a seminal article, Bandt and Pompe proposed a new methodology for the analysis of complex time series, now known as Ordinal Analysis. The ordinal methodology is based on the computation of symbols (known as ordinal patters) which are defined in terms of the temporal ordering of data points in a time series, and whose probabilities are known as ordinal probabilities. With the ordinal probabilities the Shannon entropy can be calculated, which is the permutation entropy. Since it was proposed, the ordinal method has found applications in fields as diverse as biomedicine and climatology. However, some properties of ordinal probabilities are still not fully understood, and how to combine the ordinal approach of feature extraction with machine learning techniques for model identification, time series classification or forecasting, remains a challenge. The objective of this perspective article is to present some recent advances and to discuss some open problems., The authors acknowledge hospitality of the Max Planck Institute for the Physics of Complex Systems, where a collaboration was established and this work started. C.M. acknowledges funding from the ICREA ACADEMIA pro- gram, Generalitat de Catalunya; M.Z. from the Euro- pean Research Council (ERC) under grant agreement No 851255; MZ and JHM. from the Spanish State Re- search Agency through Grant MDM-2017-0711 funded by MCIN/AEI/10.13039/501100011033; I.L. from the Spanish State Research Agency through Grant PID2020- 113737GB-I00. JHM acknowledges J. M. Buldú for valu- able comments and J. J. Ramasco for his assistance., Peer Reviewed, Postprint (author's final draft)
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Cooperation, satisfaction, and decision uncertainty in social games on complex networks with aspiration-driven players

  • Aguilar Janita, Miguel
  • Khalil Rodriguez, Nagi|||0000-0002-4579-8496
  • Leyva, Inmaculada
  • Sendiña Nadal, Irene
A network model based on players' aspirations is proposed and analyzed theoretically and numerically within the framework of evolutionary game theory. In this model, players decide whether to cooperate or defect by comparing their payoffs from pairwise games with their neighbors, driven by a common aspiration level. The model also incorporates a degree of stochasticity, or decision noise, through an effective temperature in the Fermi function. The level of cooperation in the system is fundamentally influenced by two social attributes: satisfaction, defined as the fraction of players whose payoffs exceed the aspiration level, and the degree of noise in decision-making. Deterministic players tend to maintain their initial strategies for sufficiently low aspiration levels, while the presence of noise promotes a state of perfect coexistence, resulting in half of the agents cooperating. The transition between these two behaviors can be critical, often leading to abrupt changes in cooperation levels. When the aspiration level is high, all players become dissatisfied, regardless of the effective temperature. Intermediate levels of aspiration lead to diverse behaviors, including sudden transitions for deterministic agents and a non-monotonic relationship between cooperation and noise intensity. The study also carefully examines the effects of the interaction structure, initial conditions, and the strategy update rule (asynchronous versus synchronous). Special attention is given to the prisoner?s dilemma, where significant cooperation levels can be achieved in a structured environment, with moderate aspiration and low decision noise intensity, and following a synchronous strategy updating scheme., Ministerio de Ciencia e Innovación, Community of Madrid Young Researchers program in R&D, European Regional Development Fund