Applied Mathematics and Computation最新文献_第7页

Environmental information perception enhances cooperation in stochastic public goods games via Q-learning 环境信息感知通过q学习增强随机公共物品博弈中的合作

IF 3.5 2区数学

Applied Mathematics and Computation Pub Date : 2025-05-16 DOI: 10.1016/j.amc.2025.129505

Yipeng Li , Xiangyue Hu , Xing Jin , Huizhen Zhang , Jiajia Yang , Zhen Wang

{"title":"Environmental information perception enhances cooperation in stochastic public goods games via Q-learning","authors":"Yipeng Li , Xiangyue Hu , Xing Jin , Huizhen Zhang , Jiajia Yang , Zhen Wang","doi":"10.1016/j.amc.2025.129505","DOIUrl":"10.1016/j.amc.2025.129505","url":null,"abstract":"<div><div>Cooperation is the foundation of social progress, but due to rational individuals often prioritize personal interests, reciprocal cooperation is undermined. The Public Goods Game (PGG) is a classic model for studying group interactions. Traditional PGG assumes a static environment, but in reality, the environment is dynamically changing, and there is an interaction between individual behavior and the environment. Therefore, the stochastic game framework is proposed and applied to study the feedback mechanisms between behavior and the environment. This paper takes the two-state environmental transition mechanism as an example to explore the impact of environmental information perception ability on individual decision-making in the stochastic PGG. Specifically, we use the Q-learning algorithm to depict individual decision-making behavior and consider two types of individuals with different perception abilities: individuals with environmental perception ability select the best action based on the current environmental state, while individuals without environmental perception ability make decisions based solely on historical experience. The experimental results show that environmental information perception significantly lowers the cooperation threshold in the stochastic PGG. By analyzing the microscopic interaction modes of individuals, we find that there is an isolation zone effect between different strategy populations, which effectively prevents the erosion of defection behaviors and ensures the internal stability of cooperation. The extended experiments further validate the robustness of the results. This study shows that environmental information is beneficial for promoting the evolution of cooperation. These findings provide new insights into the cooperation mechanisms in stochastic PGG and offer valuable guidance for promoting cooperation in real-world societies.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"504 ","pages":"Article 129505"},"PeriodicalIF":3.5,"publicationDate":"2025-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144069158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Optimizing symbol visibility through displacement 通过置换优化符号可见性

IF 3.5 2区数学

Applied Mathematics and Computation Pub Date : 2025-05-16 DOI: 10.1016/j.amc.2025.129529

Bernd Gärtner , Vishwas Kalani , Meghana M. Reddy , Wouter Meulemans , Bettina Speckmann , Miloš Stojaković

{"title":"Optimizing symbol visibility through displacement","authors":"Bernd Gärtner , Vishwas Kalani , Meghana M. Reddy , Wouter Meulemans , Bettina Speckmann , Miloš Stojaković","doi":"10.1016/j.amc.2025.129529","DOIUrl":"10.1016/j.amc.2025.129529","url":null,"abstract":"<div><div>In information visualization, the position of symbols often encodes associated data values. When visualizing data elements with both a numerical and a categorical dimension, positioning in the categorical axis admits some flexibility. This flexibility can be exploited to reduce symbol overlap, and thereby increase legibility. In this paper, we initialize the algorithmic study of optimizing symbol legibility via a limited displacement of the symbols.</div><div>Specifically, we consider closed unit square symbols that need to be placed at specified <em>y</em>-coordinates. We optimize the drawing order of the symbols as well as their <em>x</em>-displacement, constrained within a rectangular container, to maximize the minimum visible perimeter over all squares. If the container has width and height at most 2, there is a point that stabs all squares. In this case, we prove that a staircase layout is arbitrarily close to optimality and can be computed in <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> time. If the width is at most 2, there is a vertical line that stabs all squares, and in this case, we design a 2-approximation algorithm (assuming fixed container height) that runs in <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> time. As it turns out that a minimum visible perimeter of 2 is always achievable with a generic construction, we measure this approximation with respect to the visible perimeter exceeding 2. We show that, despite its simplicity, the algorithm gives asymptotically optimal results for certain instances.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"505 ","pages":"Article 129529"},"PeriodicalIF":3.5,"publicationDate":"2025-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144072020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Spatial public goods games with queueing and reputation 具有排队和声誉的空间公共物品博弈

IF 3.5 2区数学

Applied Mathematics and Computation Pub Date : 2025-05-16 DOI: 10.1016/j.amc.2025.129533

Gui Zhang , Xiaojin Xiong , Bin Pi , Minyu Feng , Matjaž Perc

{"title":"Spatial public goods games with queueing and reputation","authors":"Gui Zhang , Xiaojin Xiong , Bin Pi , Minyu Feng , Matjaž Perc","doi":"10.1016/j.amc.2025.129533","DOIUrl":"10.1016/j.amc.2025.129533","url":null,"abstract":"<div><div>In real-world social and economic systems, the provisioning of public goods generally entails continuous interactions among individuals, with decisions to cooperate or defect being influenced by dynamic factors such as timing, resource availability, and the duration of engagement. However, the traditional public goods game ignores the asynchrony of the strategy adopted by players in the game. To address this problem, we propose a spatial public goods game that integrates an <span><math><mi>M</mi><mo>/</mo><mi>M</mi><mo>/</mo><mn>1</mn></math></span> queueing system to simulate the dynamic flow of player interactions. We use a birth-death process to characterize the stochastic dynamics of this queueing system, with players arriving following a Poisson process and service times being exponentially distributed under a first-come-first-served basis with finite queue capacity. We also incorporate reputation so that players who have cooperated in the past are more likely to be chosen for future interactions. Our research shows that a high arrival rate, low service rate, and the reputation mechanism jointly facilitate the emergence of cooperative individuals in the network, which thus provides an interesting and new perspective for the provisioning of public goods.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"505 ","pages":"Article 129533"},"PeriodicalIF":3.5,"publicationDate":"2025-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144068627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Integral uniform hypergraphs 积分一致超图

IF 3.5 2区数学

Applied Mathematics and Computation Pub Date : 2025-05-13 DOI: 10.1016/j.amc.2025.129507

Lucas Portugal, Renata Del-Vecchio

引用次数: 0

A relaxation approach to the coupling of a two-phase fluid with a linear-elastic solid 两相流体与线弹性固体耦合的松弛方法

IF 3.5 2区数学

Applied Mathematics and Computation Pub Date : 2025-05-12 DOI: 10.1016/j.amc.2025.129503

Niklas Kolbe, Siegfried Müller

引用次数: 0

Low-rank reduced biquaternion tensor ring decomposition and tensor completion 低秩约简双四元数张量环分解与张量补全

IF 3.5 2区数学

Applied Mathematics and Computation Pub Date : 2025-05-09 DOI: 10.1016/j.amc.2025.129504

Hui Luo , Xin Liu , Wei Liu , Yang Zhang

引用次数: 0

Learning influence probabilities in diffusion networks without timestamps 无时间戳扩散网络影响概率的学习

IF 3.5 2区数学

Applied Mathematics and Computation Pub Date : 2025-05-07 DOI: 10.1016/j.amc.2025.129502

Yuchen Wang , Huidi Wang , Chao Gao , Kefeng Fan , Hailong Cheng , Zhijie Shen , Zhen Wang , Matjaž Perc

{"title":"Learning influence probabilities in diffusion networks without timestamps","authors":"Yuchen Wang , Huidi Wang , Chao Gao , Kefeng Fan , Hailong Cheng , Zhijie Shen , Zhen Wang , Matjaž Perc","doi":"10.1016/j.amc.2025.129502","DOIUrl":"10.1016/j.amc.2025.129502","url":null,"abstract":"<div><div>Inferring information diffusion networks plays a crucial role in social network analysis and various applications. Existing methods often rely on the infection times of nodes in diffusion processes to uncover influence relationships. However, accurately monitoring real-time temporal information is challenging and resource-intensive. Additionally, some approaches that do not utilize infection timestamps fail to adequately capture the strength of influence relationships among nodes. To address these limitations, we propose a novel method called Learning Influence Probabilities in diffusion Networks without timestamps (LIPN). LIPN introduces an enhanced correlation metric to measure the relationship between node infections, which is utilized in the pre-pruning stage to mitigate the negative impact of redundant candidate edges during the inference process. LIPN constructs a likelihood function for the diffusion process by considering the infection probability between nodes. Furthermore, to enhance the reliability of the inferred results, LIPN incorporates an optimization strategy that combines an expectation maximization algorithm with a variant of the simulated annealing algorithm. The experimental results validate the effectiveness of LIPN in both synthetic networks and real-world networks, highlighting its potential for empowering social network analysis and applications.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"503 ","pages":"Article 129502"},"PeriodicalIF":3.5,"publicationDate":"2025-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143918304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Cycle multistability and synchronization mechanisms in coupled interneurons: In-phase and anti-phase dynamics under current stimuli 耦合中间神经元的周期多稳定性和同步机制：电流刺激下的同相和反相动力学

IF 3.5 2区数学

Applied Mathematics and Computation Pub Date : 2025-05-07 DOI: 10.1016/j.amc.2025.129500

Jan Ševčík, Lenka Přibylová

{"title":"Cycle multistability and synchronization mechanisms in coupled interneurons: In-phase and anti-phase dynamics under current stimuli","authors":"Jan Ševčík, Lenka Přibylová","doi":"10.1016/j.amc.2025.129500","DOIUrl":"10.1016/j.amc.2025.129500","url":null,"abstract":"<div><div>Over the last decade, high-frequency oscillations (HFOs), very high-frequency oscillations (VHFOs), and ultra-fast oscillations (UFOs) have been proposed as possible biomarkers for epileptogenic zones in individuals with drug-resistant epilepsy. Despite considerable interest, the mechanisms responsible for producing such high frequencies, significantly surpassing the physiological limits of neuronal firing, remain an open question. Using concepts from bifurcation theory, we extend our mathematical framework for modeling the emergence of apparent VHFOs, which might eventually manifest in depth electroencephalographic (EEG) signals, by incorporating an external stimulus responsible for subsequent frequency multiplication. Focusing on the dynamics of two gap-junctionally coupled interneurons, this research provides a detailed analysis of multistable regions, along with an extensive description of possible dynamical regimes associated with external current stimulation, analogous to the frequency-input curve for a single interneuron. In particular, we describe the ability of the stimulus to activate and deactivate oscillation modes in anti-phase or in-phase, including their mutual interchange. Finally, we apply this framework to analyze a collective response of a large heterogeneous two-layer network.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"503 ","pages":"Article 129500"},"PeriodicalIF":3.5,"publicationDate":"2025-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143918483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Analysis of stability, energy conservation, and convergence of coupled advection-diffusion models for ocean-atmosphere interactions 海洋-大气相互作用的平流-扩散耦合模式的稳定性、能量守恒和收敛性分析

IF 3.5 2区数学

Applied Mathematics and Computation Pub Date : 2025-05-05 DOI: 10.1016/j.amc.2025.129496

Taj Munir , Hongchu Chen , Can Kang , Hussan Zeb

{"title":"Analysis of stability, energy conservation, and convergence of coupled advection-diffusion models for ocean-atmosphere interactions","authors":"Taj Munir , Hongchu Chen , Can Kang , Hussan Zeb","doi":"10.1016/j.amc.2025.129496","DOIUrl":"10.1016/j.amc.2025.129496","url":null,"abstract":"<div><div>The main focus of this work is to study ocean-atmosphere coupling, modeled using coupled advection-diffusion equations with two coupling conditions: the Dirichlet-Neumann (DN) and the heat flux condition, defined across two non-overlapping domains. For numerical approximation, the finite-volume method (FVM) and finite-difference method (FDM) are applied. The convergence analysis of the coupled problem is conducted using the Generalized Minimal Residual (GMRES) method. We conclude that central difference schemes ensure conservation under heat flux coupling, while one-sided differences introduce errors leading to energy non-conservation. While for the DN-coupling one sided maintain the conservation. The stability analysis, based on Fourier analysis and normal mode techniques from Godunov-Ryabenkii (GR) stability theory, reveals stricter stability constraints for explicit schemes compared to implicit ones. The GMRES method is used to achieve numerical convergence. The results demonstrate how variations in the Péclet number (Pe) influence the behavior of the solution, transitioning from diffusion-driven smoothness to advection-driven sharpness, while maintaining physical consistency across the domains. The proposed algorithms undergo rigorous numerical validation, with results illustrated through detailed graphs and numerical tables that demonstrate strong agreement between theoretical predictions and computational outcomes.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"502 ","pages":"Article 129496"},"PeriodicalIF":3.5,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143903354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Community reciprocity promotes cooperation in a network evolutionary prisoner’s dilemma game 网络进化囚徒困境博弈中的社区互惠促进合作

IF 3.5 2区数学

Applied Mathematics and Computation Pub Date : 2025-05-02 DOI: 10.1016/j.amc.2025.129497

Lin Li, Jingyu Lv, Lili Ma, Jing Ruan

{"title":"Community reciprocity promotes cooperation in a network evolutionary prisoner’s dilemma game","authors":"Lin Li, Jingyu Lv, Lili Ma, Jing Ruan","doi":"10.1016/j.amc.2025.129497","DOIUrl":"10.1016/j.amc.2025.129497","url":null,"abstract":"<div><div>Community structure is one of the most common features of complex networks and plays a crucial role in the game of strategy during an evolutionary process. Previous works focus on its physical characteristics of high cohesion and low coupling, we extend the existing research, by taking into consideration the capacity of communities to effectively manage and allocate resources through collective action, from a logical functional perspective. Based on the Prisoner’s Dilemma Game, we develop a new evolutionary model featuring community reciprocity. In particular, we assume that players could obtain the shared resources contributed by cooperators from communities with a certain probability, and the quantity of reciprocal resources players could reap depends on their positions in the community. Through intensive simulations on two famous synthetic networks with built-in community structure, the results show that community structure can provide enhanced reciprocity and promote the evolution of cooperation. The way that cooperation prospers is by occupying nodes with more advantageous positions within the community. Besides, the clarity of community structure mediates the promoting effect of community reciprocity on cooperation.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"502 ","pages":"Article 129497"},"PeriodicalIF":3.5,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143898895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0