The joint signatures of binary-state and multi-state (semi-coherent or mixed) systems with i.i.d. (independent and identically distributed) binary-state components are considered in this work. For the comparison of pairs of binary-state systems of different sizes, transformation formulas of their joint signatures are derived by using the concept of equivalent systems and a generalized triangle rule for order statistics. Similarly, for facilitating the comparison of pairs of multi-state systems of different sizes, transformation formulas of their multi-state joint signatures are also derived. Some examples are finally presented to illustrate and to verify the theoretical results established here.

The process of software testing usually involves the correction of a detected bug immediately upon detection. In this article, in contrast, we discuss continuous time testing of a software with periodic debugging in which bugs are corrected, instead of at the instants of their detection, at some pre-specified time points. Under the assumption of renewal distribution for the time between successive occurrence of a bug, maximum-likelihood estimation of the initial number of bugs in the software is considered, when the renewal distribution belongs to any general parametric family or is arbitrary. The asymptotic properties of the estimated model parameters are also discussed. Finally, we investigate the finite sample properties of the estimators, specially that of the number of initial number of bugs, through simulation.

New computing and communications paradigms will result in traffic loads in information server systems that fluctuate over much broader ranges of time scales than current systems. In addition, these fluctuation time scales may only be indirectly known or even be unknown. However, we should still be able to accurately design and manage such systems. This paper addresses this issue: we consider an M/M/1 queueing system operating in a random environment (denoted M/M/1(R)) that alternates between HIGH and LOW phases, where the load in the HIGH phase is higher than in the LOW phase. Previous work on the performance characteristics of M/M/1(R) systems established fundamental properties of the shape of performance curves. In this paper, we extend monotonicity results to include convexity and concavity properties, provide a partial answer to an open problem on stochastic ordering, develop new computational techniques, and include boundary cases and various degenerate M/M/1(R) systems. The basis of our results are novel representations for the mean number in system and the probability of the system being empty. We then apply these results to analyze practical aspects of system operation and design; in particular, we derive the optimal service rate to minimize mean system cost and provide a bias analysis of the use of customer-level sampling to estimate time-stationary quantities.

Inaccuracy and information measures based on cumulative residual entropy are quite useful and have attracted considerable attention in many fields including reliability theory. Using a point process martingale approach and a compensator version of Kumar and Taneja's generalized inaccuracy measure of two nonnegative continuous random variables, we define here an inaccuracy measure between two coherent systems when the lifetimes of their common components are observed. We then extend the results to the situation when the components in the systems are subject to failure according to a double stochastic Poisson process.

A software release game was formulated by Zeephongsekul and Chiera [Zeephongsekul, P. & Chiera, C. (1995). Optimal software release policy based on a two-person game of timing. Journal of Applied Probability 32: 470–481] and was reconsidered by Dohi et al. [Dohi, T., Teraoka, Y., & Osaki, S. (2000). Software release games. Journal of Optimization Theory and Applications 105(2): 325–346] in a framework of two-person nonzero-sum games. In this paper, we further point out the faults in the above literature and revisit the Nash equilibrium strategies in the software release games from the viewpoints of both silent and noisy type of games. It is shown that the Nash equilibrium strategies in the silent and noisy of software release games exist under some parametric conditions.

Most of the real-life populations are heterogeneous and homogeneity is often just a simplifying assumption for the relevant statistical analysis. Mixtures of lifetime distributions that correspond to homogeneous subpopulations were intensively studied in the literature. Various distributional and stochastic properties of finite and continuous mixtures were discussed. In this paper, following recent publications, we develop further a mixture concept in the form of the generalized α-mixtures that include all mixture models that are widely explored in the literature. We study some main stochastic properties of the suggested mixture model, that is, aging and appropriate stochastic comparisons. Some relevant examples and counterexamples are given to illustrate our findings.

The study of the distributions of sums of dependent risks is a key topic in actuarial sciences, risk management, reliability and in many branches of applied and theoretical probability. However, there are few results where the distribution of the sum of dependent random variables is available in a closed form. In this paper, we obtain several analytical expressions for the distribution of the aggregated risks under dependence in terms of copulas. We provide several representations based on the underlying copula and the marginal distribution functions under general hypotheses and in any dimension. Then, we study stochastic comparisons between sums of dependent risks. Finally, we illustrate our theoretical results by studying some specific models obtained from Clayton, Ali-Mikhail-Haq and Farlie-Gumbel-Morgenstern copulas. Extensions to more general copulas are also included. Bounds and the limiting behavior of the hazard rate function for the aggregated distribution of some copulas are studied as well.

