SearcharxivSearch

arXiv subjects

Jordi Duch

Publications and source records attributed to Jordi Duch.

15 recordsLinked to original sources

Cycle holonomy captures higher-order compatibility constraints in remote synchronization

Higher-order interactions have typically been modeled using hypergraphs or simplicial complexes, where interactions explicitly involve more than two nodes. Here we demonstrate that effective higher-order dynamical constraints emerge naturally on ordinary graphs, provided the interaction carries nontrivial topological structure. We study a gauge-coupled phase model with edge phase lags whose accumulation around closed loops produces gauge-invariant mismatches. We show that the associated twisted Laplacian admits a zero mode if and only if all cycle holonomies vanish. Consequently, global compatibility is obstructed not by local pairwise mismatches, but by intrinsic topological frustration on cycles. We then connect this framework to the symmetric Sakaguchi--Kuramoto model, whose local coupling law differs from the gauge-coupled model but whose node phases impose cycle closure on physical phase differences. For cactus graphs, path mismatches induced by the symmetric lag can be represented through associated cycle holonomies, providing a static spectral encoding of their global residual incompatibility. Our results establish a spectral framework linking frustration to cycle-level constraints and identify cycle holonomy as a local-to-global diagnostic of path incompatibility in synchronization dynamics.

physics.soc-ph

Indirect Influence on Network Diffusion

Models of network diffusion typically rely on the Laplacian matrix, capturing interactions via direct connections. Beyond direct interactions, information in many systems can also flow via indirect pathways, where influence typically diminishes over distance. In this work, we analyze diffusion dynamics incorporating such indirect connections using the $d$-path Laplacian framework. We introduce a parameter, the indirect influence, based on the change in the second smallest eigenvalue of the generalized path Laplacian, to quantify the impact of these pathways on diffusion timescales relative to direct-only models. Using perturbation theory and mean-field approximations, we derive analytical expressions for the indirect influence in terms of structural properties of random networks. Theoretical predictions align well with numerical simulations, providing a phase diagram for when indirect influence becomes significant. We also identify a structural phase transition governed by the emergence of $d$-paths and derive the critical connection probability above which they dramatically alter diffusion. This study provides a quantitative understanding of how indirect pathways shape network dynamics and reveals their collective structural onset.

physics.soc-ph

Structural prediction of super-diffusion in multiplex networks

Diffusion dynamics in multiplex networks can model a diverse number of real-world processes. In some specific configurations of these systems, the super-diffusion phenomenon arises, in which the diffusion is faster in the multiplex network than in any of its layers. Many studies attempt to characterize this phenomenon by examining its dependency on structural properties of the network, such as overlap, average degree, network dissimilarity, and others. While certain properties show a correlation with super-diffusion in specific networks, a broader characterization is still missing. Here, we introduce a structural parameter based on the minimum node strength that effectively predicts the occurrence of super-diffusion in multiplex networks. Additionally, we propose a novel framework for deriving analytical bounds for several multiplex networks structures. Finally, we analyze and justify why certain arrangements of the inter-layer connections induce super-diffusion. These findings provide novel insights into the super-diffusion phenomenon and the interplay between network structure and dynamics.

physics.soc-ph

Fundamental limits to learning closed-form mathematical models from data

Given a finite and noisy dataset generated with a closed-form mathematical model, when is it possible to learn the true generating model from the data alone? This is the question we investigate here. We show that this model-learning problem displays a transition from a low-noise phase in which the true model can be learned, to a phase in which the observation noise is too high for the true model to be learned by any method. Both in the low-noise phase and in the high-noise phase, probabilistic model selection leads to optimal generalization to unseen data. This is in contrast to standard machine learning approaches, including artificial neural networks, which in this particular problem are limited, in the low-noise phase, by their ability to interpolate. In the transition region between the learnable and unlearnable phases, generalization is hard for all approaches including probabilistic model selection.

cs.LG

Complex decision-making strategies in a stock market experiment explained as the combination of few simple strategies

Many studies have shown that there are regularities in the way human beings make decisions. However, our ability to obtain models that capture such regularities and can accurately predict unobserved decisions is still limited. We tackle this problem in the context of individuals who are given information relative to the evolution of market prices and asked to guess the direction of the market. We use a networks inference approach with stochastic block models (SBM) to find the model and network representation that is most predictive of unobserved decisions. Our results suggest that users mostly use recent information (about the market and about their previous decisions) to guess. Furthermore, the analysis of SBM groups reveals a set of strategies used by players to process information and make decisions that is analogous to behaviors observed in other contexts. Our study provides and example on how to quantitatively explore human behavior strategies by representing decisions as networks and using rigorous inference and model-selection approaches.

q-fin.GN

Optimal prediction of decisions and model selection in social dilemmas using block models

