样式： 排序： IF:  GO 导出 标记为已读

Zerodeterminant strategy of finite games with implementation errors and its application into group decisionmaking Appl. Math. Comput. (IF 3.5) Pub Date : 20240907
Zhipeng Zhang, Xiaotong Jiang, Chengyi XiaThe zerodeterminant (ZD) strategy provides a new perspective for describing the interaction between players, and the errors among them will be an important role in designing ZD strategy, which attracts a lot of researches in various fields. This paper investigates how to design ZD strategy for multiplayer twostrategy repeated finite game under implementation errors. First, the implementation errors

A payoff equality perspective for evolutionary games: Mental accounting and cooperation promotion Appl. Math. Comput. (IF 3.5) Pub Date : 20240906
Yandi Liu, Yonghui LiThe secret behind cooperation with the present profitpursuing nature has been unveiled via the Evolutionary Game Theory and models. However, the payoff equality is not sufficiently explored. This paper proposes a simple but efficient way to focus on the synergetic behaviors of payoff equality and cooperation improvement. Herein, the classical Evolutional Game model is reevaluated from the perspective

Linear programming with infinite, finite, and infinitesimal values in the righthand side Appl. Math. Comput. (IF 3.5) Pub Date : 20240903
Marco Cococcioni, Lorenzo FiaschiThe goal of this work is to propose a new type of constraint for linear programs: inequalities having infinite, finite, and infinitesimal values in the righthand side. Because of the nature of such constraints, the feasible region polyhedron becomes more complex, since its vertices can be represented by nonpurely finite coordinates, and so is the optimum of the problem. The introduction of such constraints

The reputationbased reward mechanism promotes the evolution of fairness Appl. Math. Comput. (IF 3.5) Pub Date : 20240903
Lili Deng, Rugen Wang, Ying Liao, Ronghua Xu, Cheng WangIn real life, a good reputation generally brings positive returns to individuals. For example, merchants with numerous good reviews usually gain higher profits. Considering this in the ultimatum game, we propose a reputationbased reward mechanism to investigate the evolution of fairness. Specifically, individuals' reputations evolve dynamically based on the outcomes of games. At the same time, we

Some identities on degenerate harmonic and degenerate higherorder harmonic numbers Appl. Math. Comput. (IF 3.5) Pub Date : 20240902
Taekyun Kim, Dae San KimThe harmonic numbers and higherorder harmonic numbers appear frequently in several areas which are related to combinatorial identities, many expressions involving special functions in analytic number theory, and analysis of algorithms. The aim of this paper is to study the degenerate harmonic and degenerate higherorder harmonic numbers, which are respectively degenerate versions of the harmonic and

Secondorder nonuniform and fast twogrid finite element methods for nonlinear timefractional mobile/immobile equations with weak regularity Appl. Math. Comput. (IF 3.5) Pub Date : 20240902
Zhijun TanThis paper introduces a novel temporal secondorder fully discrete approach of finite element method (FEM) and its fast twogrid FEM on nonuniform meshes, which aims to solve nonlinear timefractional variable coefficient mobile/immobile (MIM) equations with a solution exhibiting weak regularity. The proposed method utilizes the averaged L1 formula on graded meshes in the temporal domain to handle

Improved algorithm for the optimal quantization of single and multivariate random functions Appl. Math. Comput. (IF 3.5) Pub Date : 20240902
Liyang Ma, Daniel Conus, WeiMin Huang, Paolo BocchiniThe Functional Quantization (FQ) method was developed for the approximation of random processes with optimally constructed finite sets of deterministic functions (quanta) and associated probability masses. The quanta and the corresponding probability masses are collectively called a “”. A method called “Functional Quantization by InfiniteDimensional Centroidal Voronoi Tessellation” (FQIDCVT) was

