Pasar al contenido principal

ANALISIS DE INTERACCIONES SOCIALES Y TECNOLOGICAS DESDE LA PERSPECTIVA DE LOS SISTEMAS COMPLEJOS (COSASTI)

PID2024-157493NB-C22

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para la Investigación y el Desarrollo Experimental
Subprograma Subprograma Estatal de Generación de Conocimiento Científico-Técnico y Desarrollo Experimental
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2024
Plan Estatal 2024-2027 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)

Resultados relacionados

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

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

Anticipated synchronization in systems with distributed delay

  • Ortiz del Campo, David
  • Galla, Tobias
  • Toral, Raúl
Anticipated synchronization occurs when a driven dynamical system synchronizes with the future state of the driver system to which it is unidirectionally coupled. Previous theoretical and experimental studies have focused on setups with a single delay time in the coupling term, for which exact anticipation can arise as a solution. Here we extend this framework to configurations with distributed delay times. Our main result is that, for a given delay distribution, approximate anticipated synchronization can emerge over a range of coupling strengths. We analyse this phenomenon analytically for systems of linear oscillators, where we identify simple cases exhibiting projective anticipated synchronization, i.e., regimes in which the state of the driven system reproduces a time-advanced version of the driver up to a multiplicative amplitude factor. Numerical simulations of nonlinear chaotic systems reveal stable forms of approximate anticipated synchronization., Partial financial support has been received from Grants PID2021-122256NB-C21/C22 and PID2024-157493NB-C21/C22 funded by MICIU/AEI/10.13039/501100011033 and by “ERDF/EU”, and the María de Maeztu Program for units of Excellence in R&D , grant CEX2021-001164-M., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Forecasting emergency department visits in the reference hospital of the Balearic Islands: The role of tourist and weather data

  • Crisafulli, Paride
  • Río Mangada, Ángel del
  • Segura Sampedro, Juan José
  • Mirasso, Claudio R.
  • Toral, Raúl
  • Galla, Tobias
