On minimal directed strongly regular Cayley graphs over dihedral groups
Let G denote a dihedral group, where 1 is identity element and T ⊆ G ∖ { 1 }. We define T as minimal if T satisfies the condition 〈 T 〉 = G, and there is an element s ∈ T satisfying 〈 T ∖ { s , s − 1 } 〉 ≠ G. Within this manuscript, we achieve a ...
Highlights
- We introduce the concept of “minimal directed strongly regular Cayley graphs,” simplifying and enhancing the investigation process.
- This manuscript provides a comprehensive characterization of minimal directed strongly regular Cayley ...
A new second-order dynamical method for solving linear inverse problems in Hilbert spaces
A new second-order dynamic method (SODM) is proposed for solving ill-posed linear inverse problems in Hilbert spaces. The SODM can be viewed as a combination of Tikhonov regularization and second-order asymptotical regularization methods. As a ...
Highlights
- A new method involving a double-regularization-parameter strategy is proposed for solving linear inverse problems.
- The new method can be viewed as a combination of Tikhonov and second-order asymptotical regularization methods.
- The ...
Evolution of commitment in the spatial public goods game through institutional incentives
Studying social dilemmas prompts the question of how cooperation can emerge in situations where individuals are expected to act selfishly. Here, in the framework of the one-shot Public Goods Game (PGG), we introduce the concept that individuals ...
Highlights
- We study the effects of commitment in the spatial Public Goods Game with institutional punishment and reward.
- We found that cooperation is enhanced for even in the absence of incentives, due to new conditional cooperators.
- For ...
New results on the stability and stabilization for singular neutral systems with time delay
The stability issue and stabilization issue for a class of singular neutral systems are studied in this paper. Firstly, we give some sufficient conditions such that the considered open-looped systems are admissible. Secondly, we give some results ...
Highlights
- The singular neutral system that does not satisfy the restrictions presented in some papers is considered.
- The considered system contains the neutral delay and the state delay.
- This paper presents some sufficient conditions which ...
A variable gain impulsive observer for perturbed Lipschitz nonlinear systems with delayed discrete measurements
This paper addresses the impulsive observers design problem of perturbed Lipschitz nonlinear systems subject to noisy delayed discrete measurements. The transmission delay, state perturbation, and measurement noise simultaneously hinder the ...
Highlights
- A methodology for designing impulsive observers with delayed measurements and disturbances is proposed.
- Based on the augmented representation of the observation error system, a piecewise linear gain function is constructed.
- The ...
The positivity and event-triggered stabilization of Takagi-Sugeno fuzzy systems with actuator saturation
The positivity and event-triggered stabilization of Takagi-Sugeno fuzzy systems with actuator saturation are investigated in this paper. Different from the existing quadratic event-triggered mechanism (ETM), a linear ETM is constructed, which can ...
Highlights
- A linear ETM is proposed for positive TSFSs with actuator saturation.
- ETM-based sufficient conditions are proposed under the estimation of a certain DOA.
- ETM-based sufficient conditions are proposed under the estimation of the ...
Evolution of trust in the N-player trust game with the margin system
Investigations into trust behavior between investors and trustees using trust games have gained significant attention in recent years. However, understanding the process of trust evolution remains challenging. The margin system, widely employed ...
Highlights
- We propose an N-player trust game model that incorporates a margin system.
- Implementing the margin system can establish a stable coexistence state between investors and trustworthy trustees.
- Optimal margin proportions can ...
Heterogeneous interaction radius based on emotional dynamics can promote cooperation in spatial public goods games
The interaction radius is crucial in spatial evolutionary games, but previous studies have overlooked the dynamic nature of individuals adjusting their interaction circles based on their states. This manuscript investigates the impact of dynamic ...
Highlights
- Exploring the effects of emotion-based interaction range heterogeneity on cooperation in a spatial public goods game.
- The model investigates the impact of dynamic changes in interaction radius on cooperation, specifically examining the ...
Event-based asynchronous state estimation for Markov jump memristive neural networks
This study endeavors to address the problem of asynchronous state estimation for generalized Markov jump memristive neural networks in the presence of a piecewise homogeneous Markov process and a memory-based dynamic event-triggered protocol. To ...
Highlights
- A piecewise-homogeneous Markov process framework is established.
- Markov jump memristive neural network with time-varying connection weights is established.
- A novel state estimator with memory-based dynamic event-triggered protocol ...
Domination of triangulated discs and maximal outerplanar graphs
Given an infinite family of graphs, its domination ratio is the smallest real k such that for every large enough graph in the family, the ratio between its domination number and order is at most k. We give bounds for the domination ratios of ...
Highlights
- We give bounds for the domination ratio of various families of triangulated discs.
- We give a theorem on the domination number of tree-linked outerplanar graphs.
- We give an approach on how to efficiently dominate, given a ...
Linearisation techniques and the dual algorithm for a class of mixed singular/continuous control problems in reinsurance. Part II: Numerical aspects
This paper is intended as a companion to [12] and focuses on the numerical implementations of the method in the context of insurance problems with mixed controls: reinsurance acting as continuous control, and capital injection and dividend ...
Highlights
- We provide a validation of the Dual Linear Programming algorithm by showcasing its performance on two benchmarks.
- With a relatively modest order of moments (4), the relative errors are of at most 3%.
- Leveraging this algorithm ...
Dynamic output feedback control for CPSs under transmission delays and sparse malicious attacks
In this paper, we study a class of discrete-time cyber-physical systems (CPSs) with transmission delays and sparse malicious attacks on both input and output transmission channels, and present design methods for secure observer and controller. ...
Highlights
- In addition to the sparse attacks that occur in both input and output channels, this paper also considers the transmission delays in both channels.
- This paper introduces a multi-delay dynamic output feedback controller that transforms ...
Guaranteed cost event-triggered H ∞ control of uncertain linear system via output disturbance observer
This paper is concerned with anti-disturbance output feedback control of uncertain systems via dynamic guaranteed cost triggering mechanism. An output disturbance observer is constructed to attenuate matched disturbances and the mismatched one is ...
Highlights
- Compared with the state DOB [25], an output DOB is established firstly to reconstruct matched disturbances in input channels.
- A new dynamic ETM is put forward and contains [36] as a special case.
- A composite controller is ...
Computationally efficient orthogonalization for pairwise comparisons method
Orthogonalization is one of few mathematical methods conforming to mathematical standards for approximation. Finding a consistent PC matrix of a given an inconsistent PC matrix is the main goal of a pairwise comparisons method. We introduce an ...
Open problems on Sombor index of unicyclic and bicyclic graphs
Let Γ = ( V , E ) be a graph of order p. Recently, the Sombor index is introduced, defined as S O ( Γ ) = ∑ v i v j ∈ E ( Γ ) d Γ ( v i ) 2 + d Γ ( v j ) 2 , where d Γ ( v i ) is the degree of the vertex v i in Γ. Cruz and Rada [4] obtained an ...
Highlights
- Sombor index of a graph Γ is defined as S O ( Γ ) = ∑ v i v j ∈ E ( Γ ) d Γ ( v i ) 2 + d Γ ( v j ) 2 .
- To determine maximal graph over the set of unicyclic graphs with respect to Sombor index.
- To characterize the maximal bicyclic ...
Generalized extrapolation methods based on compositions of a basic 2nd-order scheme
We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization of ...
Highlights
- Framework of multiproduct integrators summarized and extended to generalized extrapolation methods.
- Generalized extrapolation methods studied in detail and order barriers elucidated.
- New methods with greater efficiency and higher-...
Adaptive tracking control for constrained nonlinear nonstrict-feedback switched stochastic systems with unknown control directions
This brief proposes a novel tracking control strategy to cope with the asymmetric state constraints for nonstrict-feedback and nonlinear switched stochastic systems with unknown control directions. Firstly, without requiring piecewise Barrier ...
Highlights
- A new tracking controller is presented for switched stochastic systems to manage asymmetric constraints without constructing the A-BLFs.
- The restrictive feasibility conditions are circumvented and the prerequisite of knowledge of ...
Statistical models of hospital patient fatality rates after accidental falls in children
Pediatric traumatic brain injuries represent a public health concern globally. Epidemiological studies are essential to understand their extent, uncover risk factors and outcome predictors, and establish efficient prevention policies. Etiological ...
Highlights
- Statistical models can help interpret epidemiological data related to pediatric brain injuries.
- Apparent discrepancies between hospital fatality rates after short versus long falls can be explained by statistical models.
- Hospital ...
Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks
Analysis on the link fault tolerability of multiprocessor systems plays a significance role in designing and optimizing for multiprocessor systems. The component edge-connectivity, as a generalization of the classical edge-connectivity, is a ...
Highlights
- c λ k ( P n ) for 1 ≤ k ≤ 2 n − 1 are obtained.
- The k-component edge-connectivity is a significant measurement for analyzing the reliability of multiprocessor systems.
- Use the edge isoperimetric method to investigate k-component ...
An efficient and accurate numerical method for the Bessel transform with an irregular oscillator and its error analysis
In this paper we present and analyze efficient numerical schemes for computing the Bessel transforms with an irregular oscillator. Especially in the presence of critical points, e.g., endpoints, zeros and stationary points for the general ...
Highlights
- New quadrature formulae for a class of Bessel transforms with an irregular oscillator.
- The accuracy improves drastically by increasing the frequency ω or adding nodes.
- High precision and high order of the error estimate.
On the weighted reverse cover cost of trees and unicyclic graphs with given diameter
For a vertex x of a connected graph G = ( V G , E G ), the weighted reverse cover cost of x is proposed as R C π G ( x ) = ∑ y ∈ V G d ( y ) H y x, where d ( y ) denotes the degree of y and H y x denotes the hitting time for random walk starting ...
Highlights
- Present the sharp lower bound of weighted reverse cover cost among all trees of order n and diameter d.
- Present the sharp upper bound of weighted reverse cover cost among all unicyclic graphs of order n and diameter d.
- Characterize ...
Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs
Let G be a simple connected graph with vertex set V ( G ) and edge set E ( G ). The resistance distance r ( u , v ) between two vertices u , v ∈ V ( G ) is the net effective resistance between them in the electric network constructed from G by ...
Repeated prisoner's dilemma games in multi-player structured populations with crosstalk
- Repeated PDG with crosstalk is studied within memory-one strategies.
- Cooperative and evolutionarily stable memory-one strategies are explored.
- WSLS and FBF effectively promote cooperation in game dynamics with crosstalk.
- The ...
Crosstalk represents a ubiquitous phenomenon in which strategic moves made in one game can influence actions in another. Reiter et al. [1] first integrated crosstalk with the repeated prisoner's dilemma model in structured populations. We extend ...
Matrix norm based hybrid Shapley and iterative methods for the solution of stochastic matrix games
In this paper, we present four alternative solution methods to Shapley iteration for the solution of stochastic matrix games. We first combine the extended matrix norm method for stochastic matrix games with Shapley iteration and then state and ...
Highlights
- Matrix norm-based methods are introduced for the solution of the stochastic matrix games.
- Weak and strong hybrid Shapley iterations are presented.
- The semi-EMN and iterative semi-EMN methods are introduced as analytic-solution-free ...
Cooperation emerged and survived in scale-free networks in co-evolution and betrayer-prevailing circumstances
How did cooperation emerge and persist while betrayal was beneficial for individuals? Previous studies suggested that network reciprocity was a promising explanation. However, these studies usually analyzed cooperation performances of different ...
Randomized progressive iterative approximation for B-spline curve and surface fittings
For large-scale data fitting, the least-squares progressive iterative approximation is a widely used method in many applied domains because of its intuitive geometric meaning and efficiency. In this work, we present a randomized progressive ...
Highlights
- Randomization techniques. Introducing randomization strategies into data fitting methods, such methods are easy to operate and have straightforward theoretical analysis.
- The local least squares solver. Our method is an approximate PIA ...
Injective edge chromatic number of sparse graphs
A k-edge coloring ϕ of graph G is injective if any two edges at distance 2 or in the same triangle get different colors. The minimum k in such an edge coloring is the injective edge chromatic number of G, written as χ i ′ ( G ). We prove in this ...
Highlights
- The results obtained in this paper enrich the previous work concerning on the study of injective coloring of sparse graphs.
- The discharging method used in this paper is especially useful to solve the problem of injective coloring.
- ...