We study three classes of shock models governed by an inverse gamma mixed Poisson process (IGMP), namely a mixed Poisson process with an inverse gamma mixing distribution. In particular, we analyze (1) the extreme shock model, (2) the δ-shock model, and the (3) cumulative shock model. For the latter, we assume a constant and an exponentially distributed random threshold and consider different choices for the distribution of the amount of damage caused by a single shock. For all the treated cases, we obtain the survival function, together with the expected value and the variance of the failure time. Some properties of the inverse gamma mixed Poisson process are also disclosed.

In this paper, we introduce a novel way to quantify the remaining inaccuracy of order statistics by utilizing the concept of extropy. We explore various properties and characteristics of this new measure. Additionally, we expand the notion of inaccuracy for ordered random variables to a dynamic version and demonstrate that this dynamic information measure provides a unique determination of the distribution function. Moreover, we investigate specific lifetime distributions by analyzing the residual inaccuracy of the first-order statistics. Nonparametric kernel estimation of the proposed measure is suggested. Simulation results show that the kernel estimator with bandwidth selection using the cross-validation method has the best performance. Finally, an application of the proposed measure on the model selection is provided.

We study 2-stage game-theoretic problem oriented 3-stage service policy computing, convolutional neural network (CNN) based algorithm design, and simulation for a blockchained buffering system with federated learning. More precisely, based on the game-theoretic problem consisting of both “win-lose” and “win-win” 2-stage competitions, we derive a 3-stage dynamical service policy via a saddle point to a zero-sum game problem and a Nash equilibrium point to a non-zero-sum game problem. This policy is concerning users-selection, dynamic pricing, and online rate resource allocation via stable digital currency for the system. The main focus is on the design and analysis of the joint 3-stage service policy for given queue/environment state dependent pricing and utility functions. The asymptotic optimality and fairness of this dynamic service policy is justified by diffusion modeling with approximation theory. A general CNN based policy computing algorithm flow chart along the line of the so-called big model framework is presented. Simulation case studies are conducted for the system with three users, where only two of the three users can be selected into the service by a zero-sum dual cost game competition policy at a time point. Then, the selected two users get into service and share the system rate service resource through a non-zero-sum dual cost game competition policy. Applications of our policy in the future blockchain based Internet (e.g., metaverse and web3.0) and supply chain finance are also briefly illustrated.

This article considers the individual equilibrium behavior and socially optimal strategy in a fluid queue with two types of parallel customers and incomplete fault. Assume that the working state and the incomplete fault state appear alternately in the buffer. Different from the linear revenue and expenditure structure, an exponential utility function can be constructed to obtain the equilibrium balking thresholds in the fully observable case. Besides, the steady-state probability distribution and the corresponding expected social benefit are derived based on the renewal process and the standard theory of linear ordinary differential equations. Furthermore, a reasonable entrance fee strategy is discussed under the condition that the fluid accepts the globally optimal strategies. Finally, the effects of the diverse system parameters on the entrance fee and the expected social benefit are explicitly illustrated by numerical comparisons.

We consider the propagation of a stochastic SIR-type epidemic in two connected populations: a relatively small local population of interest which is surrounded by a much larger external population. External infectives can temporarily enter the small population and contribute to the spread of the infection inside this population. The rules for entry of infectives into the small population as well as their length of stay are modeled by a general Markov queueing system. Our main objective is to determine the distribution of the total number of infections within both populations. To do this, the approach we propose consists of deriving a family of martingales for the joint epidemic processes and applying classical stopping time or convergence theorems. The study then focuses on several particular cases where the external infection is described by a linear branching process and the entry of external infectives obeys certain specific rules. Some of the results obtained are illustrated by numerical examples.

In this paper, we compare the entropy of the original distribution and its corresponding compound distribution. Several results are established based on convex order and relative log-concave order. The necessary and sufficient condition for a compound distribution to be log-concave is also discussed, including compound geometric distribution, compound negative binomial distribution and compound binomial distribution.

We provide general expressions for the joint distributions of the k most significant b-ary digits and of the k leading continued fraction (CF) coefficients of outcomes of arbitrary continuous random variables. Our analysis highlights the connections between the two problems. In particular, we give the general convergence law of the distribution of the jth significant digit, which is the counterpart of the general convergence law of the distribution of the jth CF coefficient (Gauss-Kuz’min law). We also particularise our general results for Benford and Pareto random variables. The former particularisation allows us to show the central role played by Benford variables in the asymptotics of the general expressions, among several other results, including the analogue of Benford’s law for CFs. The particularisation for Pareto variables—which include Benford variables as a special case—is especially relevant in the context of pervasive scale-invariant phenomena, where Pareto variables occur much more frequently than Benford variables. This suggests that the Pareto expressions that we produce have wider applicability than their Benford counterparts in modelling most significant digits and leading CF coefficients of real data. Our results may find practical application in all areas where Benford’s law has been previously used.