Accurate forecasting of patient arrivals at emergency departments (EDs) is vital for efficient resource allocation and high-quality patient care. In this study we investigate the relevance of exogenous variables, namely tourism, weather, calendar and demographic variables, in forecasting ED visits in the reference hospital in Palma de Mallorca, a city with significant seasonal population fluctuations due to tourism. Using a machine learning approach, we develop a model that predicts ED visits based solely on these exogenous variables. We test different machine learning algorithms (random forests, support vector machines, and feedforward neural networks) with different combinations of input variables and compare their symmetric mean average percentage errors (SMAPEs). Our findings reveal that calendar information, resident, and tourist population data are statistically significant for the accuracy of the predictions, while the addition of weather data does not provide any further improvement. Comparison of non-time-series with time-series prediction models reveals that the latter provide better accuracy for short prediction horizons (e.g., shorter than a week). Furthermore, time-series models become less or equally accurate to models relying only on exogenous variables for long prediction horizons (e.g., fortnight or month). Our study highlights the importance of carefully selecting predictive variables to ensure short- and long-term, robust and reliable forecasts. This demonstrates that, despite their lower complexity, non-time-series models with well-chosen input variables can be as effective as time-series models when predicting for long time horizons., The project that gave rise to these results received the support of a fellowship from ``la Caixa″ Foundation (ID 100010434, https://lacaixafoundation.org/en/). The fellowship code is LCF/BQ/DI22/11940041. This is an award to PC. We are also grateful for partial financial support from the Agencia Estatal de Investigacion and Fondo Europeo de Desarrollo Regional (FEDER, UE) under projects ID PID2021-122256NB-C21, PID2024-157493NB-C21 (supporting RT) and PID2021-122256NB-C22, PID2024-157493NB-C22 (supporting TG), funded by MICIU/AEI/10.13039/501100011033 (https://www.ciencia.gob.es/en/), and the Maria de Maeztu program for Units of Excellence CEX2021-001164-M (supporting PC, CM, RT, TG), funded by MICIU/AEI/10.13039/501100011033 (https://www.ciencia.gob.es/en/, https://www.aei.gob.es/)., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Information-theoretic analysis of temporal dependence in discrete stochastic processes: Application to precipitation predictability

  • Gregorio, Juan de
  • Sánchez, David
  • Toral, Raúl
Understanding the temporal dependence of precipitation is key to improving weather predictability and developing efficient stochastic rainfall models. We introduce an information-theoretic approach to quantify memory effects in discrete stochastic processes and apply it to daily precipitation records across the contiguous United States. The method is based on the predictability gain, a quantity derived from block entropy that measures the additional information provided by higher-order temporal dependencies. This statistic, combined with a bootstrap-based hypothesis testing and Fisher’s method, enables a robust memory estimator from finite data. Tests with generated sequences show that this estimator outperforms other model-selection criteria such as Akaike information criterion and Bayesian information criterion. Applied to precipitation data, the analysis reveals that daily rainfall occurrence is well described by low-order Markov chains, exhibiting regional and seasonal variations, with stronger correlations in winter along the West Coast and in summer in the Southeast, consistent with known climatological patterns. Overall, our findings establish a framework for building parsimonious stochastic descriptions, useful when addressing spatial heterogeneity in the memory structure of precipitation dynamics and support further advances in real-time, data-driven forecasting schemes., Partial financial support has been received from Grant Nos. PID2021-122256NB-C21/C22 and PID2024-157493NB-C21/C22 funded by MICIU/AEI/10.13039/501100011033 and “ERDF/EU” and by the María de Maeztu Program for units of Excellence in R&D, Grant No. CEX2021-001164-M., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Numerical methods for quasi-stationary distributions

  • Oliver-Bonafoux, Sara
  • Aguilar, Javier
  • Galla, Tobias
In stochastic processes with absorbing states, the quasi-stationary distribution provides valuable insights into the long-term behavior prior to absorption. In this work, we revisit two well-established numerical methods for its computation. The first is an iterative algorithm for solving the nonlinear equation that defines the quasi-stationary distribution. We generalize this technique to accommodate general Markov stochastic processes, either with discrete or continuous state space, and with multiple absorbing states. The second is a Monte Carlo method with resetting, for which we propose a single-trajectory approach that uses the trajectory's own history to perform resets after absorption. In addition to these methodological contributions, we provide a detailed analysis of implementation aspects for both methods. We also compare their accuracy and efficiency across a range of examples. The results indicate that the iterative algorithm is generally the preferred choice for problems with simple boundaries, while the Monte Carlo approach is more suitable for problems with complex boundaries, where the implementation of the iterative algorithm is a challenging task., Partial financial support has been received from Grants No. PID2021-122256NB-C21/C22 and No. PID2024-157493NB-C21/C22 funded by MICIU/AEI/10.13039/501100011033 and ERDF/EU, and the María de Maeztu Program for units of Excellence in R&D, Grant No. CEX2021-001164-M. S.O-B. acknowledges support from the Spanish Ministry of Education and Professional Training under the Grant No. FPU21/04997., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Stochastic field effects in a two-state system: Symmetry breaking and symmetry restoring

  • Oliver-Bonafoux, Sara
  • Toral, Raúl
  • Chakrabarti, Amitabha
We study the Ising model under a time-varying, but spatially homogeneous, Gaussian random magnetic field. In the Monte Carlo simulations, we go beyond the standard analysis of the order parameter by measuring the magnetization probability distribution as a function of temperature and field strength, and by computing the time required for the system to escape from a completely ordered state of the magnetization. We identify three distinct phases: a broad-paramagnetic phase, a broad-ferromagnetic phase, and a bona fide ferromagnetic phase. These broad phases display wide magnetization distributions that tend toward limiting forms that remain finite in both height and width in the thermodynamic limit. The transition between the broad-paramagnetic and broad-ferromagnetic phases is noise-induced and, for small field amplitudes, occurs at the critical temperature of the field-free Ising model. The transition from the broad-ferromagnetic to the ferromagnetic phase occurs at lower temperatures and is discontinuous, yet it does not fall into the conventional first-order class. Instead, it is characterized by a diverging escape time from an ordered magnetization state., Partial financial support has been received from Grants No. PID2021-122256NB-C21/C22 and No. PID2024-157493NB-C21/C22 funded by MICIU/AEI/10.13039/501100011033 and by “ERDF/EU,” and the María de Maeztu Program for Units of Excellence in R&D, Grant No. CEX2021-001164-M. S.O-B. acknowledges support from the Spanish Ministry of Education and Professional Training under Grant No. FPU21/04997., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

A diffusion approximation for systems with frequent weak resetting

  • Galla, Tobias
6+2+12 pages, 5+6 figures., We develop a diffusion approximation for systems subject to fast random resetting by small amplitudes. Equivalently, this describes systems with frequent but small catastrophes. We demonstrate the validity of the approximation by computing the stationary distribution and mean first-passage times of simple one-dimensional systems. The approximation captures dynamically induced correlations in multi-particle systems, and it can be used to generalise the conditionally independent and identically distributed structure recently found in systems with full resetting. Finally, we show that resetting can induce cycles and patterns, which can be characterised using the diffusion approximation., I acknowledge partial }nancial support from the Agencia Estatal de Investigación and Fondo Europeo de De- sarrollo Regional (FEDER, UE) under projects APASOS (PID2021-122256NB-C22) and COSASTI (PID2024- 157493NB-C22), and the María de Maeztu programme for Units of Excellence, CEX2021-001164-M, funded by MCIN/AEI/10.13039/501100011033., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Information-theoretic analysis of temporal dependence in discrete stochastic processes: Application to precipitation predictability (v2)

  • Gregorio, Juan de
  • Sánchez, David
  • Toral, Raúl
