Pasar al contenido principal

Resultados relacionados

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

Addi. Archivo Digital para la Docencia y la Investigación
Publicación Artículo científico (JournalArticle)

Lyapunov exponents for temporal networks

  • Caligiuri, A.
  • Eguíluz, V.M.
  • Di Gaetano, L.
  • Galla, T.
  • Lacasa, L.
By interpreting a temporal network as a trajectory of a latent graph dynamical system, we introduce the concept of dynamical instability of a temporal network and construct a measure to estimate the network maximum Lyapunov exponent (nMLE) of a temporal network trajectory. Extending conventional algorithmic methods from nonlinear time-series analysis to networks, we show how to quantify sensitive dependence on initial conditions and estimate the nMLE directly from a single network trajectory. We validate our method for a range of synthetic generative network models displaying low- and high-dimensional chaos and finally discuss potential applications., We thank Federico Battiston for helpful comments on initial phases of this research, and Emilio Hernández-Fernández, Sandro Meloni, Lluis Arola-Fernández, Ernesto Estrada, Massimiliano Zanin, Diego Pazó, and Juan Manuel López for helpful discussions around several aspects of the work. A.C. acknowledges funding by the Maria de Maeztu Programme (MDM-2017-0711) and the AEI under the FPI programme. T.G. acknowledges support from the AEI and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project APASOS (PID2021-122256NB-C21/PID2021-122256NB-C22). L.L. acknowledges funding from project DYNDEEP (No. EUR2021-122007), and L.L. and V.M.E. acknowledge funding from project MISLAND (No. PID2020-114324GB-C22), both projects funded by MCIN/AEI/10.13039/501100011033. This work has been partially supported by the María de Maeztu Project No. CEX2021-001164-M funded by MCIN/AEI/10.13039/501100011033.
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)

Lyapunov exponents for temporal networks

  • Caligiuri, Annalisa
  • Eguíluz, Víctor M.
  • Di Gaetano, Leonardo
  • Galla, Tobias
  • Lacasa, Lucas
By interpreting a temporal network as a trajectory of a latent graph dynamical system, we introduce the concept of dynamical instability of a temporal network and construct a measure to estimate the network maximum Lyapunov exponent (nMLE) of a temporal network trajectory. Extending conventional algorithmic methods from nonlinear time-series analysis to networks, we show how to quantify sensitive dependence on initial conditions and estimate the nMLE directly from a single network trajectory. We validate our method for a range of synthetic generative network models displaying low- and high-dimensional chaos and finally discuss potential applications., A.C. acknowledges funding by the Maria de Maeztu Programme (MDM-2017-0711) and the AEI under the FPI programme. T.G. acknowledges support from the AEI and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project APASOS (PID2021-122256NB-C21/PID2021-122256NB-C22). L.L. acknowledges funding from project DYNDEEP (No. EUR2021-122007), and L.L. and V.M.E. acknowledge funding from project MISLAND (No. PID2020-114324GB-C22), both projects funded by MCIN/AEI/10.13039/501100011033. This work has been partially supported by the María de Maeztu Project No. CEX2021-001164-M funded by MCIN/AEI/10.13039/501100011033., 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)

Lyapunov Exponents for Temporal Networks

  • Caligiuri, Annalisa
  • Eguíluz, Víctor M.
  • Di Gaetano, Leonardo
  • Galla, Tobias
  • Lacasa, Lucas