Nakamoto doublespend strategy, described in Bitcoin foundational article, leads to total ruin with positive probability. The simplest strategy that avoids this risk incorporates a stopping threshold when success is unlikely. We compute the exact profitability and the minimal double spend that is profitable for this strategy. For a given amount of the transaction, we determine the minimal number of confirmations to be requested by the recipient that makes the double-spend strategy non-profitable. This number of confirmations is only 1 or 2 for average transactions and for a small relative hashrate of the attacker. This is substantially lower than the original Nakamoto number, which is about six confirmations and is widely used. Nakamoto analysis is only based on the success probability of the attack instead of on a profitability analysis that we carry out.

In this paper, we consider a history-dependent mixed shock model which is a combination of the history-dependent extreme shock model and the history-dependent $\delta$-shock model. We assume that shocks occur according to the generalized Pólya process that contains the homogeneous Poisson process, the non-homogeneous Poisson process and the Pólya process as the particular cases. For the defined survival model, we derive the corresponding survival function, the mean lifetime and the failure rate. Further, we study the asymptotic and monotonicity properties of the failure rate. Finally, some applications of the proposed model have also been included with relevant numerical examples.

We bound the error for the normal approximation of the number of triangles in the Erdős–Rényi random graph with respect to the Kolmogorov metric. Our bounds match the best available Wasserstein bounds obtained by Barbour et al. [(1989). A central limit theorem for decomposable random variables with applications to random graphs. Journal of Combinatorial Theory, Series B 47: 125–145], resolving a long-standing open problem. The proofs are based on a new variant of the Stein–Tikhomirov method—a combination of Stein's method and characteristic functions introduced by Tikhomirov [(1976). The rate of convergence in the central limit theorem for weakly dependent variables. Vestnik Leningradskogo Universiteta 158–159, 166].

We construct a high-order conditional distance covariance, which generalizes the notation of conditional distance covariance. The joint conditional distance covariance is defined as a linear combination of conditional distance covariances, which can capture the joint relation of many random vectors given one vector. Furthermore, we develop a new method of conditional independence test based on the joint conditional distance covariance. Simulation results indicate that the proposed method is very effective. We also apply our method to analyze the relationships of PM2.5 in five Chinese cities: Beijing, Tianjin, Jinan, Tangshan and Qinhuangdao by the Gaussian graphical model.

