Applied Mathematics and Computation最新文献

{"title":"The list r-hued coloring of P5-free graph","authors":"Xuanhe Jia,&nbsp;Fengxia Liu,&nbsp;Baiyun Ji,&nbsp;Zihang Zhao","doi":"10.1016/j.amc.2025.129742","DOIUrl":"10.1016/j.amc.2025.129742","url":null,"abstract":"<div><div>Given a list <span><math><mi>L</mi></math></span> of graph <span><math><mi>G</mi></math></span>, an <span><math><mrow><mo>(</mo><mi>L</mi><mo>,</mo><mi>r</mi><mo>)</mo></mrow></math></span>-coloring of graph <span><math><mi>G</mi></math></span> is a proper coloring such that the color of vertex <span><math><mi>v</mi></math></span> belongs to its list <span><math><mrow><mi>L</mi><mo>(</mo><mi>v</mi><mo>)</mo></mrow></math></span>, and each vertex of degree <span><math><mrow><msub><mi>d</mi><mi>G</mi></msub><mrow><mo>(</mo><mi>v</mi><mo>)</mo></mrow></mrow></math></span> is adjcent to vertices with at least <span><math><mrow><mi>min</mi><mrow><mo>{</mo><mi>r</mi><mo>,</mo><msub><mi>d</mi><mi>G</mi></msub><mrow><mo>(</mo><mi>v</mi><mo>)</mo></mrow><mo>}</mo></mrow></mrow></math></span> different colors. The list <span><math><mi>r</mi></math></span>-hued chromatic number, denoted by <span><math><mrow><msub><mi>χ</mi><mrow><mi>L</mi><mo>,</mo><mi>r</mi></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span>, is the smallest integer <span><math><mi>k</mi></math></span> such that for any <span><math><mi>k</mi></math></span>-list <span><math><mi>L</mi></math></span> of <span><math><mi>G</mi></math></span>, <span><math><mi>G</mi></math></span> has an <span><math><mrow><mo>(</mo><mi>L</mi><mo>,</mo><mi>r</mi><mo>)</mo></mrow></math></span>-coloring. We prove the following: <span><math><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow></math></span> If <span><math><mrow><mi>G</mi><mo>=</mo><mi>G</mi><mo>(</mo><mi>U</mi><mo>,</mo><mi>V</mi><mo>)</mo></mrow></math></span> is a connected <span><math><msub><mi>P</mi><mn>5</mn></msub></math></span>-free bipartite graph and min <span><math><mrow><mo>{</mo><mo>|</mo><mi>U</mi><mo>|</mo><mo>,</mo><mo>|</mo><mi>V</mi><mo>|</mo><mo>}</mo><mo>=</mo><mi>s</mi></mrow></math></span>, then <span><math><mrow><msub><mi>χ</mi><mrow><mi>L</mi><mo>,</mo><mi>r</mi></mrow></msub><mrow><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>≤</mo><mi>max</mi><mo>{</mo><mn>2</mn><mi>r</mi><mo>,</mo></mrow></mrow></math></span> <span><math><mrow><mi>s</mi><mo>+</mo><mn>1</mn><mo>}</mo></mrow></math></span>. <span><math><mrow><mo>(</mo><mi>i</mi><mi>i</mi><mo>)</mo></mrow></math></span> If <span><math><mi>G</mi></math></span> is a connected <span><math><msub><mi>P</mi><mn>5</mn></msub></math></span>-free graph and <span><math><mrow><mi>r</mi><mo>≤</mo><mn>3</mn></mrow></math></span>, then <span><math><mrow><msub><mi>χ</mi><mrow><mi>L</mi><mo>,</mo><mi>r</mi></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>≤</mo><mi>r</mi><msub><mi>χ</mi><mi>L</mi></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span>.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"511 ","pages":"Article 129742"},"PeriodicalIF":3.4,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145159478","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}

{"title":"Stability analysis of stochastic McKean–Vlasov equations with discrete observation","authors":"Yicheng Liu,&nbsp;Quanxin Zhu","doi":"10.1016/j.amc.2025.129740","DOIUrl":"10.1016/j.amc.2025.129740","url":null,"abstract":"<div><div>This paper explores the stability issue of stochastic McKean–Vlasov equations (SMVEs) through an innovative method: stabilization via stochastic delay feedback control with discrete observation. Unlike conventional techniques, this approach leverages historical states instead of solely relying on the current state, setting it apart from traditional stochastic feedback controls. The study examines how the diffusion term contributes to enhancing system stability despite the presence of random fluctuations and delays, guaranteeing both <span><math><mi>p</mi></math></span>-th moment exponential stability and almost sure exponential stability under a specific delay threshold <span><math><msup><mi>δ</mi><mo>*</mo></msup></math></span>. The primary contributions of this work include introducing a novel stability analysis framework utilizing stochastic delay feedback control, constructing Lyapunov functions that incorporate both state and distribution, and providing insights into asymptotic and moment exponential stability. Although identifying the optimal delay <span><math><msup><mi>δ</mi><mo>*</mo></msup></math></span> remains a practical challenge, the theoretical foundation laid in this study offers valuable guidance for real-world applications.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"511 ","pages":"Article 129740"},"PeriodicalIF":3.4,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145109763","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}

{"title":"Event-triggered prescribed performance control of the multiplayer game nonlinear system via integral reinforcement learning","authors":"Yuanyang Hu ,&nbsp;Jiaqi Chen ,&nbsp;Chunbin Qin","doi":"10.1016/j.amc.2025.129716","DOIUrl":"10.1016/j.amc.2025.129716","url":null,"abstract":"<div><div>With a view to addressing the optimal control problem of multiplayer game nonlinear systems, an event-triggered prescribed performance control method based on the fusion of integral reinforcement learning (IRL) and adaptive dynamic programming (ADP) is proposed. Firstly, an auxiliary prescribed performance function (PPF) is designed to transform the original system into an unconstrained one. Drawing on the concepts of game theory, the multi-input optimal control problem is reformulated as a mixed zero-sum (MZS) game problem. Subsequently, an IRL-based event-triggered control (ETC) method is designed with a triggering condition. In this event-triggered method, ETC is updated only when the event-triggering condition is met, which reduces unnecessary communication overhead. On the basis of IRL, a critic-only neural network (NN) is established to approximate solutions of the event-triggered Hamilton-Jacobi-Bellman (HJB) equations without using the dynamic knowledge of the system. Additionally, the Lyapunov stability theorem is employed to ensure the uniform ultimate boundedness (UUB) of the system state and neural network weights. And the Zeno behavior can be avoided. Finally, an example is provided to verify the effectiveness of the proposed method in this paper.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"511 ","pages":"Article 129716"},"PeriodicalIF":3.4,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145109882","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}

{"title":"Collaborated risk perception against multiple epidemics in a multiplayer network","authors":"Yahong Chen ,&nbsp;He Huang","doi":"10.1016/j.amc.2025.129738","DOIUrl":"10.1016/j.amc.2025.129738","url":null,"abstract":"<div><div>The concurrent outbreak of epidemics has become a great threat to public health. An important problem is how individuals can protect themselves as the mandated protective measures are relaxed. Previous studies developed various models to investigate the correlated spreading dynamics of concurrent epidemics and the protective measures against them. However, a critical oversight remains that people’s risk perceptions on multiple epidemics are also correlated or even collaborated. In this paper, we build an SS-IS-SI-II coupled model in a multilayer network to describe two concurrent epidemics, integrating collaborated risk perception and spontaneous social distancing as individuals’ self-protection. Moreover, an adjustable coefficient is proposed to describe different levels of inter-epidemic correlations (competition/independence/cooperation). It is found that increasing the levels of inter-epidemic correlation will increase the infected density of both epidemics. Collaborated risk perception is generally more effective in reducing infections across different levels of inter-epidemic correlation, compared with independent risk perception. But its effect is dependent. For one epidemic, when its infectivity is very high or the infectivity of the other epidemic is very low, the effect of collaborated risk perception will be largely reduced. Based on the model, we further investigate the minimum social distancing required to contain epidemics under different conditions, and the priority on different layers is also explored. This research extends existing literature on co-evolutional epidemic dynamics, and lay a foundation to model correlated risk perceptions against epidemics. The results provide implications for individuals to take self-protection against concurrent epidemics.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"511 ","pages":"Article 129738"},"PeriodicalIF":3.4,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145109881","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}

{"title":"Superconvergent methods for solving two-dimensional Hammerstein integral equations","authors":"M. Sennour ,&nbsp;D. Sbibih ,&nbsp;M. Tahrichi","doi":"10.1016/j.amc.2025.129737","DOIUrl":"10.1016/j.amc.2025.129737","url":null,"abstract":"<div><div>In this paper, we introduce the superconvergent degenerate kernel method and the superconvergent Nyström method for the numerical solution of two-dimensional Hammerstein integral equations of the second kind. By employing piecewise polynomial interpolation of degree <span><math><mi>r</mi></math></span>, we prove that, under symmetry conditions on both the triangulation and the interpolation nodes, convergence orders of <span><math><mrow><mn>2</mn><mi>r</mi><mo>+</mo><mn>3</mn></mrow></math></span> and <span><math><mrow><mn>2</mn><mi>r</mi><mo>+</mo><mn>4</mn></mrow></math></span> are achieved for the approximate solutions and their iterated versions, respectively. Furthermore, we discuss computational aspects related to the construction of the corresponding nonlinear systems, and we present numerical examples to illustrate the theoretical results obtained.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"511 ","pages":"Article 129737"},"PeriodicalIF":3.4,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145109880","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}

{"title":"Composite sliding mode adaptive tracking control for singularly perturbed semi-Markov jump non-linear systems with fault and disturbances","authors":"N. Shobana ,&nbsp;R. Sakthivel ,&nbsp;O.M. Kwon ,&nbsp;M. Sankar ,&nbsp;M. Asha Safana","doi":"10.1016/j.amc.2025.129717","DOIUrl":"10.1016/j.amc.2025.129717","url":null,"abstract":"<div><div>This work epitomizes the construction of composite sliding mode-oriented adaptive tracking controller for singularly perturbed semi-Markov jump non-linear systems exposed to multiple disturbances and actuator fault. Typically, a model reference adaptive tracking control algorithm composed of baseline control, enhanced error correction term and adaptive laws is embodied with sliding mode control law to attain robust and rapid tracking performance. On top of that, a disturbance observer is embedded with fault estimator configuration to simultaneously deliver precise evaluations of both exogenous disturbances and faults that influence the system state tracking processes and these assessment are assimilated into the established tracking protocol. Collectively, a robust composite sliding mode-oriented adaptive tracking control strategy with disturbance estimation and fault-tolerance strategies is devised to assure adequate tracking objectives as well as the extended dissipativity performance specifications. After then, by deploying relevant Lyapunov function terms, the necessities for confirming the stochastic stability with preset extended dissipativity performance of the adopted system is detailed into linear matrix inequalities. Furthermore, the reliability of the analysed findings is further affirmed by graphical illustrations attained from numerical simulations.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"511 ","pages":"Article 129717"},"PeriodicalIF":3.4,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145109874","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}

{"title":"On the fairness and cooperation among free-riders","authors":"Avadh Kishor","doi":"10.1016/j.amc.2025.129724","DOIUrl":"10.1016/j.amc.2025.129724","url":null,"abstract":"<div><div>We consider the free-rider problem in peer-to-peer (P2P) systems, where agents enjoy the group effort without contributing their share. We introduce the Free-Rider Game (FRG), a non-cooperative game incorporating a fairness-aware profit allocation rule based on the Robin Hood index. We show that FRG admits strong structural properties. First, making a non-zero contribution is a dominant strategy for any player. Second, a player contributes positively whenever at least one other player does so. Third, FRG admits a unique Nash equilibrium in which each player contributes the fullest, eliminating free riding. Fourth, equilibrium outcomes are proportionally fair, ensuring balanced allocation across agents. Finally, FRG guarantees full participation by embedding fairness directly into the payoff structure, differentiating it from classical public goods games, which often yield zero or partial contributions.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"511 ","pages":"Article 129724"},"PeriodicalIF":3.4,"publicationDate":"2025-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145103891","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}

{"title":"Integrating emotion and expectation improves cooperation","authors":"Wen Lu ,&nbsp;Shu Liang","doi":"10.1016/j.amc.2025.129736","DOIUrl":"10.1016/j.amc.2025.129736","url":null,"abstract":"<div><div>Cooperation is a key issue attracting widespread attention across various fields. Emotions and expectations jointly participate in the decision-making process, and are key factors influencing the evolution of cooperation. Therefore, this paper proposes a game evolution model that considers the dual influences of emotions and expectations. In the model, a player’s initial strategy depends on their emotions. Subsequently, expectations influence the decision-making process, altering the player’s initial strategy to the current strategy. Specifically, high expectations lead players to maintain their initial strategy, whereas low expectations prompt them to change strategies. Furthermore, the paper analyzes the evolution of cooperation in the prisoner’s dilemma and the influence of expectations. Simulation results show that under high betrayal temptation, players with loneliness and defection would change their initial strategy to cooperation due to low expectations, while those players who initially gather with cooperation strategies maintain the cooperation strategies due to higher expectations, ultimately increasing the cooperation fraction and payoff of the population. Therefore, expectations effectively enhance the cooperation level and payoff of the population. When the scale of individuals changing their strategies based on expectations (ICSE) is large, the effect of expectations on enhancing cooperation and payoff is more pronounced. Frequent consideration of anticipated initial strategy changes also yields the same effect. Additionally, mechanisms of the influence of emotion on payoff, direct emotion interaction and the influence of strategy on emotion collectively contribute to enhancing the significantly evolutionary advantage of friendly emotions and cooperation strategies. This paper contributes to a deeper understanding of the role of expectations in the evolution of emotions and cooperation, laying the groundwork for enhancing social cooperation through expectation management.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"511 ","pages":"Article 129736"},"PeriodicalIF":3.4,"publicationDate":"2025-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145103887","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}

{"title":"On sketch-and-project methods for solving tensor equations","authors":"Ling Tang ,&nbsp;Yanjun Zhang ,&nbsp;Hanyu Li","doi":"10.1016/j.amc.2025.129735","DOIUrl":"10.1016/j.amc.2025.129735","url":null,"abstract":"<div><div>We propose a regular sketch-and-project method for solving linear tensor equations based on the t-product and present its equivalent Fourier domain version, along with several special cases corresponding to existing classical matrix equation methods. Furthermore, we extend this framework via a hierarchical approach to solve generalized Sylvester tensor equations. All the methods are proved to converge linearly in expectation. Finally, numerical experiments demonstrate the efficiency and effectiveness of the proposed approach.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"511 ","pages":"Article 129735"},"PeriodicalIF":3.4,"publicationDate":"2025-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145103889","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}

{"title":"Sampling patterns for Zernike-like bases in non-standard geometries","authors":"S. Díaz-Elbal ,&nbsp;A. Martínez-Finkelshtein ,&nbsp;D. Ramos-López","doi":"10.1016/j.amc.2025.129727","DOIUrl":"10.1016/j.amc.2025.129727","url":null,"abstract":"<div><div>Zernike polynomials are widely used in optics and ophthalmology due to their direct connection to classical optical aberrations. While orthogonal on the unit disk, their application to discrete data or non-circular domains–such as ellipses, annuli, and hexagons–presents challenges in terms of numerical stability and accuracy. In this work, we extend Zernike-like orthogonal functions to these non-standard geometries using diffeomorphic mappings and construct sampling patterns that preserve favorable numerical conditioning. We provide theoretical bounds for the condition numbers of the resulting collocation matrices and validate them through extensive numerical experiments. As a practical application, we demonstrate accurate wavefront interpolation and reconstruction in segmented mirror telescopes composed of hexagonal facets. Our results show that appropriately transferred sampling configurations, especially <em>Optimal Concentric Sampling</em> and <em>Lebesgue points</em>, allow stable high-order interpolation and effective wavefront modeling in complex optical systems. Moreover, the <em>Optimal Concentric Samplings</em> can be computed with an explicit expression, which is a significant advantage in practice.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"511 ","pages":"Article 129727"},"PeriodicalIF":3.4,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145103888","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}