Sufficient Conditions for Some Stochastic Orders of Discrete Random Variables with Applications in Reliability

In this paper we focus on providing sufficient conditions for some well-known stochastic orders in reliability but dealing with the discrete versions of them, filling a gap in the literature. In particular, we find conditions based on the unimodality of the likelihood ratio for the comparison in some stochastic orders of two discrete random variables. These results have interest in comparing discrete random variables because the sufficient conditions are easy to check when there are no closed expressions for the survival functions, which occurs in many cases. In addition, the results are applied to compare several parametric families of discrete distributions.

Robust Estimation Method Based on Function Model of Successive Approximation

In measurement practice, the residuals in least squares adjustment usually show various abnormal discrete distributions, including outliers, which is not conducive to the optimization of final measured values. Starting with the physical mechanism of dispersion and outlier of repeated observation errors, this paper puts forward the error correction idea of using the approximate function model of error to approach the actual function model of error step by step, gives a new theoretical method to optimize the final measured values, and proves the effectiveness of the algorithm by the ability of responding to the true values. This new idea is expected to be the ultimate answer of robust estimation theory.

Characterizations of Twenty (2020-2021) Proposed Discrete Distributions

In this paper, certain characterizations of twenty newly proposed discrete distributions: the discrete gen- eralized Lindley distribution of El-Morshedy et al.(2021), the discrete Gumbel distribution of Chakraborty et al.(2020), the skewed geometric distribution of Ong et al.(2020), the discrete Poisson X gamma distri- bution of Para et al.(2020), the discrete Cos-Poisson distribution of Bakouch et al.(2021), the size biased Poisson Ailamujia distribution of Dar and Para(2021), the generalized Hermite-Genocchi distribution of El-Desouky et al.(2021), the Poisson quasi-xgamma distribution of Altun et al.(2021a), the exponentiated discrete inverse Rayleigh distribution of Mashhadzadeh and MirMostafaee(2020), the Mlynar distribution of Fr¨uhwirth et al.(2021), the flexible one-parameter discrete distribution of Eliwa and El-Morshedy(2021), the two-parameter discrete Perks distribution of Tyagi et al.(2020), the discrete Weibull G family distribution of Ibrahim et al.(2021), the discrete Marshall–Olkin Lomax distribution of Ibrahim and Almetwally(2021), the two-parameter exponentiated discrete Lindley distribution of El-Morshedy et al.(2019), the natural discrete one-parameter polynomial exponential distribution of Mukherjee et al.(2020), the zero-truncated discrete Akash distribution of Sium and Shanker(2020), the two-parameter quasi Poisson-Aradhana distribution of Shanker and Shukla(2020), the zero-truncated Poisson-Ishita distribution of Shukla et al.(2020) and the Poisson-Shukla distribution of Shukla and Shanker(2020) are presented to complete, in some way, the au- thors’ works.

Stochastic rumors on random trees

The Maki–Thompson rumor model is defined by assuming that a population represented by a graph is subdivided into three classes of individuals; namely, ignorants, spreaders and stiflers. A spreader tells the rumor to any of its nearest ignorant neighbors at rate one. At the same rate, a spreader becomes a stifler after a contact with other nearest neighbor spreaders, or stiflers. In this work we study the model on random trees. As usual we define a critical parameter of the model as the critical value around which the rumor either becomes extinct almost-surely or survives with positive probability. We analyze the existence of phase-transition regarding the survival of the rumor, and we obtain estimates for the mean range of the rumor. The applicability of our results is illustrated with examples on random trees generated from some well-known discrete distributions.

Quantum communication complexity of distribution testing

The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over $[n]$, and the goal is to decide whether their two distributions are equal, or are $\epsilon$-far apart in the $l_1$-distance. In the present paper we show that the quantum communication complexity of this problem is $\tilde{O}(n/(t\epsilon^2))$ qubits when the distributions have low $l_2$-norm, which gives a quadratic improvement over the classical communication complexity obtained by Andoni, Malkin and Nosatzki. We also obtain a matching lower bound by using the pattern matrix method. Let us stress that the samples received by each of the parties are classical, and it is only communication between them that is quantum. Our results thus give one setting where quantum protocols overcome classical protocols for a testing problem with purely classical samples.

The Exponentiated Burr–Hatke Distribution and Its Discrete Version: Reliability Properties with CSALT Model, Inference and Applications

Continuous and discrete distributions are essential to model both continuous and discrete lifetime data in several applied sciences. This article introduces two extended versions of the Burr–Hatke model to improve its applicability. The first continuous version is called the exponentiated Burr–Hatke (EBuH) distribution. We also propose a new discrete analog, namely the discrete exponentiated Burr–Hatke (DEBuH) distribution. The probability density and the hazard rate functions exhibit decreasing or upside-down shapes, whereas the reversed hazard rate function. Some statistical and reliability properties of the EBuH distribution are calculated. The EBuH parameters are estimated using some classical estimation techniques. The simulation results are conducted to explore the behavior of the proposed estimators for small and large samples. The applicability of the EBuH and DEBuH models is studied using two real-life data sets. Moreover, the maximum likelihood approach is adopted to estimate the parameters of the EBuH distribution under constant-stress accelerated life-tests (CSALTs). Furthermore, a real data set is analyzed to validate our results under the CSALT model.

Testing for goodness rather than lack of fit of continuous probability distributions

The vast majority of testing procedures presented in the literature as goodness-of-fit tests fail to accomplish what the term is promising. Actually, a significant result of such a test indicates that the true distribution underlying the data differs substantially from the assumed model, whereas the true objective is usually to establish that the model fits the data sufficiently well. Meeting that objective requires to carry out a testing procedure for a problem in which the statement that the deviations between model and true distribution are small, plays the role of the alternative hypothesis. Testing procedures of this kind, for which the term tests for equivalence has been coined in statistical usage, are available for establishing goodness-of-fit of discrete distributions. We show how this methodology can be extended to settings where interest is in establishing goodness-of-fit of distributions of the continuous type.

Synthetic topology in Homotopy Type Theory for probabilistic programming

The ALEA Coq library formalizes measure theory based on a variant of the Giry monad on the category of sets. This enables the interpretation of a probabilistic programming language with primitives for sampling from discrete distributions. However, continuous distributions have to be discretized because the corresponding measures cannot be defined on all subsets of their carriers. This paper proposes the use of synthetic topology to model continuous distributions for probabilistic computations in type theory. We study the initial σ-frame and the corresponding induced topology on arbitrary sets. Based on these intrinsic topologies, we define valuations and lower integrals on sets and prove versions of the Riesz and Fubini theorems. We then show how the Lebesgue valuation, and hence continuous distributions, can be constructed.