Understanding the temporal dependence of precipitation is key to improving weather predictability and developing efficient stochastic rainfall models. We introduce an information-theoretic approach to quantify memory effects in discrete stochastic processes and apply it to daily precipitation records across the contiguous United States. The method is based on the predictability gain, a quantity derived from block entropy that measures the additional information provided by higher-order temporal dependencies. This statistic, combined with a bootstrap-based hypothesis testing and Fisher's method, enables a robust memory estimator from finite data. Tests with generated sequences show that this estimator outperforms other model-selection criteria such as Akaike Information Criterion and Bayesian Information Criterion. Applied to precipitation data, the analysis reveals that daily rainfall occurrence is well described by low-order Markov chains, exhibiting regional and seasonal variations, with stronger correlations in winter along the West Coast and in summer in the Southeast, consistent with known climatological patterns. Overall, our findings establish a framework for building parsimonious stochastic descriptions, useful when addressing spatial heterogeneity in the memory structure of precipitation dynamics, and support further advances in real-time, data-driven forecasting schemes., Partial financial support has been received from Grants PID2021-122256NB-C21/C22 and PID2024-157493NB-C21/C22 funded by MICIU/AEI/10.13039/501100011033 and by “ERDF/EU”, and the María de Maeztu Program for units of Excellence in R&D, grant CEX2021-001164-M., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Information-theoretic analysis of temporal dependence in discrete stochastic processes: Application to precipitation predictability (v1)

  • Gregorio, Juan de
  • Sánchez, David
  • Toral, Raúl
Understanding the temporal dependence of precipitation is key to improving weather predictability and developing efficient stochastic rainfall models. We introduce an information-theoretic approach to quantify memory effects in discrete stochastic processes and apply it to daily precipitation records across the contiguous United States. The method is based on the predictability gain, a quantity derived from block entropy that measures the additional information provided by higher-order temporal dependencies. This statistic, combined with a bootstrap-based hypothesis testing and Fisher's method, enables a robust memory estimator from finite data. Tests with generated sequences show that this estimator outperforms other model-selection criteria such as AIC and BIC. Applied to precipitation data, the analysis reveals that daily rainfall occurrence is well described by low-order Markov chains, exhibiting regional and seasonal variations, with stronger correlations in winter along the West Coast and in summer in the Southeast, consistent with known climatological patterns. Overall, our findings establish a framework for building parsimonious stochastic descriptions, useful when addressing spatial heterogeneity in the memory structure of precipitation dynamics, and support further advances in real-time, data-driven forecasting schemes., Partial financial support has been received from Grants PID2021-122256NB-C21/C22 and PID2024-157493NB-C21/C22 funded by MICIU/AEI/10.13039/501100011033 and by “ERDF/EU”, and the Mar´ıa de Maeztu Program for units of Excellence in R&D, grant CEX2021-001164-M., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Numerical methods for quasi-stationary distributions (v2)

  • Oliver-Bonafoux, Sara
  • Aguilar, Javier
  • Galla, Tobias
  • Toral, Raúl