Advancing our understanding of human behavior hinges on the ability of theories to unveil the mechanisms underlying such behaviors. Measuring the ability of theories and models to predict unobserved behaviors provides a principled method to evaluate their merit and, thus, to help establish which mechanisms are most plausible. Here, we propose models and develop rigorous inference approaches to predict strategic decisions in dyadic social dilemmas. In particular, we use bipartite stochastic block models that incorporate information about the dilemmas faced by individuals. We show, combining these models with empirical data on strategic decisions in dyadic social dilemmas, that individual strategic decisions are to a large extent predictable, despite not being "rational." The analysis of these models also allows us to conclude that: (i) individuals do not perceive games according their game-theoretical structure; (ii) individuals make decisions using combinations of multiple simple strategies, which our approach reveals naturally.

physics.soc-ph

Citizen Social Lab: A digital platform for human behaviour experimentation within a citizen science framework

Cooperation is one of the behavioral traits that define human beings, however we are still trying to understand why humans cooperate. Behavioral experiments have been largely conducted to shed light into the mechanisms behind cooperation and other behavioral traits. However, most of these experiments have been conducted in laboratories with highly controlled experimental protocols but with varied limitations which limits the reproducibility and the generalization of the results obtained. In an attempt to overcome these limitations, some experimental approaches have moved human behavior experimentation from laboratories to public spaces, where behaviors occur naturally, and have opened the participation to the general public within the citizen science framework. Given the open nature of these environments, it is critical to establish the appropriate protocols to maintain the same data quality that one can obtain in the laboratories. Here, we introduce Citizen Social Lab, a software platform designed to be used in the wild using citizen science practices. The platform allows researchers to collect data in a more realistic context while maintaining the scientific rigour, and it is structured in a modular and scalable way so it can also be easily adapted for online or brick-and-mortar experimental laboratories. Following citizen science guidelines, the platform is designed to motivate a more general population into participation, but also to promote engaging and learning of the scientific research process. We also review the main results of the experiments performed using the platform up to now, and the set of games that each experiment includes. Finally, we evaluate some properties of the platform, such as the heterogeneity of the samples of the experiments and their satisfaction level, and the parameters that demonstrate the robustness of the platform and the quality of the data collected.

cs.CY

Resource heterogeneity leads to unjust effort distribution in climate change mitigation

Fighting against climate change is a global challenge shared by nations with heterogeneous economical resources and individuals with diverse propensity for cooperation. However, we lack a clear understanding of the role of key factors such as inequality of means when diverse agents interact together towards a common goal. Here, we report the results of a collective-risk dilemma experiment in which groups of subjects were initially given either equal or unequal endowments. We found that although the collective goal was always achieved regardless of the initial capital distribution, the effort distribution was highly inequitable. Specifically, participants with fewer resources contributed significantly more to the public goods than the richer -sometimes twice as much. An unsupervised learning algorithm clustered the subjects according to their individual behavior. We found that the poorest participants congregated within the two "generous clusters" whereas the richest were mostly classified into a "greedy cluster". Our findings suggest that future policies would benefit both from reinforcing climate justice actions addressed to most vulnerable people and educating fairness instead of focusing on understanding of generic or global climate consequences, as the latter has not proven to drive equitable contributions.

physics.soc-ph

Humans display a reduced set of consistent behavioral phenotypes in dyadic games

Socially relevant situations that involve strategic interactions are widespread among animals and humans alike. To study these situations, theoretical and experimental works have adopted a game-theoretical perspective, which has allowed to obtain valuable insights about human behavior. However, most of the results reported so far have been obtained from a population perspective and considered one specific conflicting situation at a time. This makes it difficult to extract conclusions about the consistency of individuals' behavior when facing different situations, and more importantly, to define a comprehensive classification of the strategies underlying the observed behaviors. Here, we present the results of a lab-in-the-field experiment in which subjects face four different dyadic games, with the aim of establishing general behavioral rules dictating individuals' actions. By analyzing our data with an unsupervised clustering algorithm, we find that all the subjects conform, with a large degree of consistency, to a limited number of behavioral phenotypes (Envious, Optimist, Pessimist, and Trustful), with only a small fraction of undefined subjects. We also discuss the possible connections to existing interpretations based on a priori theoretical approaches. Our findings provide a relevant contribution to the experimental and theoretical efforts towards the identification of basic behavioral phenotypes in a wider set of contexts without aprioristic assumptions regarding the rules or strategies behind actions. From this perspective, our work contributes to a fact-based approach to the study of human behavior in strategic situations, that could be applied to simulating societies, policy-making scenario building and even for a variety of business applications.

physics.soc-ph

Market Imitation and Win-Stay Lose-Shift strategies emerge as unintended patterns in market direction guesses