By interpreting a temporal network as a trajectory of a latent graph dynamical system, we introduce the concept of dynamical instability of a temporal network, and construct a measure to estimate the network Maximum Lyapunov Exponent (nMLE) of a temporal network trajectory. Extending conventional algorithmic methods from nonlinear time-series analysis to networks, we show how to quantify sensitive dependence on initial conditions, and estimate the nMLE directly from a single network trajectory. We validate our method for a range of synthetic generative network models displaying low and high dimensional chaos, and finally discuss potential applications., AC acknowledges funding by the Maria de Maeztu Programme (MDM-2017-0711) and the AEI under the FPI programme. LL acknowledges funding from project DYNDEEP (EUR2021-122007), and LL and VME acknowledge funding from project MISLAND (PID2020-114324GB-C22), both projects funded by the Spanish Ministry of Science and Innovation. This work has been partially supported by the Mar´ıa de Maeztu project CEX2021-001164-M. funded by MCIN/AEI/10.13039/501100011033., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Network bypasses sustain complexity

  • Estrada, Ernesto
  • Gómez-Gardeñes, Jesús
  • Lacasa, Lucas
Real-world networks are neither regular nor random, a fact elegantly explained by mechanisms such as the Watts–Strogatz or the Barabási-Albert models, among others. Both mechanisms naturally create shortcuts and hubs, which while enhancing the network’s connectivity, also might yield several undesired navigational effects: They tend to be overused during geodesic navigational processes—making the networks fragile—and provide suboptimal routes for diffusive-like navigation. Why, then, networks with complex topologies are ubiquitous? Here, we unveil that these models also entropically generate network bypasses: alternative routes to shortest paths which are topologically longer but easier to navigate. We develop a mathematical theory that elucidates the emergence and consolidation of network bypasses and measure their navigability gain. We apply our theory to a wide range of real-world networks and find that they sustain complexity by different amounts of network bypasses. At the top of this complexity ranking we found the human brain, which points out the importance of these results to understand the plasticity of complex systems., E.E. acknowledges funding from project OLGRA (PID2019-107603GB-I00) funded by Spanish Ministry of Science and Innovation. J.G.-G. acknowledges financial support from the Departamento de Industria e Innovación del Gobierno de Aragón y Fondo Social Europeo (FENOL group grant E36-23R) and from project PID2020-113582GB-I00 funded by the Spanish Ministry of Science and Innovation. L.L. acknowledges funding from project DYNDEEP (EUR2021-122007) and project MISLAND (PID2020-114324GB-C22), both projects funded by Spanish Ministry of Science and Innovation. This work has also been partially supported by the Maria 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
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Higher-order correlations reveal complex memory in temporal hypergraphs

  • Gallo, Luca
  • Lacasa, Lucas
  • Latora, Vito
  • Battiston, Federico
Many real-world complex systems are characterized by interactions in groups that change in time. Current temporal network approaches, however, are unable to describe group dynamics, as they are based on pairwise interactions only. Here, we use time-varying hypergraphs to describe such systems, and we introduce a framework based on higher-order correlations to characterize their temporal organization. The analysis of human interaction data reveals the existence of coherent and interdependent mesoscopic structures, thus capturing aggregation, fragmentation and nucleation processes in social systems. We introduce a model of temporal hypergraphs with non-Markovian group interactions, which reveals complex memory as a fundamental mechanism underlying the emerging pattern in the data., L.G. and F.B. acknowledge support from the Air Force Office of Scientific Research under award number FA8655-22-1-7025. L.L. acknowledges funding from the Spanish Research Agency MCIN/AEI/10.13039/501100011033 via projects DYNDEEP (EUR2021-122007), MISLAND (PID2020-114324GB-C22), and the María de Maeztu project CEX2021-001164-M. V.L. acknowledges support from the European Union, NextGenerationEU, GRINS project (GRINS PE00000018 - CUP E63C22002120006)., 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)

Higher-order correlations reveal complex memory in temporal hypergraphs

  • Gallo, Luca
  • Lacasa, Lucas
  • Latora, Vito
  • Battiston, Federico
