Applied Mathematics and Computation最新文献

{"title":"Out-of-equilibrium inference of feeding rates through population data from generic consumer-resource stochastic dynamics","authors":"José A. Capitán ,&nbsp;David Alonso","doi":"10.1016/j.amc.2025.129434","DOIUrl":"10.1016/j.amc.2025.129434","url":null,"abstract":"<div><div>Statistical models are often structurally unidentifiable, because different sets of parameters can lead to equal model outcomes. To be useful for prediction and parameter inference from data, stochastic population models need to be identifiable, this meaning that model parameters can be uniquely inferred from a large number of model observations. In particular, precise estimation of feeding rates in consumer-resource dynamics is crucial, because consumer-resource processes are central in determining biomass transport across ecosystems. Model parameters are usually estimated at stationarity, because in that case model analyses are often easier. In this contribution we analyze the problem of parameter redundancy in a multi-resource consumer-resource model, showing that model identifiability depends on whether the dynamics have reached stationarity or not. To be precise, we: (i) Calculate the steady-state and out-of-equilibrium probability distributions of predator's abundances analytically using generating functions, which allow us to unveil parameter redundancy and carry out proper maximum likelihood estimation. (ii) Conduct <em>in silico</em> experiments by tracking the abundance of consumers that are either searching for or handling prey, data then used for maximum likelihood parameter estimation. (iii) Show that, when model observations are recorded out of equilibrium, feeding parameters are truly identifiable, whereas if sampling is done solely at stationarity, only ratios of rates can be inferred from data (i.e., parameters are redundant). We discuss the implications of our results when inferring parameters of general dynamical models.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"500 ","pages":"Article 129434"},"PeriodicalIF":3.5,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143725612","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":"Parking triangles on a continuous ladder","authors":"Stjepan Šebek","doi":"10.1016/j.amc.2025.129431","DOIUrl":"10.1016/j.amc.2025.129431","url":null,"abstract":"<div><div>In this article we study a variant of the famous Rényi's car-parking problem in which we are parking isosceles triangles on a strip of height 1, and where the base of the triangle can be on either side of that strip. We find the exact value of the parking constant for this model.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"500 ","pages":"Article 129431"},"PeriodicalIF":3.5,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143724621","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":"Sparse image representation through multiple multiresolution analysis","authors":"Mariantonia Cotronei ,&nbsp;Dörte Rüweler ,&nbsp;Tomas Sauer","doi":"10.1016/j.amc.2025.129440","DOIUrl":"10.1016/j.amc.2025.129440","url":null,"abstract":"<div><div>We present a strategy for image data sparsification based on a multiple multiresolution representation obtained through a structured tree of filterbanks, where both the filters and decimation matrices may vary with the decomposition level. As an extension of standard wavelet and wavelet-like approaches, our method also captures directional anisotropic information of the image while maintaining a controlled implementation complexity due to its filterbank structure and to the possibility of expressing the employed 2-D filters in an almost separable aspect. The focus of this work is on the transformation stage of image compression, emphasizing the sparsification of the transformed data. The proposed algorithm exploits the redundancy of the transformed image by applying an efficient sparse selection strategy, retaining a minimal yet representative subset of coefficients while preserving most of the energy of the data.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"500 ","pages":"Article 129440"},"PeriodicalIF":3.5,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143725611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The reduction of block-transitive 3-(v,k,2) designs","authors":"Luozhong Gong ,&nbsp;Weijun Liu ,&nbsp;Shaojun Dai","doi":"10.1016/j.amc.2025.129435","DOIUrl":"10.1016/j.amc.2025.129435","url":null,"abstract":"<div><div>Using the O'Nan-Scott Theorem for classifying the primitive permutation group, the classification problem of 3-design is discussed. And the block-transitive and point-primitive automorphism groups of a 3-<span><math><mo>(</mo><mi>v</mi><mo>,</mo><mi>k</mi><mo>,</mo><mn>2</mn><mo>)</mo></math></span> designs is reduced to affine type and almost simple type.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"500 ","pages":"Article 129435"},"PeriodicalIF":3.5,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143724619","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":"Maximal and maximum induced matchings in connected graphs","authors":"Bo-Jun Yuan ,&nbsp;Zhao-Yu Yang,&nbsp;Lu Zheng,&nbsp;Shi-Cai Gong","doi":"10.1016/j.amc.2025.129432","DOIUrl":"10.1016/j.amc.2025.129432","url":null,"abstract":"&lt;div&gt;&lt;div&gt;An induced matching is defined as a set of edges whose end-vertices induce a subgraph that is 1-regular. Building upon the work of Gupta et al. (2012) &lt;span&gt;&lt;span&gt;[11]&lt;/span&gt;&lt;/span&gt; and Basavaraju et al. (2016) &lt;span&gt;&lt;span&gt;[1]&lt;/span&gt;&lt;/span&gt;, who determined the maximum number of maximal induced matchings in general and triangle-free graphs respectively, this paper extends their findings to connected graphs with &lt;em&gt;n&lt;/em&gt; vertices. We establish a tight upper bound on the number of maximal and maximum induced matchings, as detailed below:&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/mtd&gt;&lt;mtd&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mrow&gt;&lt;mi&gt;if&lt;/mi&gt;&lt;/mrow&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mn&gt;8&lt;/mn&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mrow&gt;&lt;mo&gt;⌊&lt;/mo&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;mo&gt;⌋&lt;/mo&gt;&lt;/mrow&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mrow&gt;&lt;mo&gt;⌈&lt;/mo&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;mo&gt;⌉&lt;/mo&gt;&lt;/mrow&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mo&gt;⌊&lt;/mo&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;mo&gt;⌋&lt;/mo&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mo&gt;⌈&lt;/mo&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;mo&gt;⌉&lt;/mo&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mtd&gt;&lt;mtd&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mrow&gt;&lt;mi&gt;if&lt;/mi&gt;&lt;/mrow&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mn&gt;9&lt;/mn&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mn&gt;13&lt;/mn&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mn&gt;10&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;5&lt;/mn&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mn&gt;144&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;30&lt;/mn&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mn&gt;6&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;6&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;5&lt;/mn&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/mtd&gt;&lt;mtd&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mrow&gt;&lt;mi&gt;if&lt;/mi&gt;&lt;/mrow&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mn&gt;14&lt;/mn&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mn&gt;30&lt;/mn&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mn&gt;10&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;5&lt;/mn&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;5&lt;/mn&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mn&gt;6&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;6&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;5&lt;/mn&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/mtd&gt;&lt;mtd&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mrow&gt;&lt;mi&gt;if&lt;/mi&gt;&lt;/mrow&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;≥&lt;/mo&gt;&lt;mn&gt;31&lt;/mn&gt;&lt;mo&gt;.&lt;/mo&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt; This result not only provides a theoretical upper bound but also implies a practical algorithmic application: enumerating all maximal induced matchings of an &lt;em&gt;n&lt;/em&gt;-vertex connected graph in time &lt;span&gt;&lt;math&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msup&gt;","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"500 ","pages":"Article 129432"},"PeriodicalIF":3.5,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143705936","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 with span 1 and shortest optimal walks","authors":"Tanja Dravec ,&nbsp;Mirjana Mikalački ,&nbsp;Andrej Taranenko","doi":"10.1016/j.amc.2025.129433","DOIUrl":"10.1016/j.amc.2025.129433","url":null,"abstract":"<div><div>A span of a given graph <em>G</em> is the maximum distance that two players can keep at all times while visiting all vertices (edges) of <em>G</em> and moving according to certain rules, that produces different variants of span. We prove that the vertex and edge span of the same variant can differ by at most 1 and present a graph where the difference is exactly 1. For all variants of vertex span we present a lower bound in terms of the girth of the graph. Then we study graphs with the strong vertex span equal to 1. We present some nice properties of such graphs and show that interval graphs are contained in the class of graphs having the strong vertex span equal to 1. Finally, we present an algorithm that returns the minimum number of moves needed for both players to traverse all vertices of the given graph <em>G</em> such that in each move the distance between players equals at least the chosen vertex span of <em>G</em>.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"500 ","pages":"Article 129433"},"PeriodicalIF":3.5,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143724622","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":"The role of environmental feedback in promoting cooperation among unequal groups","authors":"Xiaotong Yu ,&nbsp;Haili Liang ,&nbsp;Xiaoqiang Ren ,&nbsp;Zhihai Rong ,&nbsp;Xiaofan Wang ,&nbsp;Ming Cao","doi":"10.1016/j.amc.2025.129436","DOIUrl":"10.1016/j.amc.2025.129436","url":null,"abstract":"<div><div>Cooperation plays a crucial role in addressing social dilemmas, yet inequality complicates the achievement of cooperation. This paper explores how environmental feedback mechanisms influence the evolution of cooperation within unequal groups. We construct a public goods game model that includes productivity and endowment inequalities and introduce a dynamic environmental feedback mechanism to study individual strategy choices in different environmental states. The results indicate that appropriate environmental feedback significantly improves cooperation levels. When there is only productivity inequality, appropriate environmental feedback increases the tendency of all individuals to cooperate, especially those with low productivity. In both productivity and endowment inequality, participants maintain a high level of cooperation when the initial endowment distribution falls within a certain range. Once the initial distribution of endowments exceeds this range, cooperative behavior quickly deteriorates. Our study provides a promising approach to enhancing the propensity for cooperation in unequal populations and highlights the significant role of adequate environmental feedback in promoting cooperation.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"500 ","pages":"Article 129436"},"PeriodicalIF":3.5,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143724620","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":"Reset observer-based containment protocol via event-triggered strategy for multi-agent networks against aperiodic DoS attacks","authors":"Dawei Zhao ,&nbsp;Wenkang Xiang ,&nbsp;Weizhao Song ,&nbsp;Lijuan Xu ,&nbsp;Chuan Chen ,&nbsp;Zhen Wang","doi":"10.1016/j.amc.2025.129415","DOIUrl":"10.1016/j.amc.2025.129415","url":null,"abstract":"<div><div>This article investigates the containment control problem for multi-agent systems (MASs) that are affected by aperiodic denial-of-service attacks using event-triggered strategies (ETSs) in a directed graph. To overcome the limitation of the Luenberger observer, which requires a trade-off between rise time and overshoot, we design a reset observer with improved error convergence performance and more reasonable reset conditions to estimate the states of the MASs. To conserve communication resources, we introduce an ETS into the reset observer-based containment controller. To avoid Zeno behavior, a trigger known as the “Zeno-free trigger” is introduced, which prevents Zeno behavior by setting a fixed triggering interval as the lower bound of the event-triggered interval. Finally, the effectiveness of the designed protocol is demonstrated through a case involving a formation of unmanned air vehicles (UAVs). By comparing the reset observer with the Luenberger observer, the superior performance of the reset observer is demonstrated.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"500 ","pages":"Article 129415"},"PeriodicalIF":3.5,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143705937","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":"Maneuvering control of stochastic nonlinear systems with unknown covariance noise","authors":"Ce Zhang,&nbsp;Likang Feng,&nbsp;Zhaojing Wu","doi":"10.1016/j.amc.2025.129416","DOIUrl":"10.1016/j.amc.2025.129416","url":null,"abstract":"<div><div>The maneuvering problem for nonlinear systems under stochastic disturbances is investigated in this paper. Firstly, the maneuvering control objectives in their stochastic version are described in the sense of moment with tunable design parameters. Then, quartic Lyapunov functions of stabilizing errors are adopted to deal with the unknown covariance noise. Based on the adaptive law and the filter-gradient update law, an adaptive maneuvering controller is designed by the backstepping technique, which makes the closed-loop system is exponentially practically stable in mean square. Furthermore, both the path tracking error and the velocity assignment error converge to neighborhoods of zero, and the radius of these neighborhoods can be adjusted arbitrarily small by tuning independent parameters. Finally, to demonstrate the controller's effectiveness in handling unknown covariance and ensuring the practical stability of the closed-loop system, simulations of the mobile robot system in stochastic environments are conducted with various design parameters and covariance settings.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"500 ","pages":"Article 129416"},"PeriodicalIF":3.5,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143724618","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 evolutionary game-based vicsek model with a fixed number of neighbors","authors":"Hui Zhao ,&nbsp;Zhenyu Zhang ,&nbsp;Igor Tchappi ,&nbsp;Li Li","doi":"10.1016/j.amc.2025.129403","DOIUrl":"10.1016/j.amc.2025.129403","url":null,"abstract":"<div><div>In the face of collective motion, people often face a binary decision: they may interact with others and pay for communication, or they can choose to go alone and forgo these costs. Evolutionary game theory (EGT) emerges in this setting as a crucial paradigm to address this complex issue. In this study, an EGT-based Vicsek with a fixed number of neighbors is proposed. It assumed that the agent had a limited view and just considered a certain number of neighbors. Agents exhibit varying movement patterns depending on the strategies they choose. Each agent's payoff depends on balancing the benefits of group movement against the communication costs with selected neighbors. Using the Fermi rule, individuals adjust their strategies accordingly. The study indicates that agents achieve the highest levels of cooperation and the fastest convergence times in high-density environments. When density is constant, increasing the number of neighbors enhances the synchronization; when the number of neighbors remains unchanged, a lower density leads to better synchronization. Additionally, the results show that EGT could boost the synchronization and accelerate the convergence of self-propelled agents.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"500 ","pages":"Article 129403"},"PeriodicalIF":3.5,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143687707","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}