Applied Mathematics and Computation最新文献

{"title":"Evolution of cooperation in spatial heterogeneous social dilemmas with dynamic self-adaptive matching","authors":"Xiaopeng Li ,&nbsp;Xuexue Yang ,&nbsp;Xiuli Zhang ,&nbsp;Weiwei Han ,&nbsp;Yan Xu","doi":"10.1016/j.amc.2025.129606","DOIUrl":"10.1016/j.amc.2025.129606","url":null,"abstract":"<div><div>From the perspective of real-world interaction scenarios, the assumption of monotypic social dilemma engagement or fixed role allocations within heterogeneous social dilemmas contexts fundamentally misrepresents the dynamics of human social cognition. Empirical evidence consistently suggests that behavioral plasticity is achieved through adaptive identity switching across heterogeneous social dilemma environments. Herein, we develop an evolutionary game model simultaneously encompassing multiple social dilemmas (prisoner's dilemma game and snowdrift game), wherein agents engage in polymorphic game-environment governed by their own adaptive characteristic. Specifically, during the strategy update phase, if the agent <span><math><msup><mrow><mi>x</mi></mrow><mrow><mo>′</mo></mrow></msup><mi>s</mi></math></span> current strategy is retained, its strategy stickiness <span><math><msub><mrow><mi>θ</mi></mrow><mrow><mi>x</mi></mrow></msub></math></span> increases one unit; otherwise, the metric reverts to the initial value of 0. Additionally, if <span><math><msub><mrow><mi>θ</mi></mrow><mrow><mi>x</mi></mrow></msub></math></span> reaches the maximum value of 100, it signifies the termination of the old agent and the initialization of a new one, with the metric also reverting to 0. Moreover, agent whose strategy adherence is beyond predefined threshold <span><math><msub><mrow><mi>θ</mi></mrow><mrow><mi>t</mi><mi>h</mi></mrow></msub></math></span> is classified as possessing strong social dilemma resolution capacity, while that is below the threshold is allocated to mild-conflict scenarios. Subsequently, through sufficient Monte Carlo simulation, we systematically investigate the evolutionary trajectories and stable-state characteristics of cooperation in dynamically adaptive multi-social dilemma systems, yielding several insightful findings.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"508 ","pages":"Article 129606"},"PeriodicalIF":3.5,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144297397","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 output feedback impulsive control for large-scale nonlinear time-delay systems with unknown measurement sensitivity","authors":"Weihao Pan,&nbsp;Yiyu Feng,&nbsp;Xianfu Zhang","doi":"10.1016/j.amc.2025.129605","DOIUrl":"10.1016/j.amc.2025.129605","url":null,"abstract":"<div><div>This work addresses the problem of event-triggered output feedback impulsive control for large-scale nonlinear time-delay systems. Specifically, the system model under consideration incorporates lower-triangular nonlinearities, discrete and distributed delays, as well as non-differentiable unknown measurement sensitivities. Unlike many existing impulsive control design methods, we utilize the dual-gain scaling technique to jointly design the observer, event-triggered mechanism, and impulsive controller. It is proved that the established event-triggered impulsive control strategy guarantees global boundedness and bounded convergence of all closed-loop signals, even if the controller operates solely at discrete moments. As an extension, the designed impulsive control is further improved based on a new gain scaling mechanism and dynamic triggering condition, enabling the closed-loop impulsive systems to achieve the asymptotic convergence of states while tolerating time-varying delays. At last, both numerical and practical examples are given to check the validity of our impulsive control schemes.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"507 ","pages":"Article 129605"},"PeriodicalIF":3.5,"publicationDate":"2025-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144270298","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":"An enhanced wavelet-based numerical scheme with higher convergence order for a class of high-order boundary value problems","authors":"Ruimin Zhang ,&nbsp;Lei Yang ,&nbsp;Hui Zhu ,&nbsp;Linghui Li ,&nbsp;Yahong Wang","doi":"10.1016/j.amc.2025.129602","DOIUrl":"10.1016/j.amc.2025.129602","url":null,"abstract":"<div><div>In this paper, a new numerical scheme is proposed to effectively solve a class of high-order boundary value problems (BVPs) with arbitrary orders and three types of boundary conditions. The method can reduce computational cost. By constructing an enhanced wavelet basis based on Legendre polynomials within a defined reproducing kernel space <span><math><msub><mrow><mi>W</mi></mrow><mrow><mi>m</mi></mrow></msub><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></math></span>, the <em>ε</em>-approximate solution of BVPs can be obtained applying the least squares method. These enhanced wavelets maintain compact support, ensuring superior approximation performance compared to classical wavelets. The convergence of the proposed scheme is characterized by its analytical order, while stability and complexity are also investigated. Specifically, for high-order nonlinear BVPs, the Quasi-Newton method is utilized effectively. We present numerical examples of several high-order linear and nonlinear BVPs with various boundary conditions, including Dirichlet, Neumann, and Robin conditions, to assess the stability and efficiency of the method. The numerical results show that our approach provides more accurate approximations, which are consistent with analytical solutions and show a high order of accuracy, outperforming several existing methods in the literature.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"507 ","pages":"Article 129602"},"PeriodicalIF":3.5,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144262981","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":"Research on monitoring mechanism of autonomous taxi: an evolutionary game approach","authors":"Kun Li ,&nbsp;Xia Wang ,&nbsp;Fei Lu ,&nbsp;Zhe Zhang ,&nbsp;Xiaodi Sun","doi":"10.1016/j.amc.2025.129596","DOIUrl":"10.1016/j.amc.2025.129596","url":null,"abstract":"<div><div>As an emerging mode of transportation, autonomous taxis have attracted widespread attention from scholars in various fields. However, theoretical research on how to monitor their operational safety still remains scarce. In light of this, we construct a tripartite game model involving safety regulatory department (SRD), autonomous taxi company (ATC), and passengers using evolutionary game theory (EGT), so as to explore the dynamic evolution of safety supervision mechanism within the entire system. Simulation results indicate that in the basic model (with fixed incentives), the system fails to stabilize at any equilibrium point, implying that a robust regulatory mechanism can never be established. Consequently, we delve into the effects of three dynamical incentive mechanisms: dynamical punishment control, dynamical reward control, and dynamical reward-punishment control. Our findings reveal that dynamical punishment control is detrimental to the stabilization of passenger supervision strategies, while dynamical reward control is highly sensitive to changes in reward parameters. In contrast, the dynamical reward-punishment model demonstrates robustness, contributing to the establishment of a safety supervision system jointly maintained by passengers and self-driving taxi companies. We hope this work provides novel theoretical insights into how to substantially improve the safety of autonomous taxi services.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"507 ","pages":"Article 129596"},"PeriodicalIF":3.5,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144263060","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":"A unified model of SABR and mean-reverting stochastic volatility for derivative pricing","authors":"Sun-Yong Choi ,&nbsp;Jeong-Hoon Kim","doi":"10.1016/j.amc.2025.129599","DOIUrl":"10.1016/j.amc.2025.129599","url":null,"abstract":"<div><div>The SABR model is popularly used by practitioners in the financial industry due to a fairly simple implied volatility formula but it wouldn't capture the mean reverting nature of the volatility as a drawback. This paper proposes a stochastic-local volatility model that unifies SABR volatility and mean reverting stochastic volatility for pricing derivatives. We obtain an explicit pricing formula in convolution form through the combination of asymptotics and the Mellin transform method. The formula allows us to compute the derivative price in terms of a single integral calculation (Mellin convolution) instead of a double integral. Further, we obtain a closed-form pricing formula that can be calculated by using the three Greeks (Delta, Gamma, and Speed) of the Black-Scholes derivative price in a reasonably practical situation. The accuracy of the derived formula is tested through Monte Carlo simulation. The validity of the formula is demonstrated through an empirical analysis of a foreign exchange option, as incorporating a mean-reverting volatility feature into the SABR model aids in calibrating the model to real market instruments by reproducing the U-shaped structure of the implied volatility.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"507 ","pages":"Article 129599"},"PeriodicalIF":3.5,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144262980","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":"Neighbor connectivity of hierarchical pancake networks","authors":"Yu Fang,&nbsp;Yingzhi Tian","doi":"10.1016/j.amc.2025.129603","DOIUrl":"10.1016/j.amc.2025.129603","url":null,"abstract":"<div><div>The vertex neighbor connectivity is the least number of vertices in an interconnection network <em>G</em>, if remove whose closed neighborhoods, the network will become empty, complete, or disconnected; the edge neighbor connectivity is the least number of edges in <em>G</em>, if remove whose ends, the network will become empty, trivial, or disconnected. In this paper, we investigate the neighbor connectivity of hierarchical pancake networks <span><math><mi>H</mi><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, which is a two level network by using the pancake graphs as the fundamental blocks. And we show that, for <span><math><mi>n</mi><mo>≥</mo><mn>3</mn></math></span>, the vertex and edge neighbor connectivity of <span><math><mi>H</mi><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> are <span><math><mi>n</mi><mo>−</mo><mn>1</mn></math></span> and <em>n</em>, respectively.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"507 ","pages":"Article 129603"},"PeriodicalIF":3.5,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144262982","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":"Extended quadratic truncated rotation symmetric Boolean functions","authors":"Thomas W. Cusick,&nbsp;Younhwan Cheon","doi":"10.1016/j.amc.2025.129601","DOIUrl":"10.1016/j.amc.2025.129601","url":null,"abstract":"<div><div>A Boolean function in <em>n</em> variables <span><math><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> is rotation symmetric (RS) if the function is invariant under cyclic rotation of the variables. If the function is generated by a single monomial it is called monomial rotation symmetric (MRS). An MRS function is called truncated rotation symmetric (TRS) if the expansion for the <em>n</em> terms of the MRS function is stopped at the first term where <span><math><msub><mrow><mi>x</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> occurs. This paper studies extended TRS functions, which are generated by adding the next monomial in the expansion of the MRS function to the TRS function. For example, the MRS function in 5 variables generated by <span><math><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span> gives the TRS function <span><math><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>+</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msub><msub><mrow><mi>x</mi></mrow><mrow><mn>4</mn></mrow></msub><mo>+</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msub><msub><mrow><mi>x</mi></mrow><mrow><mn>5</mn></mrow></msub></math></span> and the extended TRS function <span><math><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>+</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msub><msub><mrow><mi>x</mi></mrow><mrow><mn>4</mn></mrow></msub><mo>+</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msub><msub><mrow><mi>x</mi></mrow><mrow><mn>5</mn></mrow></msub><mo>+</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>x</mi></mrow><mrow><mn>4</mn></mrow></msub></math></span>. It is shown that the Hamming weights of any quadratic TRS function satisfy the same linear recursion as the weights of the corresponding extended TRS function, and also that the weights for the two functions are very frequently equal. The problem of finding the Dickson form (very difficult for a general quadratic function) for any quadratic extended TRS function is solved and an explicit generating function for the weights of any quadratic extended TRS function is found.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"507 ","pages":"Article 129601"},"PeriodicalIF":3.5,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144270436","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":"A hybrid virtual element method and deep learning approach for solving one-dimensional Euler-Bernoulli beams","authors":"Paulo Akira F. Enabe,&nbsp;Rodrigo Provasi","doi":"10.1016/j.amc.2025.129600","DOIUrl":"10.1016/j.amc.2025.129600","url":null,"abstract":"<div><div>A hybrid framework integrating the Virtual Element Method (VEM) with deep learning is presented as an initial step toward developing efficient and flexible numerical models for one-dimensional Euler-Bernoulli beams. The primary aim is to explore a data-driven surrogate model capable of predicting displacement fields across varying material and geometric parameters while maintaining computational efficiency. Building upon VEM's ability to handle higher-order polynomials and non-conforming discretizations, the method offers a robust numerical foundation for structural mechanics. A neural network architecture is introduced to separately process nodal and material-specific data, effectively capturing complex interactions with minimal reliance on large datasets. To address challenges in training, the model incorporates Sobolev training and GradNorm techniques, ensuring balanced loss contributions and enhanced generalization. While this framework is in its early stages, it demonstrates the potential for further refinement and development into a scalable alternative to traditional methods. The proposed approach lays the groundwork for advancing numerical and data-driven techniques in beam modeling, offering a foundation for future research in structural mechanics.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"507 ","pages":"Article 129600"},"PeriodicalIF":3.5,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144262979","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":"Recursive construction of biorthogonal polynomials for handling polynomial regression","authors":"Laura Rebollo-Neira,&nbsp;Jason Laurie","doi":"10.1016/j.amc.2025.129578","DOIUrl":"10.1016/j.amc.2025.129578","url":null,"abstract":"<div><div>An adaptive procedure for constructing polynomials which are biorthogonal to the basis of monomials in the same finite-dimensional inner product space is proposed. By taking advantage of available orthogonal polynomials, the proposed methodology reduces the well-known instability problem arising from the matrix inversion involved in classical polynomial regression. The recurrent generation of the biorthogonal basis facilitates the upgrading of all its members to include an additional one. Moreover, it allows for a natural downgrading of the basis. This convenient feature leads to a straightforward approach for reducing the number of terms in the polynomial regression approximation. The merit of this approach is illustrated through a series of examples where the resulting biorthogonal basis is derived from Legendre, Laguerre, and Chebyshev orthogonal polynomials.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"507 ","pages":"Article 129578"},"PeriodicalIF":3.5,"publicationDate":"2025-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144242158","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":"SOS-based secure consensus control for stochastic nonlinear MASs against multiple DoS attacks","authors":"Zhen Zhang ,&nbsp;Wei-Wei Che","doi":"10.1016/j.amc.2025.129595","DOIUrl":"10.1016/j.amc.2025.129595","url":null,"abstract":"<div><div>This paper investigates the fully distributed fuzzy secure consensus control problem for stochastic nonlinear multi-agent systems (MASs). A polynomial fuzzy model is applied to reconstruct the system dynamics for a class of nonlinear MASs described by the <span><math><mi>I</mi><mi>t</mi><mover><mrow><mi>o</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></math></span> differential equation. The asynchronous denial-of-service (DoS) attack is considered that occurs independently across communication channels between the agents. Then, a novel fuzzy secure control protocol is developed to achieve the consensus task and resist the effect of the DoS attack. Meanwhile, the control protocol is fully distributed without relying on the global information of the Laplace matrix, and its adaptive parameter is membership-function-dependent, which is more flexible. Then, a non-parallel distributed compensation method is used to deal with the mismatch problem of the membership function between the fuzzy control protocol and the fuzzy system. In addition, several mean-square bounded convergence criteria in the form of the sum-of-squares for the secure tracking error are obtained by constructing the piecewise Lyapunov functions. Finally, the feasibility of the theoretical results is verified by the simulation example and the comparative analysis.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"507 ","pages":"Article 129595"},"PeriodicalIF":3.5,"publicationDate":"2025-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144242159","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}