Many real-world complex systems are characterized by interactions in groups that change in time. Current temporal network approaches, however, are unable to describe group dynamics, as they are based on pairwise interactions only. Here, we use time-varying hypergraphs to describe such systems, and we introduce a framework based on higher-order correlations to characterize their temporal organization. We analyze various social systems, finding that groups of different sizes have typical patterns of long-range temporal correlations. Moreover, our method reveals the presence of non-trivial temporal interdependencies between different group sizes. We introduce a model of temporal hypergraphs with non-Markovian group interactions, which reveals complex memory as a fundamental mechanism underlying the pattern in the data., L.G. and F.B. acknowledge support from the Air Force Office of Scientific Research under award number FA8655-22-1-7025. L.L. acknowledges funding from the Spanish Research Agency (AEI) via projects DYNDEEP (EUR2021-122007), MISLAND (PID2020-114324GB-C22), and the Mar´ıa de Maeztu project CEX2021-001164-M., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

An effective theory of collective deep learning

  • Longhi, Stefano
Unraveling the emergence of collective learning in systems of coupled artificial neural networks points to broader implications for machine learning, neuroscience, and society. Here we introduce a minimal model that condenses several recent decentralized algorithms by considering a competition between two terms: the local learning dynamics in the parameters of each neural network unit, and a diffusive coupling among units that tends to homogenize the parameters of the ensemble. We derive an effective theory for linear networks to show that the coarse-grained behavior of our system is equivalent to a deformed Ginzburg-Landau model with quenched disorder. This framework predicts depth-dependent disorder-order-disorder phase transitions in the parameters’ solutions that reveal a depth-delayed onset of a collective learning phase and a low-rank microscopic learning path. We validate the theory in coupled ensembles of realistic neural networks trained on the MNIST dataset under privacy constraints. Interestingly, experiments confirm that individual networks –trained on private data– can fully generalize to unseen data classes when the collective learning phase emerges. Our work establishes the physics of collective learning and contributes to the mechanistic interpretability of deep learning in decentralized settings., We acknowledge funding from project DYN-DEEP (EUR2021-122007) from the Agencia Estatal de Investigación MCIN/AEI/10.13039/501100011033. LL additionally acknowledges funding from project MISLAND (PID2020-114324GB-C22), and María de Maeztu project CEX2021-001164-M., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Dynamical stability and chaos in artificial neural network trajectories along training

  • Danovski, Kaloyan
  • Soriano, Miguel C.
  • Lacasa, Lucas
29 pages, 18 figures, The process of training an artificial neural network involves iteratively adapting its parameters so as to minimize the error of the network's prediction, when confronted with a learning task. This iterative change can be naturally interpreted as a trajectory in network space -- a time series of networks -- and thus the training algorithm (e.g. gradient descent optimization of a suitable loss function) can be interpreted as a dynamical system in graph space. In order to illustrate this interpretation, here we study the dynamical properties of this process by analyzing through this lens the network trajectories of a shallow neural network, and its evolution through learning a simple classification task. We systematically consider different ranges of the learning rate and explore both the dynamical and orbital stability of the resulting network trajectories, finding hints of regular and chaotic behavior depending on the learning rate regime. Our findings are put in contrast to common wisdom on convergence properties of neural networks and dynamical systems theory. This work also contributes to the cross-fertilization of ideas between dynamical systems theory, network theory and machine learning., We acknowledge funding from the Spanish Research Agency MCIN/AEI/10.13039/501100011033 via projects DYNDEEP (EUR2021-122007), MISLAND (PID2020-114324GB-C22), INFOLANET (PID2022-139409NB-I00) and the María de Maeztu project CEX2021-001164-M., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

On the structure of species-function participation in multilayer ecological networks

  • Hervías-Parejo, Sandra
  • Cuevas-Blanco, Mar
  • Lacasa, Lucas
  • Traveset, Anna
  • Donoso, Isabel
  • Heleno, Rubén H.
  • Nogales, Manuel
  • Rodríguez-Echeverría, Susana
  • Melián, Carlos J.
  • Eguíluz, Víctor M.