In stochastic processes with absorbing states, the quasi-stationary distribution provides valuable insights into the long-term behaviour prior to absorption. In this work, we revisit two well-established numerical methods for its computation. The first is an iterative algorithm for solving the non-linear equation that defines the quasi-stationary distribution. We generalise this technique to accommodate general Markov stochastic processes, either with discrete or continuous state space, and with multiple absorbing states. The second is a Monte Carlo method with resetting, for which we propose a novel single-trajectory approach that uses the trajectory's own history to perform resets after absorption. In addition to these methodological contributions, we provide a detailed analysis of implementation aspects for both methods. We also compare their accuracy and efficiency across a range of examples. The results indicate that the iterative algorithm is generally the preferred choice for problems with simple boundaries, while the Monte Carlo approach is more suitable for problems with complex boundaries, where the implementation of the iterative algorithm is a challenging task., Partial financial support has been received from Grants PID2021-122256NB-C21/C22 and PID2024-157493NB-C21/C22 funded by MICIU/AEI/10.13039/501100011033 and by “ERDF/EU”, and the Mar´ıa de Maeztu Program for units of Excellence in R&D, grant CEX2021-001164-M. S.O-B. acknowledges support from the Spanish Ministry of Education and Professional Training under the grant FPU21/04997., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Numerical methods for quasi-stationary distributions (v1)

  • Oliver-Bonafoux, Sara
  • Aguilar, Javier
  • Galla, Tobias
  • Toral, Raúl
In stochastic processes with absorbing states, the quasi-stationary distribution provides valuable insights into the long-term behaviour prior to absorption. In this work, we revisit two well-established numerical methods for its computation. The first is an iterative algorithm for solving the non-linear equation that defines the quasi-stationary distribution. We generalise this technique to accommodate general Markov stochastic processes, either with discrete or continuous state space, and with multiple absorbing states. The second is a Monte Carlo method with resetting, for which we propose a novel single-trajectory approach that uses the trajectory's own history to perform resets after absorption. In addition to these methodological contributions, we provide a detailed analysis of implementation aspects for both methods. We also compare their accuracy and efficiency across a range of examples. The results indicate that the iterative algorithm is generally the preferred choice for problems with simple boundaries, while the Monte Carlo approach is more suitable for problems with complex boundaries, where the implementation of the iterative algorithm is a challenging task., Partial financial support has been received from Grants PID2021-122256NB-C21/C22 and PID2024-157493NB-C21/C22 funded by MICIU/AEI/10.13039/501100011033 and by “ERDF/EU”, and the Mar´ıa de Maeztu Program for units of Excellence in R&D, grant CEX2021-001164-M. S.O-B. acknowledges support from the Spanish Ministry of Education and Professional Training under the grant FPU21/04997., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Higher-order contagion processes in 3.99 dimensions

  • Meloni, Sandro
  • Gabrielli, Andrea
  • Villegas, Pablo