von Neumann [(1951). Various techniques used in connection with random digits. National Bureau of Standards Applied Math Series 12: 36–38] introduced a simple algorithm for generating independent unbiased random bits by tossing a (possibly) biased coin with unknown bias. While his algorithm fails to attain the entropy bound, Peres [(1992). Iterating von Neumann's procedure for extracting random bits. The Annals of Statistics 20(1): 590–597] showed that the entropy bound can be attained asymptotically by iterating von Neumann's algorithm. Let $b(n,p)$ denote the expected number of unbiased bits generated when Peres’ algorithm is applied to an input sequence consisting of the outcomes of $n$ tosses of the coin with bias $p$. With $p=1/2$, the coin is unbiased and the input sequence consists of $n$ unbiased bits, so that $n-b(n,1/2)$ may be referred to as the cost incurred by Peres’ algorithm when not knowing $p=1/2$. We show that $\lim _{n\to \infty }\log [n-b(n,1/2)]/\log n =\theta =\log [(1+\sqrt {5})/2]$ (where $\log$ is the logarithm to base $2$), which together with limited numerical results suggests that $n-b(n,1/2)$ may be a regularly varying sequence of index $\theta$. (A positive sequence $\{L(n)\}$ is said to be regularly varying of index $\theta$ if $\lim _{n\to \infty }L(\lfloor \lambda n\rfloor )/L(n)=\lambda ^\theta$ for all $\lambda > 0$, where $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) Some open problems on the asymptotic behavior of $nh(p)-b(n,p)$ are briefly discussed where $h(p)=-p\log p- (1-p)\log (1-p)$ denotes the Shannon entropy of a random bit with bias $p$.

In a classical chess round-robin tournament, each of $n$ players wins, draws, or loses a game against each of the other $n-1$ players. A win rewards a player with 1 points, a draw with 1/2 point, and a loss with 0 points. We are interested in the distribution of the scores associated with ranks of $n$ players after ${{n \choose 2}}$ games, that is, the distribution of the maximal score, second maximum, and so on. The exact distribution for a general $n$ seems impossible to obtain; we obtain a limit distribution.

This paper establishes a new version of integration by parts formula of Markov chains for sensitivity computation, under much lower restrictions than the existing researches. Our approach is more fundamental and applicable without using Girsanov theorem or Malliavin calculus as did by past papers. Numerically, we apply this formula to compute sensitivity regarding the transition rate matrix and compare with a recent research by an IPA (infinitesimal perturbation analysis) method and other approaches.

This paper relaxes assumptions defining multivariate Brownian motion (BM) to construct processes with dependent increments as tractable models for problems in engineering and management science. We show that any Gaussian Markov process starting at zero and possessing stationary increments and a symmetric smooth kernel has a parametric kernel of a particular form, and we derive the unique unbiased, jointly sufficient, maximum-likelihood estimators of those parameters. As an application, we model a single-server queue driven by such a process and derive its transient distribution conditional on its history.

This paper considers optimal admission and routing control in multi-class service systems in which customers can either receive quality regular service which is subject to congestion or can receive congestion-free but less desirable service at an alternative service station, which we call the self-service station. We formulate the problem within the Markov decision process framework and focus on characterizing the structure of dynamic optimal policies which maximize the expected long-run rewards. For this, value function and sample path arguments are used. The congestion sensitivity of customers is modeled with class-independent holding costs at the regular service station. The results show how the admission rewards of customer classes affect their priorities at the regular and self-service stations. We explore that the priority for regular service may not only depend on regular service admission rewards of classes but also on the difference between regular and self-service admission rewards. We show that optimal policies have monotonicity properties, regarding the optimal decisions of individual customer classes such that they divide the state space into three connected regions per class.

In this paper, we mainly study a class of small deviation theorems for Markov chains indexed by an infinite tree with uniformly bounded degree in Markovian environment. Firstly, we give the definition of Markov chains indexed by a tree with uniformly bounded degree in random environment. Then, we introduce the some lemmas which are the basis of the results. Finally, a class of small deviation theorems for functionals of random fields on a tree with uniformly bounded degree in Markovian environment is established.

In this article, we derive a closed-form pricing formula for catastrophe equity put options under a stochastic interest rate framework. A distinguishing feature of the proposed solution is its simplified form in contrast to several recently published formulae that require evaluating several layers of infinite sums of $n$-fold convoluted distribution functions. As an application of the proposed formula, we consider two different frameworks and obtain the closed-form formula for the joint characteristic function of the asset price and the losses, which is the only required ingredient in our pricing formula. The prices obtained by the newly derived formula are compared with those obtained using Monte-Carlo simulations to show the accuracy of our formula.

Consider a multidimensional risk model, in which an insurer simultaneously confronts m (m ≥ 2) types of claims sharing a common non-stationary and non-renewal arrival process. Assuming that the claims arrival process satisfies a large deviation principle and the claim-size distributions are heavy-tailed, asymptotic estimates for two common types of ruin probabilities for this multidimensional risk model are obtained. As applications, we give two examples of the non-stationary point process: a Hawkes process and a Cox process with shot noise intensity, and asymptotic ruin probabilities are obtained for these two examples.

In order to understand queueing performance given only partial information about the model, we propose determining intervals of likely values of performance measures given that limited information. We illustrate this approach for the mean steady-state waiting time in the $GI/GI/K$ queue. We start by specifying the first two moments of the interarrival-time and service-time distributions, and then consider additional information about these underlying distributions, in particular, a third moment and a Laplace transform value. As a theoretical basis, we apply extremal models yielding tight upper and lower bounds on the asymptotic decay rate of the steady-state waiting-time tail probability. We illustrate by constructing the theoretically justified intervals of values for the decay rate and the associated heuristically determined interval of values for the mean waiting times. Without extra information, the extremal models involve two-point distributions, which yield a wide range for the mean. Adding constraints on the third moment and a transform value produces three-point extremal distributions, which significantly reduce the range, producing practical levels of accuracy.