Understanding how biotic interactions shape ecosystems and impact their functioning, resilience and biodiversity has been a sustained research priority in ecology. Yet, traditional assessments of ecological complexity typically focus on species-species interactions that mediate a particular function (e.g., pollination), overlooking both the synergistic effect that multiple functions might develop as well as the resulting species-function participation patterns that emerge in ecosystems that harbor multiple ecological functions. Here we propose a mathematical framework that integrates various types of biotic interactions observed between different species. Its application to recently collected data of an islet ecosystem—reporting 1537 interactions between 691 plants, animals and fungi across six different functions (pollination, herbivory, seed dispersal, decomposition, nutrient uptake, and fungal pathogenicity)—unveils a non-random, nested structure in the way plant species participate across different functions. The framework further allows us to identify a ranking of species and functions, where woody shrubs and fungal decomposition emerge as keystone actors whose removal have a larger-than-random effect on secondary extinctions. The dual insight—from species and functional perspectives—offered by the framework opens the door to a richer quantification of ecosystem complexity and to better calibrate the influence of multifunctionality on ecosystem functioning and biodiversity., We thank Xavier Canyelles, that identified all insects; José Antonio Morillo, that contributed to the bioinformatic analysis of plant-fungus interactions; Aarón González-Castro and Juan Pedro González-Varo for their help in the field; Araceli Guillem Bosch for her help in the laboratory processing of pollen samples and M.A. Muñoz for his feedback on Ref. 74. S.H-P. acknowledges funding from the Balearic Government via project PD/004/2019. M.C.B., L.L., and V.M.E. acknowledge funding from the Spanish Research Agency (MICIU/AEI/10.13039/501100011033) via project MISLAND (PID2020-114324GB-C22), the María de Maeztu project CEX2021-001164-M and project DYNDEEP (EUR2021-122007). C.J.M. acknowledges funding from the María Zambrano fellowship. A.T. acknowledges funding by MICIU/AEI/10.13039/501100011033 (CGL2017-88122-P, PID2020-114324GB-C21) and the María de Maeztu project CEX2021-001198-M. The study is also framed within project 101054177 IslandLife funded by ERC AdG to A.T. I.D was supported by a Marie Curie Postdoctoral Fellowship (HORIZON-TMA-MSCA-101068643). R.H. was funded by the Portuguese Foundation for Science and Technology (UID/BIA/04004/2020)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Effective theory of collective deep learning

  • Arola-Fernández, Lluís
  • Lacasa, Lucas
Unraveling the emergence of collective learning in systems of coupled artificial neural networks points to broader implications for physics, machine learning, neuroscience, and society. Here we introduce a minimal model of interacting deep neural nets that condenses several recent decentralized algorithms by considering a competition between two terms: the local learning dynamics in the parameters of each neural network unit, and a diffusive coupling among units that tends to homogenize the parameters of the ensemble. We derive an effective theory for linear networks to show that the coarse-grained behavior of our system is equivalent to a deformed Ginzburg-Landau model with quenched disorder. This framework predicts depth-dependent disorder-order-disorder phase transitions in the parameters' solutions that reveal a depth-delayed onset of a collective learning phase and a low-rank microscopic learning path. We validate the theory in coupled ensembles of realistic neural networks trained on MNIST and CIFAR-10 datasets under privacy constraints. Interestingly, experiments confirm that individual networks-trained on private data-can fully generalize to unseen data classes when the collective learning phase emerges. Our work elucidates the physics of collective learning and contributes to the mechanistic interpretability of deep learning in decentralized settings., This work has been funded by the Spanish State Research Agency, through projects DYNDEEP, MISLAND and a María de Maeztu project (EUR2021- 122007, PID2020-114324GB-C22 and CEX2021-001164-M, respectively), funded by the MICIU/AEI/10.13039/501100011033. The authors also acknowledge the support from the European Commission Chips Joint Undertaking Project No. 101194363 (NEHIL)., 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)

Understanding following patterns among high-performance athletes

  • Rodríguez-García, Jorge Pablo
  • Arola-Fernández, Lluís
