arXiv subjects

Bingxin Lin

Publications and source records attributed to Bingxin Lin.

3 recordsLinked to original sources

arXiv2026

A unified framework for imitation dynamics on higher-order networks

Cooperation is central to human societies and often unfolds within groups. Higher-order networks, such as hypergraphs, naturally represent these groups as hyperedges. Network structures and update rules, by which individuals revise their strategies, are the two fundamental components that shape the evolution of cooperation in structured populations. Yet while the effects of network structure have been studied extensively, update rules have been examined mostly through isolated models, leaving their relationships and the origins of their differing evolutionary outcomes poorly understood. Here we develop a unified framework for imitation dynamics on higher-order networks, parameterizing imitation-based update rules by the number of groups an individual samples and the number of peers consulted within each group. Under weak selection, we derive a closed-form condition for the success of cooperation in any multiplayer social dilemma on homogeneous hypergraphs, encompassing games with both linear and nonlinear payoff structures. The framework places previously disconnected update rules within a single family and reduces their effects on cooperation to one interpretable quantity, which we term information diversity. Update rules inducing higher information diversity promote cooperation more effectively, and we prove that this ordering holds strictly across the entire space of multiplayer social dilemmas. Simulations extend this principle to heterogeneous hypergraphs constructed both synthetically and from empirical data. Our framework provides a systematic way to represent, analyze, and compare update rules on higher-order networks, turning a fragmented collection of microscopic updating mechanisms into a tractable and interpretable theory.

physics.soc-ph↗

arXiv2025

Evolutionary dynamics under coordinated reciprocity

Using past behaviors to guide future actions is essential for fostering cooperation in repeated social dilemmas. Traditional memory-based strategies that focus on recent interactions have yielded valuable insights into the evolution of cooperative behavior. However, as memory length increases, the complexity of analysis grows exponentially, since these strategies need to map every possible action sequence of a given length to subsequent responses. Due to their inherent reliance on exhaustive mapping and a lack of explicit information processing, it remains unclear how individuals can handle extensive interaction histories to make decisions under cognitive constraints. To fill this gap, we introduce coordinated reciprocity strategies ($CORE$), which incrementally evaluate the entire game history by tallying instances of consistent actions between individuals without storing round-to-round details. Once this consistency index surpasses a threshold, $CORE$ prescribes cooperation. Through equilibrium analysis, we derive an analytical condition under which $CORE$ constitutes an equilibrium. Moreover, our numerical results show that $CORE$ effectively promotes cooperation between variants of itself, and it outperforms a range of existing strategies including memory-$1$, memory-$2$, and those from a documented strategy library in evolutionary dynamics. Our work thus underscores the pivotal role of cumulative action consistency in enhancing cooperation, developing robust strategies, and offering cognitively low-burden information processing mechanisms in repeated social dilemmas.

q-bio.PE↗

arXiv2024

GLA-DA: Global-Local Alignment Domain Adaptation for Multivariate Time Series

Unlike images and natural language tokens, time series data is highly semantically sparse, resulting in labor-intensive label annotations. Unsupervised and Semi-supervised Domain Adaptation (UDA and SSDA) have demonstrated efficiency in addressing this issue by utilizing pre-labeled source data to train on unlabeled or partially labeled target data. However, in domain adaptation methods designed for downstream classification tasks, directly adapting labeled source samples with unlabelled target samples often results in similar distributions across various classes, thereby compromising the performance of the target classification task. To tackle this challenge, we proposed a Global-Local Alignment Domain Adaptation (GLA-DA) method for multivariate time series data. Data from two domains were initially encoded to align in an intermediate feature space adversarially, achieving Global Feature Alignment (GFA). Subsequently, GLA-DA leveraged the consistency between similarity-based and deep learning-based models to assign pseudo labels to unlabeled target data. This process aims to preserve differences among data with distinct labels by aligning the samples with the same class labels together, achieving Local Class Alignment (LCA). We implemented GLA-DA in both UDA and SSDA scenarios, showcasing its superiority over state-of-the-art methods through extensive experiments on various public datasets. Ablation experiments underscored the significance of key components within GLA-DA.

cs.LG↗