Nonlinear conjugate gradient method for vector optimization on Riemannian manifolds with retraction and vector transport Appl. Math. Comput. (IF 3.5) Pub Date : 20240902
Kangming Chen, Ellen Hidemi Fukuda, Hiroyuki SatoIn this paper, we propose nonlinear conjugate gradient methods for vector optimization on Riemannian manifolds. The concepts of Wolfe and Zoutendjik conditions are extended to Riemannian manifolds. Specifically, the existence of intervals of step sizes that satisfy the Wolfe conditions is established. The convergence analysis covers the vector extensions of the Fletcher–Reeves, conjugate descent, and

Vector multispaces and multispace codes Appl. Math. Comput. (IF 3.5) Pub Date : 20240830
Mladen KovačevićBasic algebraic and combinatorial properties of finite vector spaces in which individual vectors are allowed to have multiplicities larger than 1 are derived. An application in coding theory is illustrated by showing that multispace codes that are introduced here may be used in random linear network coding scenarios, and that they generalize standard subspace codes (defined in the set of all subspaces

Analytically pricing volatility options and capped/floored volatility swaps with nonlinear payoffs in discrete observation case under the Merton jumpdiffusion model driven by a nonhomogeneous Poisson process Appl. Math. Comput. (IF 3.5) Pub Date : 20240830
Sanae RujivanIn this paper, we introduce novel analytical solutions for valuating volatility derivatives, including volatility options and capped/floored volatility swaps, employing discrete sampling within the framework of the Merton jumpdiffusion model, which is driven by a nonhomogeneous Poisson process. The absence of a comprehensive understanding of the probability distribution characterizing the realized

Adaptive distributed unknown input observer for linear systems Appl. Math. Comput. (IF 3.5) Pub Date : 20240830
DanDan Zhou, Ran ZhaoThis paper studies the adaptive distributed unknown input observer (ADUIO) for linear systems with local outputs, which contains a group of local observers under directed graph. The difficulty is the adaptive estimation of global output for the systems with unknown inputs. To solve the problem, disturbance decoupling principle and leaderfollowing consensus strategy are integrated to estimate local

A fast local search based memetic algorithm for the parallel row ordering problem Appl. Math. Comput. (IF 3.5) Pub Date : 20240828
Gintaras PalubeckisThe parallel row ordering problem (PROP) is concerned with arranging two groups of facilities along two parallel lines with the goal of minimizing the sum of the flow costweighted distances between the pairs of facilities. As the main result of this paper, we show that the insertion neighborhood for the PROP can be explored in optimal time by providing an time procedure for performing this task,

Exponential stability of switched systems with statedependent delayed impulses via Bequivalent method Appl. Math. Comput. (IF 3.5) Pub Date : 20240828
Qian Cui, Jinde Cao, Lulu Li, Yang LiuThis paper studies the stability problem of switched systems with statedependent delayed impulses (SDDIs), where switching times satisfy the definition of average dwelltime. Firstly, the pulse phenomenon of the systems with SDDIs is avoided under some necessary assumptions. Subsequently, the statedependent delayed impulsive switched systems can be transformed into the corresponding timedependent

A matrixseparationbased integral inequality for aperiodic sampleddata synchronization of delayed neural networks considering communication delay Appl. Math. Comput. (IF 3.5) Pub Date : 20240827
H.Z. Wang, X.C. Shangguan, D. Xiong, Y.H. An, L. JinThis paper achieves the synchronization of delayed neural networks (DNNs) considering aperiodic sampleddata control and communication delay. First of all, based on the masterslave DNNs with aperiodic sampling synchronization controller, a synchronization error system is constructed. Then, an augmented functional containing both the error state and its derivative is constructed. Compared with the

Exploring redundant trees in bipartite graphs Appl. Math. Comput. (IF 3.5) Pub Date : 20240827
Qing Yang, Yingzhi TianLuo et al. conjectured that for a tree with bipartition and , if a connected bipartite graph with minimum degree at least , then has a subtree isomorphic to such that is connected. Although this conjecture has been validated for spiders and caterpillars in cases where , and also for paths with odd order, its general applicability has remained an open question. In this paper, we establish the validity

Modelling the prevalence of prostitution under the influence of poverty: A deterministic vs. stochastic approach Appl. Math. Comput. (IF 3.5) Pub Date : 20240827
G. Divya, S. Athithan, Mini GhoshGlobally, there is a widespread awareness of povertyrelated challenges. It's important to acknowledge that poverty is one of the key factors influencing prostitution. Addressing the rise in prostitution due to economic challenges is a major concern among the general public. In that scenario, many poor family girls/women were ready to downgrade their status for their family welfare and necessary needs

Nonfragile outputfeedback control for delayed memristive bidirectional associative memory neural networks against actuator failure Appl. Math. Comput. (IF 3.5) Pub Date : 20240827
R. Suvetha, J.J. Nieto, P. PrakashThis article investigates the stabilization property for the modeled memristive bidirectional associative memory neural networks with timevarying delay when the faulty signals received from the fluctuated controller. The nonfragile outputfeedback controller is taken into account to counteract the impact of gain perturbations to end up with robust faulttolerant setup. To tackle the weak signals

Attackcompensated asynchronous output feedback control for stochastic switching systems with sojourn probability Appl. Math. Comput. (IF 3.5) Pub Date : 20240826
Xu Mei, Jun Cheng, Wentao HuangThis study addresses the problem of attackcompensated asynchronous output feedback control for stochastic switching systems with sojourn probability. Unlike traditional Markov/semiMarkov models that rely on transition probabilities, a novel switching rule is introduced that focuses on sojourn probability information associated with the target mode and sojourn time, which are easier to obtain than

Laplacian eigenvalue distribution for unicyclic graphs Appl. Math. Comput. (IF 3.5) Pub Date : 20240826
Sunyo Moon, Seungkook ParkLet be a graph and let denote the number of Laplacian eigenvalues of in the interval . For a tree T with diameter , Guo, Xue, and Liu proved that . In this paper, we provide a lower bound for when is a unicyclic graph, in terms of the diameter and girth of . Moreover, for the lollipop graph, under certain conditions on its diameter and girth, we give a formula for the exact value of .

Optimal investment with insurable background risk and nonlinear portfolio allocation frictions Appl. Math. Comput. (IF 3.5) Pub Date : 20240822
Hugo E. Ramírez, Rafael SerranoWe study optimal investment and insurance demand in a continuoustime model that combines risky assets with an insurable background risk. This risk takes the form of a jumpdiffusion process that reduces the return rate of the agent's wealth. The main distinctive feature of our model is that the agent's decision on portfolio choice and insurance demand causes nonlinear friction in the dynamics of the

Stability estimates for radial basis function methods applied to linear scalar conservation laws Appl. Math. Comput. (IF 3.5) Pub Date : 20240821
Igor Tominec, Murtazo Nazarov, Elisabeth LarssonWe derive stability estimates for three commonly used radial basis function (RBF) methods to solve hyperbolic timedependent PDEs: the RBF generated finite difference (RBFFD) method, the RBF partition of unity method (RBFPUM) and Kansa's (global) RBF method. We give the estimates in the discrete norm intrinsic to each of the three methods. The results show that Kansa's method and RBFPUM can be

Exploring the limits of the law of mass action in the mean field description of epidemics on ErdösRényi networks Appl. Math. Comput. (IF 3.5) Pub Date : 20240820
Francisco J. Muñoz, Luca Meacci, Juan Carlos Nuño, Mario PrimicerioThe manner epidemics occurs in a social network depends on various elements, with two of the most influential being the relationships among individuals in the population and the mechanism of transmission. In this paper, we assume that the social network has a homogeneous random topology of ErdösRényi type. Regarding the contagion process, we assume that the probability of infection is proportional

On spectral extrema of graphs with given order and generalized 4independence number Appl. Math. Comput. (IF 3.5) Pub Date : 20240820
Shuchao Li, Zihan ZhouCharacterizing the graph having the maximum or minimum spectral radius in a given class of graphs is a classical problem in spectral extremal graph theory, originally proposed by Brualdi and Solheid. Given a graph , a vertex subset is called a maximum generalized 4independent set of if the induced subgraph dose not contain a 4tree as its subgraph, and the subset has maximum cardinality. The cardinality

Numerical analysis for nonlinear wave equations with boundary conditions: Dirichlet, Acoustics and Impenetrability Appl. Math. Comput. (IF 3.5) Pub Date : 20240820
Adriano A. Alcântara, Juan B. Límaco, Bruno A. Carmo, Ronald R. Guardia, Mauro A. RinconIn this article, we present an error estimation in the norm referring to three wave models with variable coefficients, supplemented with initial and boundary conditions. The first two models are nonlinear wave equations with Dirichlet, Acoustics, and nonlinear dissipative impenetrability boundary conditions, while the third model is a linear wave equation with Dirichlet, Acoustics, and linear dissipative

A note on the 1factorization of nonuniform complete hypergraph Appl. Math. Comput. (IF 3.5) Pub Date : 20240816
Taijiang Jiang, Qiang Sun, Chao ZhangGiven with for , let denote the nonuniform complete hypergraph on vertices, whose edge set contains copies of every subset of vertex set for . Let denote for for . Recently, He et al. determined all such that has a 1factorization. In this manuscript, we consider the 1factorization of and obtain the following results. (1) If for and , then has a 1factorization for sufficiently large . (2) If has

Pattern dynamics of a LotkaVolterra model with taxis mechanism Appl. Math. Comput. (IF 3.5) Pub Date : 20240816
Mengxin ChenThis paper deals with the Turing bifurcation and pattern dynamics of a LotkaVolterra model with the predatortaxis and the homogeneous noflux boundary conditions. To investigate the pattern dynamics, we first give the occurrence conditions of the Turing bifurcation. It is found that there is no Turing bifurcation when predatortaxis disappears, while the Turing bifurcation occurs as predatortaxis

Barrierfunction based adaptive trajectory tracking control for highorder nonlinear systems with collision avoidance Appl. Math. Comput. (IF 3.5) Pub Date : 20240816
Lili Zhang, Chenglong Liu, Liwei AnThis paper considers the problem of trajectory tracking and collision avoidance for a class of highorder nonlinear strict feedback systems with unknown nonlinearities. The main issue is how to ensure collision avoidance and tracking performance simultaneously in the presence of unknown nonlinear functions. To address the issue, an integralmultiplicative barrier Lyapunov function (BLF) is integrated

TwoLevel method for blind image deblurring problems Appl. Math. Comput. (IF 3.5) Pub Date : 20240813
Azhar Iqbal, Shahbaz Ahmad, Junseok KimBlind image deblurring (BID) is a procedure for reducing blur and noise in a deteriorated image. In this process, the estimation of the original image, as well as the blurring kernel of the degraded image, is done without or with only partial information about the imaging system and degradation. This is an inverse problem (illposed) that corresponds to the direct problem of deblurring. To overcome

Dynamic eventtriggered predefinedtime adaptive attitude control for a QUAV with unknown deception attacks Appl. Math. Comput. (IF 3.5) Pub Date : 20240813
Guanchao Zhu, Min Luo, Guozeng Cui, Ze LiThis paper focuses on the problem of dynamic eventtriggered predefinedtime adaptive attitude control of quadrotor unmanned aerial vehicle (QUAV) suffering from unknown deception attacks. The command filter is utilized to avoid the “explosion of complexity” problem, while concurrently eliminating the effect of filtered error by constructing the fractional power error compensation signals. By using

Dynamic eventdriven optimal consensus control for stateconstrained multiagent zerosum differential graphical games Appl. Math. Comput. (IF 3.5) Pub Date : 20240813
Siyu Guo, Yingnan Pan, Hongyi LiIn this paper, a dynamic eventdriven optimal control scheme is proposed for the zerosum differential graphical games in nonlinear multiagent systems with fullstate constraints. Initially, to address the dual demands of optimality and state constraints, a set of system transformation functions are introduced to satisfy the state constraints of the agents. Then, by applying the principle of differential

Topological scale framework for hypergraphs Appl. Math. Comput. (IF 3.5) Pub Date : 20240812
H. MolinaAbril, M.J. MorónFernández, M. BenitoMarimón, F. DíazdelRío, P. RealIn this paper, a new computational topological framework for hypergraph analysis and recognition is developed. “Topology provides scale” is the principle at the core of this set of algebraic topological tools, whose fundamental notion is that of a scalespace topological model (model). The scale of this parameterized sequence of algebraic hypergraphs, all having the same EulerPoincaré characteristic

Minimizing the least Laplacian eigenvalue of signed complete graphs Appl. Math. Comput. (IF 3.5) Pub Date : 20240812
Dan Li, Minghui Yan, Jixiang MengA signed graph Σ is a graph whose edges yield the signs ±1. Let be the complete graph with vertices and be a signed complete graph, where is a subgraph induced by the negative edges of Σ. The least Laplacian eigenvalue of Σ is the least eigenvalue of its Laplacian matrix. A unicyclic graph is a connected graph containing exactly one cycle. In this paper, we focus on the least Laplacian eigenvalue of

Numerical solution of metastatic tumor growth models with treatment Appl. Math. Comput. (IF 3.5) Pub Date : 20240812
I.M. Bulai, M.C. De Bonis, C. LauritaIn this paper we introduce an efficient numerical method in order to solve Volterra integral equations (VIE) of the second type. We are motivated by the fact that the coupled PDEODE model, used to describe the metastatic tumor growth, can be reformulated in terms of VIE, whose unknowns are biological observables, such as the cumulative number of metastases and the total metastatic mass. Here in particular

Local structurepreserving algorithms for the nonlinear Schrödinger equation with power law nonlinearity Appl. Math. Comput. (IF 3.5) Pub Date : 20240812
Fangwen Luo, Qiong Tang, Yiting Huang, Yanhui Ding, Sijia TangThis paper introduces three local structurepreserving algorithms for the onedimensional nonlinear Schrödinger equation with power law nonlinearity, comprising two local energyconserving algorithms and one local momentumconserving algorithm. Additionally, we extend these local conservation algorithms to achieve global conservation under periodic boundary conditions. Theoretical analyses confirm

Twolevel implicit highorder compact scheme in exponential form for 3D quasilinear parabolic equations Appl. Math. Comput. (IF 3.5) Pub Date : 20240809
Kajal Mittal, Rajendra K. RayWe discuss a new high accuracy compact exponential scheme of order four in space and two in time to solve the threedimensional quasilinear parabolic partial differential equations. The derived halfstep discretization based scheme is implicit in nature and demands only two levels for computation. The generalization of the proposed exponential scheme for the system of the quasilinear parabolic PDEs

Analysis of a competitive respiratory disease system with quarantine: Epidemic thresholds and crossimmunity effects Appl. Math. Comput. (IF 3.5) Pub Date : 20240809
Anna Daniel Fome, Wolfgang Bock, Axel KlarOur study investigates the dynamics of disease interaction and persistence within populations, exploring various epidemic scenarios, including backward bifurcation and crossimmunity effects. We establish conditions under which the diseasefree equilibrium of the model demonstrates local or global asymptotic stability, contingent on the efficacy of quarantine measures. Notably, we find that a strain

Reachable set estimation of delayed secondorder memristive neural networks Appl. Math. Comput. (IF 3.5) Pub Date : 20240809
Yi Shen, Jiemei Zhao, Liqi YuThis study is concerned with reachable set bounding of delayed secondorder memristive neural networks (SMNNs) with bounded input disturbances. By applying an analytic method, some inequality techniques and an adaptive control strategy, a sufficient condition of reachable set estimation criterion is derived to guarantee that the states of delayed SMNNs are bounded by a compact ellipsoid. A nonreduced

Solving AllenCahn equations with periodic and nonperiodic boundary conditions using mimetic finitedifference operators Appl. Math. Comput. (IF 3.5) Pub Date : 20240809
Saulo Orizaga, Gilberto GonzálezParra, Logan Forman, Jesus VillegasVillanuevaIn this paper, we investigate and implement a numerical method that is based on the mimetic finite difference operator in order to solve the nonlinear Allen–Cahn equation with periodic and nonperiodic boundary conditions. In addition, we also analyze the performance of this mimeticbased method by using the classical heat equation with a variety of boundary conditions. We assess the performance of

Redefined fourth order uniform hyperbolic polynomial Bsplines based collocation method for solving advectiondiffusion equation Appl. Math. Comput. (IF 3.5) Pub Date : 20240809
Mansi S. Palav, Vikas H. PradhanIn the present paper, uniform hyperbolic polynomial (UHP) Bspline based collocation method is proposed for solving advectiondiffusion equation (ADE) numerically. The VonNeumann's criterion is used to perform stability analysis. It reveals that the proposed scheme is unconditionally stable. The proposed method is implemented on various examples and numerical outcomes which are reported in table.

A social monitoring mechanism for thirdparty judges promotes cooperation in evolutionary games Appl. Math. Comput. (IF 3.5) Pub Date : 20240806
Qianxi Yang, Yanlong YangCorruption of thirdparty judges seriously undermines the level of cooperation. Without intervention, more corruptors and defectors would emerge, disrupting social harmony. Therefore, introducing an anticorruption mechanism is crucial for the evolution of cooperation. In this paper, we propose a social monitoring mechanism to monitor thirdparty judges so that their payoffs are affected by the proportions

Neural networks for bifurcation and linear stability analysis of steady states in partial differential equations Appl. Math. Comput. (IF 3.5) Pub Date : 20240806
Muhammad Luthfi Shahab, Hadi SusantoThis research introduces an extended application of neural networks for solving nonlinear partial differential equations (PDEs). A neural network, combined with a pseudoarclength continuation, is proposed to construct bifurcation diagrams from parameterized nonlinear PDEs. Additionally, a neural network approach is also presented for solving eigenvalue problems to analyze solution linear stability

The effect of nonlinear environmental feedback on the outcomes of evolutionary dynamics Appl. Math. Comput. (IF 3.5) Pub Date : 20240805
Jiaquan Huang, Yuying Zhu, Chengyi Xia, Jun TanimotoIn this paper, we construct a nonlinear evolutionary game model to analyze the cooperation mechanisms of the population based on a nonlinear relationship among environment and strategies. In the model, replicator dynamics and aspiration dynamics are used to explore the evolutionary outcomes of collective decision, respectively. The results suggest that the environment tends to become progressively

A generalization of the Laplace's method for integrals Appl. Math. Comput. (IF 3.5) Pub Date : 20240805
José L. López, Pedro J. Pagola, Pablo PalaciosIn López, Pagola and Perez (2009) we introduced a modification of the Laplace's method for deriving asymptotic expansions of Laplace integrals which simplifies the computations, giving explicit formulas for the coefficients of the expansion. On the other hand, motivated by the approximation of special functions with two asymptotic parameters, Nemes has generalized Laplace's method by considering Laplace

Spectral conditions for matching extension Appl. Math. Comput. (IF 3.5) Pub Date : 20240805
Jiadong Wu, Jing Wang, Liying KangA graph is called extendable if for any matching of size in , there exists a perfect matching of containing . Let and be the degree diagonal matrix and the adjacency matrix of , respectively. For , the spectral radius of is called the spectral radius of . In this paper, we give a sufficient condition for a graph to be extendable in terms of the spectral radius of and characterize the corresponding

Tensor robust principal component analysis with total generalized variation for highdimensional data recovery Appl. Math. Comput. (IF 3.5) Pub Date : 20240805
Zhi Xu, JingHua Yang, Chuanlong Wang, Fusheng Wang, Xihong YanIn the past few years, tensor robust principal component analysis (TRPCA) which is based on tensor singular value decomposition (tSVD) has got a lot of attention in recovering lowrank tensor corrupted by sparse noise. However, most TRPCA methods only consider the global structure of the image, ignoring the local details and sharp edge information of the image, resulting in the unsatisfactory restoration

Energytopeak quantized filtering for TS fuzzy systems with eventtriggeredbased weighted tryoncediscard protocol: The finitetime case Appl. Math. Comput. (IF 3.5) Pub Date : 20240805
JiJing Lu, Jun XiongThe paper addresses the issue of the finitetime energytopeak quantized filtering for TakagiSugeno (TS) fuzzy systems under eventtriggeredbased weighted tryoncediscard (WTOD) protocol, considering deception attacks in the network. To process the measurement output and schedule the transmission sequence for relieving the communication burden, a dynamic quantizer and an eventtriggeredbased

The conflictfree connection number and the minimum degreesum of graphs Appl. Math. Comput. (IF 3.5) Pub Date : 20240805
Trung Duy Doan, Thi Thanh Chau Do, Pham Hoang Ha, Ngoc Diep Pham, Ingo SchiermeyerIn the context of an edgecoloured graph , a path within the graph is deemed when a colour is exclusively applied to one of its edges. The presence of a conflictfree path connecting any two unique vertices of an edgecoloured graph is what defines it as . The , indicated by , is the fewest number of colours necessary to make conflictfree connected. Consider the subgraph of a connected graph , which

Complete solution to open problems on exponential augmented Zagreb index of chemical trees Appl. Math. Comput. (IF 3.5) Pub Date : 20240801
Sourav Mondal, Kinkar Chandra DasOne of the crucial problems in combinatorics and graph theory is characterizing extremal structures with respect to graph invariants from the family of chemical trees. Cruz et al. (2020) presented a unified approach to identify extremal chemical trees for degreebased graph invariants in terms of graph order. The exponential augmented Zagreb index () is a wellestablished graph invariant formulated

Fixation of cooperation in evolutionary games with environmental feedbacks Appl. Math. Comput. (IF 3.5) Pub Date : 20240731
Shaojie Lv, Jiaying Li, Changheng ZhaoThe interaction between strategy and environment widely exists in nature and society. Traditionally, evolutionary dynamics in finite populations are described by the Moran process, where the environment is constant. Therefore, we model the Moran process with environmental feedbacks. Our results show that the selection intensity, which is closely related to the population size, exerts varying influences

Nonlinear diffusion equation with a dynamic thresholdbased source for text binarization Appl. Math. Comput. (IF 3.5) Pub Date : 20240731
Zhongjie Du, Chuanjiang HeBinarization for degraded text images has always been a very challenging issue due to the variety and complexity of degradations. In this paper, we first construct a thresholding function for the input image in a local manner and then present an anisotropic diffusion equation with a source involving dynamic thresholding function. This dynamic thresholding function is governed by an auxiliary evolution

On transmissionirregular graphs and long pendent paths Appl. Math. Comput. (IF 3.5) Pub Date : 20240731
Ivan Damnjanović, Dragan Stevanović, Salem AlYakoobThe transmission of a vertex in a connected graph is the sum of distances from that vertex to all other vertices. A graph is transmissionirregular (TI) if no two of its vertices have the same transmission. Xu et al. (2023) recently asked to establish methods for constructing new TI graphs from the existing ones and also about the existence of chemical TI graphs on every even order. We show that, under

Stability analysis of explicit exponential Rosenbrock methods for stiff differential equations with constant delay Appl. Math. Comput. (IF 3.5) Pub Date : 20240730
Rui Zhan, Jinwei FangDelay differential equations have been used to model numerous phenomena in nature. We extend the previous work of one of the authors to analyze the stability properties of the explicit exponential Rosenbrock methods for stiff differential equations with constant delay. We first derive sufficient conditions so that the exponential Rosenbrock methods satisfy the desired stability property. We accomplish

Complex dynamic analysis of a big fishsmall fish system by using the Poincaré map Appl. Math. Comput. (IF 3.5) Pub Date : 20240730
Huidong Cheng, Wei Li, Tonghua ZhangIn terms of fishery management, if it is not managed carefully, it will lead to the extinction of the species and other unfavorable conditions. In order to strengthen the protection, development and rational utilization of fishery resources, this paper proposes a population capture model with state feedback control based on previous studies, in which the small fish is influenced by the Allee effect

Diverse selection intensities resolve the cooperation dilemma induced by breaking the symmetry between interaction and learning Appl. Math. Comput. (IF 3.5) Pub Date : 20240730
Wei Chen, Boyu Tao, Sheng Wang, Lin GengTraditionally, the evolution of cooperation on structured population assumed the uniform interaction partner between gaming and learning. Yet in realworld society, individuals often act different roles in which environments gaming partners differ from learning partners. This investigation studies the evolution of cooperation under the effects of the diverse selection intensity induced by network asymmetry

Effect of Qlearning on the evolution of cooperation behavior in collective motion: An improved Vicsek model Appl. Math. Comput. (IF 3.5) Pub Date : 20240730
Chengjie Wang, Juan Deng, Hui Zhao, Li LiThere have been numerous studies on collective behavior, among which communication between agents can have a great impact on both the payoff and the cost of making decisions. Research usually focuses on how to improve the collective synchronization rate or accelerate the process of cooperation under given communication cost constraints. In this context, evolutionary game theory (EGT) and reinforcement

Analysis of cooperative stability for reputation evaluation rules in spatial prisoner's dilemma game Appl. Math. Comput. (IF 3.5) Pub Date : 20240729
Qi Hu, Mengyu Zhou, Yulian Jiang, Xingwen LiuResearch on reputationbased indirect reciprocity has found profound achievements, elucidating its role in promoting cooperation over selfish actions. However, some evaluation methodologies have limitations, such as the image scoring model, a classic firstorder paradigm. Several studies have suggested that higherorder rules with more individual information can enhance the stability of cooperation

Grid anisotropy of propagation fronts in cellular automata and its reduction methods Appl. Math. Comput. (IF 3.5) Pub Date : 20240729
Jiali Ai, Chi Zhai, Hongyu Du, Yi Dang, Jindong Dai, Wei SunCellular Automata (CA) is a qualitative simulation method widely used in complex systems. However, the anisotropy of the bottom grid is influenced by the sharp boundary, which leads to the problem of gridinduced anisotropy. It not only makes the CA show the anisotropy in the simulation of isotropic propagation, but also produces errors in the simulation of anisotropic propagation. Through a simple

Extremal graphs with given parameters in respect of general ABS index Appl. Math. Comput. (IF 3.5) Pub Date : 20240726
Fengwei Li, Qingfang YeFor a graph , the general atombond sumconnectivity index is formulated by , where indicates the degree of vertex , can be arbitrary real number. Several physicochemical features of benzenoid hydrocarbons can be correctly anticipated using the index. Researchers go through careful inspection of some and reveal that , , , enjoy benefit in foreseeing the boiling point, the standard enthalpy of vaporization

Improving the conditioning of the Method of Fundamental Solutions for the Helmholtz equation on domains in polar or elliptic coordinates Appl. Math. Comput. (IF 3.5) Pub Date : 20240726
Pedro R.S. Antunes, Hernani Calunga, Pedro SerranhoA new approach to overcome the illconditioning of the Method of Fundamental Solutions (MFS) combining Singular Value Decomposition (SVD) and an adequate change of basis was introduced in as MFSSVD. The original formulation considered polar coordinates and harmonic polynomials as basis functions and is restricted to the Laplace equation in 2D. In this work, we start by adapting the approach to the

Variableorder fractional diffusion: Physical interpretation and simulation within the multiple trapping model Appl. Math. Comput. (IF 3.5) Pub Date : 20240726
Renat T. Sibatov, Pavel E. L'vov, HongGuang SunThe physical interpretation of a variableorder fractional diffusion equation within the framework of the multiple trapping model is presented. This interpretation enables the development of a numerical Monte Carlo algorithm to solve the associated subdiffusion equation. An important feature of the model is variation in energy density of localized states, when the detailed balance condition between