Professional sport enhances social interaction among athletes through meetings such as training groups, large-scale competitions and sponsored events. Among these, the Olympic Games represent the largest international competition, having a unique global impact. This event is assumed to promote international cooperation through the values of sport, becoming an opportunity for creating global connections between athletes. Here we want to understand the properties of the following activity, an indicator of the information flows, between highly successful Olympic athletes both at microscopic and macroscopic scales. To do so, we built a database including the Twitter usernames of Olympic medallists in Tokyo 2020, using it for creating the follower-followee network, a directed network representing who followed whom in this social network. From our database of 1052 athletes, we found 7326 connections among 964 athletes. The most popular athletes, those with highest number of followers, were Kevin Durant (basketball, USA), Allyson Felix (athletics, USA), Teddy Riner (judo, France), Alex Morgan (football, USA) and Simone Biles (gymnastics, USA). The macro-scale network structure displayed organized patterns related to microscopic—node—properties such as sex, country and sport, evidencing assortative connectivity patterns. These assortative patterns highlighted the need for a model quantifying the features’ importance in the followees choice, which we introduced through a gravity approach modelling the number of connections between homogeneous groups. Our research remarks the importance of datasets built from public exposure of professional athletes, serving as a proxy to investigate interesting aspects of many complex socio-cultural systems at different scales., J P R was supported by the Juan de la Cierva Formación program (Reference No. FJC2019-040622-I) funded by the Spanish Ministry of Science and Innovation, acknowledges funding from the Spanish Research Agency MCIN/AEI/10.13039/501100011033 via project MISLAND (PID2020-114324GB-C22), and by Govern de les Illes Balears through the Vicenç Mut program. L A F acknowledges funding from DYNDEEP (EUR2021-122007) from the Agencia Estatal de Investigación MCIN/AEI/10.13039/501100011033. This research was supported by María de Maeztu Excellence Unit 2023-2027 reference CEX2021-001164-M, funded by MCIN/AEI/ 10.13039/501100011033., 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)

Understanding following patterns among high-performance athletes

  • Rodríguez-García, Jorge Pablo
  • Arola-Fernández, Lluís
Professional sports enhance interaction among athletes through training groups, sponsored events and competitions. Among these, the Olympic Games represent the largest competition with a global impact, providing the participants with a unique opportunity for interaction. We studied the following patterns among highly successful athletes to understand the structure of their interactions. We used the list of Olympic medallists in the Tokyo 2020 Games to extract their follower-followee network in Twitter, finding 7,326 connections among 964 athletes. The network displayed frequent connections to similar peers in terms of their features including sex, country and sport. We quantified the influence of these features in the followees choice through a gravity approach capturing the number of connections between homogeneous groups. Our research remarks the importance of datasets built from public exposure of professional athletes, serving as a proxy to investigate interesting aspects of many complex socio-cultural systems at different scales., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

NAc-DBS selectively enhances memory updating without effect on retrieval

  • Pérez-Segura, Andrés
  • Medina, Jorge
  • Cerdán Cerdá, Antonio
  • Sánchez-Ferri, Cristina
  • Torres, Daniel
  • Mirasso, Claudio R.
  • Strange, Bryan
  • Eguíluz, Víctor M.
  • Lacasa, Lucas
  • Canals, Santiago