Decisions taken in our everyday lives are based on a wide variety of information so it is generally very difficult to assess what are the strategies that guide us. Stock market therefore provides a rich environment to study how people take decision since responding to market uncertainty needs a constant update of these strategies. For this purpose, we run a lab-in-the-field experiment where volunteers are given a controlled set of financial information -based on real data from worldwide financial indices- and they are required to guess whether the market price would go up or down in each situation. From the data collected we explore basic statistical traits, behavioural biases and emerging strategies. In particular, we detect unintended patterns of behavior through consistent actions which can be interpreted as {\it Market Imitation} and {\it Win-Stay Lose-Shift} emerging strategies, being {\it Market Imitation} the most dominant one. We also observe that these strategies are affected by external factors: the expert advice, the lack of information or an information overload reinforce the use of these intuitive strategies, while the probability to follow them significantly decreases when subjects spends more time to take a decision. The cohort analysis shows that women and children are more prone to use such strategies although their performance is not undermined. Our results are of interest for better handling clients expectations of trading companies, avoiding behavioural anomalies in financial analysts decisions and improving not only the design of markets but also the trading digital interfaces where information is set down. Strategies and behavioural biases observed can also be translated into new agent based modelling or stochastic price dynamics to better understand financial bubbles or the effects of asymmetric risk perception to price drops.

q-fin.GN

The Possible Role of Resource Requirements and Academic Career-Choice Risk on Gender Differences in Publication Rate and Impact

Many studies demonstrate that there is still a significant gender bias, especially at higher career levels, in many areas including science, technology, engineering, and mathematics (STEM). We investigated field-dependent, gender-specific effects of the selective pressures individuals experience as they pursue a career in academia within seven STEM disciplines. We built a unique database that comprises 437,787 publications authored by 4,292 faculty members at top United States research universities. Our analyses reveal that gender differences in publication rate and impact are discipline-specific. Our results also support two hypotheses. First, the widely-reported lower publication rates of female faculty are correlated with the amount of research resources typically needed in the discipline considered, and thus may be explained by the lower level of institutional support historically received by females. Second, in disciplines where pursuing an academic position incurs greater career risk, female faculty tend to have a greater fraction of higher impact publications than males. Our findings have significant, field-specific, policy implications for achieving diversity at the faculty level within the STEM disciplines.

physics.soc-ph

Quantum Navigation and Ranking in Complex Networks

Complex networks are formal frameworks capturing the interdependencies between the elements of large systems and databases. This formalism allows to use network navigation methods to rank the importance that each constituent has on the global organization of the system. A key example is Pagerank navigation which is at the core of the most used search engine of the World Wide Web. Inspired in this classical algorithm, we define a quantum navigation method providing a unique ranking of the elements of a network. We analyze the convergence of quantum navigation to the stationary rank of networks and show that quantumness decreases the number of navigation steps before convergence. In addition, we show that quantum navigation allows to solve degeneracies found in classical ranks. By implementing the quantum algorithm in real networks, we confirm these improvements and show that quantum coherence unveils new hierarchical features about the global organization of complex systems.

quant-ph

Tracking Traders' Understanding of the Market Using e-Communication Data

Tracking the volume of keywords in Internet searches, message boards, or Tweets has provided an alternative for following or predicting associations between popular interest or disease incidences. Here, we extend that research by examining the role of e-communications among day traders and their collective understanding of the market. Our study introduces a general method that focuses on bundles of words that behave differently from daily communication routines, and uses original data covering the content of instant messages among all day traders at a trading firm over a 40-month period. Analyses show that two word bundles convey traders' understanding of same day market events and potential next day market events. We find that when market volatility is high, traders' communications are dominated by same day events, and when volatility is low, communications are dominated by next day events. We show that the stronger the traders' attention to either same day or next day events, the higher their collective trading performance. We conclude that e-communication among traders is a product of mass collaboration over diverse viewpoints that embodies unique information about their weak or strong understanding of the market.

cs.SI

On the universality of the scaling of fluctuations in traffic on complex networks

We study the scaling of fluctuations with the mean of traffic in complex networks using a model where the arrival and departure of "packets" follow exponential distributions, and the processing capability of nodes is either unlimited or finite. The model presents a wide variety of exponents between 1/2 and 1 for this scaling, revealing their dependence on the few parameters considered, and questioning the existence of universality classes. We also report the experimental scaling of the fluctuations in the Internet for the Abilene backbone network. We found scaling exponents between 0.71 and 0.86 that do not fit with the exponent 1/2 reported in the literature.

physics.soc-ph

Comparing community structure identification

We compare recent approaches to community structure identification in terms of sensitivity and computational cost. The recently proposed modularity measure is revisited and the performance of the methods as applied to ad hoc networks with known community structure, is compared. We find that the most accurate methods tend to be more computationally expensive, and that both aspects need to be considered when choosing a method for practical purposes. The work is intended as an introduction as well as a proposal for a standard benchmark test of community detection methods.

cond-mat.dis-nn