Applied Mathematics and Computation最新文献

{"title":"OP-HHO based feature selection improves the performance of depression classification framework: A gender biased multiband research","authors":"Kun Li, PeiYun Zhong, Li Dong, LingMin Wang, Luo-Luo Jiang","doi":"10.1016/j.amc.2025.129317","DOIUrl":"https://doi.org/10.1016/j.amc.2025.129317","url":null,"abstract":"Depression, as a common yet severe mood disorder, can cause irreversible damage to the brain if not detected and treated in a timely manner. Unfortunately, due to the current limitations of medical and technological conditions, only a small number of patients have been able to receive appropriate treatment. Although the traditional Harris Hawk's Optimization (HHO) algorithm has a strong searching ability for global optima which is helpful of early diagnosis of depression, it is highly prone to getting stuck in local optima during the early iterations. In view of this, the Optimized-Parameter Harris Hawk's Optimization (OP-HHO) algorithm proposed in this study is devised by integrating an exponential decay function. This incorporation endows the algorithm with the capacity to dynamically modulate the search step size, progressively diminish the escape energy, thereby bolstering the local search capabilities and efficaciously circumventing the problem of premature convergence that may stem from overzealous global exploration. The performance of the OP-HHO was tested using 23 benchmark functions. Based on the features selected by the OP-HHO algorithm, depression classification was carried out using the K-Nearest Neighbor (KNN) algorithm in combination with the MODMA database. The accuracy rate reached 96.36% - 97.30% across different brain wave frequencies under happy stimuli, and 100% under sad stimuli. Moreover, the classification results in the overall electroencephalogram (EEG) signals also showed excellent performance. This indicates that the OP-HHO algorithm is highly effective in accurately identifying the key features of depression. Our comparative study conducted reveals the existence of gender differences, which are expected to serve as effective features to further improve the accuracy of depression classification, opening up new avenues for the development of depression diagnosis techniques.","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"3 1","pages":""},"PeriodicalIF":4.0,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035302","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":"Graphs having two main eigenvalues and arbitrarily many distinct vertex degrees","authors":"Mohammad Ghebleh, Salem Al-Yakoob, Ali Kanso, Dragan Stevanović","doi":"10.1016/j.amc.2025.129311","DOIUrl":"https://doi.org/10.1016/j.amc.2025.129311","url":null,"abstract":"Arif, Hayat and Khan [J Appl Math Comput 69 (2023) 2549–2571] recently proposed the problem of finding explicit construction for (an infinite family of) graphs having at least three distinct vertex degrees and two main eigenvalues. After computationally identifying small examples of such graphs, we fully solve this problem by showing that the edge-disjoint union of an almost semiregular graph <ce:italic>G</ce:italic> and a regular graph <ce:italic>H</ce:italic> defined on the constant part of <ce:italic>G</ce:italic> yields a new harmonic graph under mild conditions. As a special case, this result provides for every integer <mml:math altimg=\"si1.svg\"><mml:mi>b</mml:mi><mml:mo>≥</mml:mo><mml:mn>2</mml:mn></mml:math> an explicit construction of a graph with two main eigenvalues and <mml:math altimg=\"si132.svg\"><mml:mn>2</mml:mn><mml:mi>b</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">−</mml:mo><mml:mn>1</mml:mn></mml:math> distinct vertex degrees. This construction also provides partial answers to questions posed by Hayat et al. in [Linear Algebra Appl 511 (2016) 318–327].","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"35 1","pages":""},"PeriodicalIF":4.0,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035303","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":"Data-driven-based fully distributed event-triggered control for nonlinear multi-agent systems","authors":"Xiaojie Qiu, Wenchao Meng, Yingchun Wang, Qinmin Yang","doi":"10.1016/j.amc.2025.129307","DOIUrl":"https://doi.org/10.1016/j.amc.2025.129307","url":null,"abstract":"This paper investigates the fully distributed control issue for nonlinear multi-agent systems (MASs) under the limited network bandwidth. A novel event-triggered MFAC framework is developed to ensure the consensus of system output signals in a fully distributed manner, in which an adaptive step-size operator is introduced to eliminate the reliance on communication topology information. To save communication resources efficiently, a dynamic event-triggered mechanism (ETM) with switch-adjustable threshold parameters and dormancy waking functions is designed. This triggering mechanism not only accelerates the convergence of consensus errors in unstable situations, but also prolongs the inter-execution time while maintaining the desired control performance. In the entire control process, only measured input/output data are utilized. Through mathematical analysis, the average consensus errors of closed-loop MASs are proven to converge to zero asymptotically. Finally, the effectiveness and superiority of the proposed method are demonstrated through simulation comparisons.","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"29 1","pages":""},"PeriodicalIF":4.0,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035304","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 modulus-based framework for weighted horizontal linear complementarity problems","authors":"Francesco Mezzadri","doi":"10.1016/j.amc.2025.129313","DOIUrl":"https://doi.org/10.1016/j.amc.2025.129313","url":null,"abstract":"We develop a modulus-based framework to solve weighted horizontal linear complementarity problems (WHLCPs). First, we reformulate the WHLCP as a modulus-based system whose solution, in general, is not unique. We characterize the solutions by discussing their sign pattern and how they are linked to one another. After this analysis, we exploit the modulus-based formulation to develop new solution methods. In particular, we present a non-smooth Newton iteration and a matrix splitting method for solving WHLCPs. We prove the local convergence of both methods under some assumptions. Finally, we solve numerical experiments involving symmetric and non-symmetric matrices. In this context, we compare our approaches with a recently proposed smoothing Newton's method. The experiments include problems taken from the literature. We also provide numerical insights on relevant parts of the algorithms, such as convergence, attraction basin, and starting iterate.","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"22 1","pages":""},"PeriodicalIF":4.0,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035317","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 note on sequences variant of irregularity strength for hypercubes","authors":"Anna Flaszczyńska, Aleksandra Gorzkowska, Mariusz Woźniak","doi":"10.1016/j.amc.2025.129312","DOIUrl":"https://doi.org/10.1016/j.amc.2025.129312","url":null,"abstract":"Let <mml:math altimg=\"si1.svg\"><mml:mi>f</mml:mi><mml:mo>:</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy=\"false\">→</mml:mo><mml:mo stretchy=\"false\">{</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy=\"false\">}</mml:mo></mml:math> be an edge-coloring of the <ce:italic>n</ce:italic>-dimension hypercube <mml:math altimg=\"si2.svg\"><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>. By the palette at a vertex <ce:italic>v</ce:italic> we mean the sequence <mml:math altimg=\"si3.svg\"><mml:mo stretchy=\"true\">(</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy=\"false\">)</mml:mo><mml:mo stretchy=\"false\">)</mml:mo><mml:mo>,</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy=\"false\">)</mml:mo><mml:mo stretchy=\"false\">)</mml:mo><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy=\"false\">)</mml:mo><mml:mo stretchy=\"false\">)</mml:mo><mml:mo stretchy=\"true\">)</mml:mo></mml:math>, where <mml:math altimg=\"si4.svg\"><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math> is the edge incident to <ce:italic>v</ce:italic> that connects vertices differing in the <ce:italic>i</ce:italic>th element. In this paper, we show that two colors are enough to distinguish all vertices of the <ce:italic>n</ce:italic>-dimensional hypercube <mml:math altimg=\"si2.svg\"><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math> (<mml:math altimg=\"si18.svg\"><mml:mi>n</mml:mi><mml:mo>≥</mml:mo><mml:mn>2</mml:mn></mml:math>) by their palettes. We also show that if <ce:italic>f</ce:italic> is a proper edge-coloring of the hypercube <mml:math altimg=\"si2.svg\"><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math> (<mml:math altimg=\"si6.svg\"><mml:mi>n</mml:mi><mml:mo>≥</mml:mo><mml:mn>5</mml:mn></mml:math>), then <ce:italic>n</ce:italic> colors suffice to distinguish all vertices by their palettes.","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"58 1 1","pages":""},"PeriodicalIF":4.0,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035319","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":"Effective data reduction algorithm for topological data analysis","authors":"Seonmi Choi, Jinseok Oh, Jeong Rye Park, Seung Yeop Yang, Hongdae Yun","doi":"10.1016/j.amc.2025.129302","DOIUrl":"https://doi.org/10.1016/j.amc.2025.129302","url":null,"abstract":"One of the most interesting tools that have recently entered the data science toolbox is topological data analysis (TDA). With the explosion of available data sizes and dimensions, identifying and extracting the underlying structure of a given dataset is a fundamental challenge in data science, and TDA provides a methodology for analyzing the shape of a dataset using tools and prospects from algebraic topology. However, the computational complexity makes it quickly infeasible to process large datasets, especially those with high dimensions. Here, we introduce a preprocessing strategy called the Characteristic Lattice Algorithm (CLA), which allows users to reduce the size of a given dataset as desired while maintaining geometric and topological features in order to make the computation of TDA feasible or to shorten its computation time. In addition, we derive a stability theorem and an upper bound of the barcode errors for CLA based on the bottleneck distance.","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"38 1","pages":""},"PeriodicalIF":4.0,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035322","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":"Computational aspects of hyperbolic curvature flow","authors":"Monika Suchomelová, Michal Beneš, Miroslav Kolář","doi":"10.1016/j.amc.2025.129301","DOIUrl":"https://doi.org/10.1016/j.amc.2025.129301","url":null,"abstract":"The article analyzes behavior of the solution of the hyperbolic curvature flow by means of a class of analytical solutions and by computational studies performed by a semi-discrete finite-volume scheme. A class of analytical solutions is derived and used for the verification of the computational algorithm by numerical convergence to it. An original tangential redistribution is proposed to stabilize the numerical scheme. Its derivation requires a four-dimensional transformation of the evolution law. The role of tangential redistribution is demonstrated on computational examples. Computational studies show evolution of the initially convex and non-convex curves, and include cases when singularities predicted by theory start to develop.","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"21 1","pages":""},"PeriodicalIF":4.0,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035323","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 note on block-transitive 2 − (v,k,1) designs","authors":"Shangzhao Li, Xiran Zhang, Jing Chen, Shaojun Dai","doi":"10.1016/j.amc.2025.129314","DOIUrl":"https://doi.org/10.1016/j.amc.2025.129314","url":null,"abstract":"Let <ce:italic>G</ce:italic> act block-transitively on a <mml:math altimg=\"si1.svg\"><mml:mn>2</mml:mn><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">−</mml:mo><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mn>12</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math> design. If <ce:italic>G</ce:italic> is solvable, then (1) if <mml:math altimg=\"si2.svg\"><mml:mn>3</mml:mn><mml:mo stretchy=\"false\">|</mml:mo><mml:mi>v</mml:mi></mml:math>, then <mml:math altimg=\"si27.svg\"><mml:mi>v</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">=</mml:mo><mml:msup><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:math>, <mml:math altimg=\"si28.svg\"><mml:mi>G</mml:mi><mml:mo>≤</mml:mo><mml:mi>A</mml:mi><mml:mi mathvariant=\"normal\">Γ</mml:mi><mml:mi>L</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy=\"false\">)</mml:mo></mml:math>, where <mml:math altimg=\"si29.svg\"><mml:msup><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo>≡</mml:mo><mml:mn>1</mml:mn><mml:mspace width=\"0.40em\"></mml:mspace><mml:mo stretchy=\"false\">(</mml:mo><mml:mrow><mml:mi mathvariant=\"normal\">mod</mml:mi></mml:mrow><mml:mspace width=\"0.25em\"></mml:mspace><mml:mn>44</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math>; (2) if <mml:math altimg=\"si30.svg\"><mml:mn>3</mml:mn><mml:mo>∤</mml:mo><mml:mi>v</mml:mi></mml:math>, then <mml:math altimg=\"si20.svg\"><mml:mi>v</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">=</mml:mo><mml:msup><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:math>, <mml:math altimg=\"si31.svg\"><mml:mi>G</mml:mi><mml:mo>≤</mml:mo><mml:mi>A</mml:mi><mml:mi mathvariant=\"normal\">Γ</mml:mi><mml:mi>L</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy=\"false\">)</mml:mo></mml:math>, where <mml:math altimg=\"si32.svg\"><mml:mi>p</mml:mi><mml:mo>≠</mml:mo><mml:mn>2</mml:mn></mml:math> and <mml:math altimg=\"si10.svg\"><mml:msup><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo>≡</mml:mo><mml:mn>1</mml:mn><mml:mspace width=\"0.40em\"></mml:mspace><mml:mo stretchy=\"false\">(</mml:mo><mml:mrow><mml:mi mathvariant=\"normal\">mod</mml:mi></mml:mrow><mml:mspace width=\"0.25em\"></mml:mspace><mml:mn>132</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math>.","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"49 1","pages":""},"PeriodicalIF":4.0,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035316","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":"Distinguishing infinite star-free graphs","authors":"Marcin Stawiski","doi":"10.1016/j.amc.2025.129310","DOIUrl":"https://doi.org/10.1016/j.amc.2025.129310","url":null,"abstract":"Call a vertex or an edge colouring of a graph <ce:italic>distinguishing</ce:italic>, if is not preserved by any non-identity automorphism. For a graph <ce:italic>H</ce:italic>, we say that a graph <ce:italic>G</ce:italic> is <ce:italic>H-free</ce:italic> if there is no induced subgraph of <ce:italic>G</ce:italic>, which is isomorphic to <ce:italic>H</ce:italic>. Gorzkowska, Kargul, Musiał and Pal proved that for every natural number <ce:italic>n</ce:italic> greater than 2 each finite connected <mml:math altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-free graph on at least six vertices has a distinguishing edge colouring using at most <mml:math altimg=\"si2.svg\"><mml:mi>n</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">−</mml:mo><mml:mn>1</mml:mn></mml:math> colours. We extend this result to all locally finite connected <mml:math altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs on at least six vertices.","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"10 1","pages":""},"PeriodicalIF":4.0,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035318","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":"Effects of an update mechanism based on combinatorial memory and high-reputation learning objects on the evolution of cooperation","authors":"Qianxi Yang, Yanlong Yang","doi":"10.1016/j.amc.2025.129309","DOIUrl":"https://doi.org/10.1016/j.amc.2025.129309","url":null,"abstract":"In human society, various factors influence decision-making, including memory, reputation, aspiration, etc. In recent years, research has increasingly focused on considering these factors and designing mechanisms to promote cooperation. However, few previous studies have simultaneously considered the effects of memory and reputation on cooperative evolution. Additionally, research on cooperation evolution based on memory mechanisms often focuses either on the strategy stability of the players themselves or on the strategy stability of the learning objects, but not both. Our study introduces an update mechanism based on combinatorial memory and high-reputation learning objects. This mechanism accounts for reputation and memory, where the memory effect includes the strategy stability of both the players and the learning objects. Specifically, at the stage of selecting learning objects, players prefer high-reputation individuals. We introduce a global selection weight, <ce:italic>η</ce:italic>, which allows players to select learning objects not only locally but also globally. At the stage of updating the strategy, each player simultaneously considers their own historical memory and the memory of their learning objects, with the parameter <ce:italic>γ</ce:italic> representing the memory weight of the learning objects. Monte Carlo simulations show that update rules that simultaneously consider both combinatorial memory and high-reputation learning objects are more effective in promoting cooperation than considering either factor alone. Furthermore, a small memory weight of the learning objects and a small global selection weight create an optimal environment for cooperation. Our study offers a novel approach to addressing social dilemmas and mitigating defection, emphasizing the critical roles of reputation and memory in the propagation of altruistic behavior.","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"111 1","pages":""},"PeriodicalIF":4.0,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035320","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}