Deep brain stimulation (DBS) has emerged as a widely used therapeutic option when pharmacological treatments prove ineffective or refractory for psychiatric patients. The nucleus accumbens (NAc) represents a frequently targeted site in DBS interventions due to its demonstrated safety profile and therapeutic efficacy in obsessive-compulsive disorder, major depression, and anorexia nervosa. However, limited mechanistic understanding hampers its broader clinical applicability. This study sought to delineate the distinct behavioural dimensions modulated by NAc-DBS, its impact on distinct facets of memory, and to elucidate the underlying brain-network mechanism of action. We developed a novel spatial navigation task for rats and employed a high-dimensional behavioural analysis complemented by fMRI to dissect the cognitive, behavioural and neurobiological effects of NAc-DBS. Active NAc-DBS in male rats produced a selective enhancement of long-term memory encoding without affecting memory recall or working memory. We found a small but statistically significant rewarding effect of NAc-DBS, with no detectable impact on motor or stress-related behaviours. Sustained neuronal activation in the NAc, septum, entorhinal and insular cortex demonstrated no desensitisation to chronic NAc-DBS, which triggered a functional reorganisation among dopaminergic-related structures. These findings suggest that NAc-DBS induces a functional reorganisation in the mesocorticolimbic system, potentially mimicking a dopaminergic novelty signal to enhance memory updating. This provides a mechanistic basis for the therapeutic use of NAc-DBS, particularly in improving cognitive flexibility in psychiatric disorders., We acknowledge support from the Spanish Ministerio de Ciencia e Innovación, Agencia Estatal de Investigación PID2021-128158NB-C21 (SC), PRE2019-087450 (APS), DYNDEEP EUR2021-122007 (LL), MISLAND PID2020-114324GB-C22 (LL), PID2021-128158NB-C22 (CRM), funded by MICIU/AEI/10.13039/ 501100011033. We also acknowledge the Program for Centres of Excellence in R&D Severo Ochoa CEX2021-001165-S (SC, APS) and Maria de Maeztu project CEX2021-001164-M (LL, CRM, JM), Maria de Maeztu Excellence Unit MDM-2017-0711 (JM) funded by the MICIU/AEI/10.13039/501100011033., With funding from the Spanish government through the "Severo Ochoa Centre of Excelence" accreditation (CEX2021-001165-S), With funding from the Spanish government through the "María de Maeztu Unit of Excellence" accreditation (CEX2021-001164-M), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Towards certification: A complete statistical validation pipeline for supervised learning in industry

  • Lacasa, Lucas
  • Pardo, Abel
  • Arbelo, Pablo
  • Sánchez-Domínguez, Miguel
  • Bascones, Noelia
  • Yeste, Pablo
  • Martínez-Cava, Alejandro
  • Rubio, Gonzalo
  • Gómez, Ignacio
  • Valero, Eusebio
  • Vicente, Javier de
Machine and Deep Learning methods are gradually being integrated into industrial operations, although at different speeds for different types of industries. The aerospace and aeronautical industries have been recently pushing to develop a roadmap for concepts of design assurance and integration of neural network-related technologies in the aeronautical sector. Within such a roadmap, there is currently no clear definition of what would constitute a certifiable validation protocol for an industrial surrogate model. This paper aims to bridge this gap and contribute to the paradigm of AI-based certification in the context of supervised learning, by proposing a practical and comprehensible validation pipeline of a surrogate model that integrates concepts and methods from deep learning, mathematical optimization and statistical data science. This pipeline is represented as a directed graph of ten logical steps/nodes, incorporating both linear-sequential procedures and feedback loops to iteratively refine the surrogate model. Each of these logical steps solves specific machine learning problems by merging previously scattered key statistical methods with some novel algorithmic solutions. We provide details and best practices for each of the steps and we illustrate the application of this pipeline in a realistic supervised problem arising in aerostructural design: predicting the likelihood of different stress-related failure modes during different flight maneuvers based on a (large) set of features characterizing the aircraft internal loads and geometric parameters., UPM and Airbus have collaborated in the context of a working group established by Airbus as part of the project ONEiRE(P220021406) funded by the Spanish Research Agency Centro para el Desarrollo Tecnológico y la Innovación (CDTI), Spain. The authors also acknowledge funding from project TIFON (PLEC2023-010251) funded by MCIN/AEI/10.13039/501100011033/, Spain, and from projects DYNDEEP, Spain (EUR2021-122007), MISLAND, Spain (PID2020-114324GB-C22), and the María de Maeztu project CEX2021-001164-M (LL) also funded by MICIU/AEI/10.13039/501100011033, Spain ., With funding from the Spanish government through the "María de Maeztu Unit of Excellence" accreditation (CEX2021-001164-M), Peer reviewed