Higher-order interactions have recently emerged as a promising framework for describing new dynamical phenomena in heterogeneous contagion processes. However, a fundamental open question is how to understand their contribution from the perspective of the physics of critical phenomena. Based on a mesoscopic field-theoretic Langevin description, we show that (i) pairwise mechanisms such as facilitation or thresholding are formally equivalent to higher-order ones, (ii) pairwise interactions at coarse-grained scales govern the simplicial contact process and, (iii) the interplay between noise and topology is determined by the network spectral dimension. In short, we demonstrate that classical field theories, rooted in model symmetries and/or network dimensionality, capture the nature of the phase transition in real and synthetic networks., S.M. acknowledges support from the project ‘‘CODE-Coupling Opinion Dynamics with Epidemics,’’ funded under PNRR Mission 4 ‘‘Education and Research’’-Component C2-Investment 1.1-Next Generation EU ‘‘Fund for National Research Program and Projects of Significant National Interest’’ PRIN 2022 PNRR, grant code No. P2022AKRZ9. Partial support has also been received from the Agencia Estatal de Investigación and Fondo Europeo de Desarrollo Regional (FEDER, UE) under projects APASOS (PID2021-122256NB-C22), COSASTI (PID2024-157493NB-C22), and the María de Maeztu program, project No. CEX2021-001164-M, all funded by the MCIN/AEI/10.13039/501100011033. P.V. acknowledges the Spanish Ministry of Research and Innovation and Agencia Estatal de Investigación (AEI), MICIN/AEI/10.13039/501100011033, for financial support through Project No. PID2023-149174NB-I00, funded also by European Regional Development Funds, and Ref. No. PID2020-113681GB-I00., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Reducibility of higher-order to pairwise interactions: Social impact models on hypergraphs

  • Llabrés, Jaume
  • Toral, Raúl
  • San Miguel, Maxi
  • Vázquez, Federico
We show that a general class of social impact models with higher-order interactions on hypergraphs can be exactly reduced to an equivalent model with pairwise interactions on a weighted projected network. This reduction is made by a mapping that preserves the microscopic probabilities of changing the state of the nodes. As a particular case, we introduce hypergraph-voter models, for which we compute the weights of the projected network both analytically and numerically across several hypergraph ensembles, and we characterize their ordering dynamics through simulations of both higher-order and reduced dynamics. For a linear social impact function (hypergraph-linear voter model) the weights of the projected network are static, allowing us to develop a pair approximation that describes with accuracy the time evolution of macroscopic observables, which turn out to be independent of those weights. The macroscopic dynamics is thus equivalent to that of the standard voter model on the unweighted projected network. For a power-law social impact function (hypergraph-nonlinear voter model) the weights of the projected network depend on the instantaneous system configuration. Nevertheless, the nonlinear voter model on the unweighted projected network still reproduces the main macroscopic trends for well connected hypergraphs., Partial financial support has been received from Grants No. PID2021-122256NB-C21/C22 and No. PID2024-157493NB-C21/C22 funded by MICIU/AEI/10.13039/501100011033 and by “ERDF/EU,” and the María de Maeztu Program for units of Excellence in R&D, Grant No. CEX2021-001164-M., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., Peer reviewed
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

When one protocol fits none: Self-organized network routing through evolutionary game dynamics

  • Dilisante, Francesca
  • Gallarta-Sáenz, Pablo
  • Stucchi, Luciano
  • Meloni, Sandro
  • Gómez-Gardeñes, Jesús
Packet routing on scale-free networks faces a fundamental trade-off: shortest-path routing is efficient at low demand but funnels traffic through hubs and jams early, whereas congestion-aware routing postpones jamming at the price of a sharper collapse. Since neither paradigm dominates across the full range of traffic load, here we ask whether the appropriate balance can emerge endogenously rather than being imposed by design. To answer this, we recast adaptive packet routing on networks as an evolutionary game letting a heterogeneous population of strategies compete for prevalence under selection pressure generated by their own performance. We study this competition under two formalisms (strategy anchored to the packet or to the generating node), global and local update rules, and two payoff metrics. Across every implementation the evolutionary dynamics yield the same outcome: the jamming transition is delayed relative to shortest-path routing while the violent collapse of fixed congestion-aware routing is avoided. This improvement emerges spontaneously, without centralized coordination or global information. Crucially, under local update rules, the node-level volatility of strategy choices peaks sharply at the transition, providing a purely local indicator of proximity to the jamming transition that requires no global monitoring.