Ullas Chandran S V, Sandi Klavžar, P K Neethu, James Tuite
{"title":"Monophonic position sets of Cartesian and lexicographic products of graphs.","authors":"Ullas Chandran S V, Sandi Klavžar, P K Neethu, James Tuite","doi":"10.1007/s40314-026-03901-3","DOIUrl":"https://doi.org/10.1007/s40314-026-03901-3","url":null,"abstract":"<p><p>The general position problem in graph theory asks for the number of vertices in a largest set <i>S</i> of vertices of a graph <i>G</i> such that no shortest path of <i>G</i> contains more than two vertices of <i>S</i>. The analogous monophonic position problem is obtained from the general position problem by replacing \"shortest path\" by \"induced path.\" In this paper the monophonic position number is studied on Cartesian and lexicographic products of graphs. It is proved that in Cartesian products, a monophonic position set can only be in one of three canonical forms, named layered, varied, and cliquey. The monophonic position number of an arbitrary Cartesian product is bounded from below and above. The two bounds coincide if neither of the factors has simplicial vertices. A formula for the monophonic position number of a lexicographic product is given which only contains the clique number and the structure of monophonic sets of the second factor.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"46 2","pages":"44"},"PeriodicalIF":2.5,"publicationDate":"2027-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13569546/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148957296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Robin Kaiser, Ecaterina Sava-Huss, Julia Überbacher
{"title":"On the structure of the sandpile identity element on Sierpiński gasket graphs.","authors":"Robin Kaiser, Ecaterina Sava-Huss, Julia Überbacher","doi":"10.1007/s40314-026-03928-6","DOIUrl":"10.1007/s40314-026-03928-6","url":null,"abstract":"<p><p>We consider the identity of the abelian sandpile group of finite approximation graphs of the Sierpiński gasket, and we show that the second-order term in the scaling limit converges to the path distance to the nearest corner on the Sierpiński gasket. The proof relies on a decomposition of the identity of the sandpile group into the sum of a constant function and the Laplacian of the graph distance on the approximating graphs.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"46 2","pages":"79"},"PeriodicalIF":2.5,"publicationDate":"2027-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13675294/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149217307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Average height for Abelian sandpiles and the looping constant on Sierpiński graphs.","authors":"Nico Heizmann, Robin Kaiser, Ecaterina Sava-Huss","doi":"10.1007/s40314-025-03139-5","DOIUrl":"10.1007/s40314-025-03139-5","url":null,"abstract":"<p><p>For the Abelian sandpile model on Sierpiński graphs, we investigate several statistics such as average height, height probabilities and looping constant. In particular, we calculate the expected average height of a recurrent sandpile on the finite iterations of the Sierpiński gasket and we also give an algorithmic approach for calculating the height probabilities of recurrent sandpiles under stationarity by using the connection between recurrent configurations of the Abelian sandpile Markov chain and uniform spanning trees. We also calculate the expected fraction of vertices of height <i>i</i> for <math><mrow><mi>i</mi> <mo>∈</mo> <mo>{</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>}</mo></mrow> </math> of sandpiles under stationarity and relate the bulk average height to the looping constant on the Sierpiński gasket.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"44 5","pages":"227"},"PeriodicalIF":2.6,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11980430/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144027919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Two efficient nonlinear conjugate gradient methods for Riemannian manifolds","authors":"Nasiru Salihu, Poom Kumam, Sani Salisu","doi":"10.1007/s40314-024-02920-2","DOIUrl":"https://doi.org/10.1007/s40314-024-02920-2","url":null,"abstract":"<p>In this paper, we address some of the computational challenges associated with the RMIL+ conjugate gradient parameter by proposing an efficient conjugate gradient (CG) parameter along with its generalization to the Riemannian manifold. This parameter ensures the good convergence properties of the CG method in Riemannian optimization and it is formed by combining the structures of two classical CG methods. The extension utilizes the concepts of retraction and vector transport to establish sufficient descent property for the method via strong Wolfe line search conditions. Additionally, the scheme achieves global convergence using the scaled version of the Ring-Wirth nonexpansive condition. Finally, numerical experiments are conducted to validate the scheme’s effectiveness. We consider both unconstrained Euclidean optimization test problems and Riemannian optimization problems. The results reveal that the performance of the proposed method is significantly influenced by the choice of line search in both Euclidean and Riemannian optimizations.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"61 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142248028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On some extension of Traub–Steffensen type methods in Banach spaces","authors":"Bhavna, Saurabh Bhatia","doi":"10.1007/s40314-024-02925-x","DOIUrl":"https://doi.org/10.1007/s40314-024-02925-x","url":null,"abstract":"<p>In the present work, we construct a sixth order derivative free family without memory for solving nonlinear operator equations in Banach spaces. We further modify this to a ninth order family with memory without any additional functional evaluation. Local convergence analysis of both these methods have been studied using assumptions only on the first derivative. Numerical computations validate the theoretical results and show the superiority of our methods over the existing ones. Basins of attraction have also been presented to see the dynamical behaviour of the proposed methods.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"65 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142248033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new algorithm for approximating solutions of the common variational inclusion","authors":"Nguyen Thi Thu Thuy, Tran Thanh Tung, Le Xuan Ly","doi":"10.1007/s40314-024-02911-3","DOIUrl":"https://doi.org/10.1007/s40314-024-02911-3","url":null,"abstract":"<p>This paper studies the common variational inclusion problem in real Hilbert spaces. To solve this problem, we propose a new accelerated approach with two initial parameter steps and establish a strong convergence theorem. Our scheme combines the viscosity approximation method with Tseng’s forward backward-forward splitting method and uses self-adaptive step sizes. We simultaneously compute the inertial extrapolation and viscosity approximation at the first step of each iteration. We show that the iterative method converges strongly under conventional and appropriate assumptions. We also study some applications to the common minimum point problems, split feasibility problems, and to the least absolute selection and shrinkage operators (LASSO). Finally, we present two numerical results in Hilbert space and an application to the LASSO problem in order to illustrate the convergence analysis of the considered methods as well as compare our results to the related ones introduced by Cholamjiak et al. (J. Sci. Comput., 88(85), 2021) and Gibali and Thong (Calcolo, 55(49), 2018).</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"14 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142248029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Marwa Gamal, M. A. Zaky, M. El-Kady, M. Abdelhakem
{"title":"Chebyshev polynomial derivative-based spectral tau approach for solving high-order differential equations","authors":"Marwa Gamal, M. A. Zaky, M. El-Kady, M. Abdelhakem","doi":"10.1007/s40314-024-02908-y","DOIUrl":"https://doi.org/10.1007/s40314-024-02908-y","url":null,"abstract":"<p>In this paper, Chebyshev polynomial derivative-based spectral schemes are constricted for solving linear and non-linear ordinary differential equations. Linearization relation and some essential integrated formulae concerning the basis functions are provided to deal with the spectral tau method. Unlike the regular weight function, another modified weight is introduced. Also, different patterns and results have been obtained regarding the relation between the Jacobi polynomials, ultraspherical polynomials, Chebyshev polynomials, and their derivatives. Moreover, the algebraic systems of the spectral expansion for solving the Riccati, Lane–Emden equations, and water contamination model are discussed. Error bounds are introduced, studied, and proven. Finally, several real applications are numerically solved using 2ndDCh polynomial-based spectral tau method. The obtained results are compared with different methods to confirm the accuracy and efficiency of the schemes.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"9 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142248032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Neighbourhood and competition graphs under fuzzy incidence graph and its application","authors":"Sk Rabiul Islam, Madhumangal Pal","doi":"10.1007/s40314-024-02928-8","DOIUrl":"https://doi.org/10.1007/s40314-024-02928-8","url":null,"abstract":"<p>Competition graphs, which are mathematical representations of competitive relationships among entities, have found applications in various domains. This article introduces and explores several types of graphs, including fuzzy incidence competition graphs, fuzzy incidence neighborhood graphs, p-competition fuzzy incidence graphs, m-step fuzzy incidence competition graphs, and m-step fuzzy incidence neighborhood graphs. We establish sufficient conditions under which an edge is independent strong or independent incidence strong. Relation between competition graphs of isomorphic fuzzy incidence digraphs is established. Through rigorous analysis, several intriguing results concerning these graphs are derived. Additionally, at the end of the article, we evaluate a group of researchers using fuzzy incidence graphs to identify the most influential member within the group.\u0000</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"197 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142248031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Conditional stability and regularization method for inverse source for distributed order time-fractional diffusion equation","authors":"Yongbo Chen, Hao Cheng","doi":"10.1007/s40314-024-02924-y","DOIUrl":"https://doi.org/10.1007/s40314-024-02924-y","url":null,"abstract":"<p>This article is concerned with the problem of source identification for a distributed-order time-fractional diffusion equation (DTFDE). The uniqueness, ill-posedness and conditional stability estimate for the inverse source problem are demonstrated. Our main objective is to reconstruct the stable source term utilizing an iterative generalized quasi-reversibility method(IGQRM). In theory, an a priori and an a posteriori regularization parameter selection strategies are proposed to obtain the convergence estimates between the regularized solution and the exact solution. In numerical experiment, some numerical examples are presented to describe the stability and validity of our proposed regularization method.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"12 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142248035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Henri Mermoz Kouye, Gildas Mazo, Clémentine Prieur, Elisabeta Vergu
{"title":"Performing global sensitivity analysis on simulations of a continuous-time Markov chain model motivated by epidemiology","authors":"Henri Mermoz Kouye, Gildas Mazo, Clémentine Prieur, Elisabeta Vergu","doi":"10.1007/s40314-024-02897-y","DOIUrl":"https://doi.org/10.1007/s40314-024-02897-y","url":null,"abstract":"<p>In this paper we apply a methodology introduced in Navarro Jimenez et al. (J Chem Phys 145(24):244106, 2016) in the framework of chemical reaction networks to perform a global sensitivity analysis on simulations of a continuous-time Markov chain model motivated by epidemiology. Our goal is to quantify not only the effects of uncertain parameters such as epidemic parameters (transmission rate, mean sojourn duration in compartments), but also those of intrinsic randomness and interactions between epidemic parameters and intrinsic randomness. For that purpose, following what was proposed in Navarro Jimenez et al. (2016), we leverage three exact simulation algorithms for continuous-time Markov chains from the state of the art which we combine with common tools from variance-based sensitivity analysis as introduced in Sobol’ (Math Model Comput Exp 1:407–414, 1993). Also, we discuss the impact of the choice of the simulation algorithm used for the simulations on the results of sensitivity analysis. Such a discussion is new, at least to our knowledge. In a numerical section, we implement and compare three sensitivity analyses based on simulations obtained from different exact simulation algorithms of a SARS-CoV-2 epidemic model.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"9 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142248036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}