Estimation of multi-stress strength reliability under progressive first failure censoring using generalized inverted exponential distribution

A Markov Chain Monte Carlo technique for parameter estimation and inference in pesticide fate and transport modeling

The analysis of lifetime data under censoring schemes plays a vital role in reliability studies and survival analysis, where complete information is often difficult to obtain. This work focuses on the estimation of the parameters of the recently proposed generalized Kavya–Manoharan exponential (GKME) distribution under progressive Type-I interval censoring, a censoring scheme that frequently arises in medical and industrial life-testing experiments. Estimation procedures are developed under both classical and Bayesian paradigms, providing a comprehensive framework for inference. In the Bayesian setting, parameter estimation is carried out using Markov Chain Monte Carlo (MCMC) techniques under two distinct loss functions: the squared error loss function (SELF) and the general entropy loss function (GELF). For interval estimation, asymptotic confidence intervals as well as highest posterior density (HPD) credible intervals are constructed. The performance of the proposed estimators is systematically evaluated through a Monte Carlo simulation study in terms of mean squared error (MSE) and the average lengths of the interval estimates. The practical usefulness of the developed methodology is further demonstrated through the analysis of a real dataset on survival times of guinea pigs exposed to virulent tubercle bacilli. The findings indicate that the proposed methods provide flexible and efficient tools for analyzing progressively interval-censored lifetime data.

The Ideal Observer (IO) performance has been advocated when optimizing medical imaging systems for signal detection tasks. However, analytical computation of the IO test statistic is generally intractable. To approximate the IO test statistic, sampling-based methods that employ Markov-Chain Monte Carlo (MCMC) techniques have been developed. However, current applications of MCMC techniques have been limited to several object models such as a lumpy object model and a binary texture model, and it remains unclear how MCMC methods can be implemented with other more sophisticated object models. Deep learning methods that employ generative adversarial networks (GANs) hold great promise to learn stochastic object models (SOMs) from image data. In this study, we described a method to approximate the IO by applying MCMC techniques to SOMs learned by use of GANs. The proposed method can be employed with arbitrary object models that can be learned by use of GANs, thereby the domain of applicability of MCMC techniques for approximating the IO performance is extended. In this study, both signal-known-exactly (SKE) and signal-known-statistically (SKS) binary signal detection tasks are considered. The IO performance computed by the proposed method is compared to that computed by the conventional MCMC method. The advantages of the proposed method are discussed.

Appropriate models in biostatistics are often quite complicated. Such models are typically most easily fit using Bayesian methods, which can often be implemented using simulation techniques. Markov chain Monte Carlo (MCMC) methods are an important set of tools for such simulations. We give an overview and references of this rapidly emerging technology along with a relatively simple example. MCMC techniques can be viewed as extensions of iterative maximization techniques, but with random jumps rather than maximizations at each step. Special care is needed when implementing iterative maximization procedures rather than closed-form methods, and even more care is needed with iterative simulation procedures: it is substantially more difficult to monitor convergence to a distribution than to a point. The most reliable implementations of MCMC build upon results from simpler models fit using combinations of maximization algorithms and noniterative simulations, so that the user has a rough idea of the location and scale of the posterior distribution of the quantities of interest under the more complicated model. These concerns with implementation, however, should not deter the biostatistician from using MCMC methods, but rather help to ensure wise use of these powerful techniques.

This article estimates technical and allocative inefficiencies and increase in costs therefrom of individual firms using a translog cost system consisting of the cost function and the cost share equations. We call it a nonlinear random-effects system because technical and allocative inefficiencies are random (hence the term random effects) and are separated from the random noise terms appearing in each equation of the system, and because the inefficiency terms appear in the system in a highly nonlinear fashion, which helps in separating them from random errors. We use Bayesian inference procedures based on Markov chain Monte Carlo (MCMC) techniques to estimate the proposed system. Inferences on firm-specific technical inefficiency and both input-specific and firm-specific allocative inefficiencies are developed using MCMC techniques. We apply the new methods to a sample of 500 U.S. commercial banks. We focus on input allocation problem based on the assumption that banks minimize cost. Empirical results show that cost for the top (bottom) 10% of banks is increased by at least 3% (11%) due to technical inefficiency. In contrast, very few banks are found to be efficient in allocating all the inputs. Costs are increased by 13% on average due to input misallocation. Increase in costs due to both technical and allocative inefficiencies for the top (bottom) 10% of the banks is at least 11% (29%). When translated into dollar figures, this result indicates that elimination of technical and allocative inefficiencies would save the top (bottom) 10% of the banks more than $$.20 ($$3.56) million. We also find that none of the banks in our sample exceeded the efficient scale size, although most of them were operating near their optimum scale (unitary returns to scale).

Using the standard one-zone synchrotron self-Compton model and the Markov chain Monte Carlo (MCMC) technique, we systematically analyse the quasi-simultaneous multiwavelength spectral energy distributions (SEDs) of Mrk 421 and Mrk 501 during states of relatively low activity. With this model in place, a semi-analytical method is developed to examine the uncertainty in jet power estimation caused by degeneracy of the radiative models. The semi-analytical method, in combination with the MCMC technique, allows us to explore the jet properties over a wide range of the variability time-scale. Our results seem to support the following. (i) In both Mrk 421 and Mrk 501, the jets are powered by rapidly rotating black holes. The black hole spin in Mrk 501 could be lower than that in Mrk 421 or possibly they are equal under the assumption of the Blandford–Znajek mechanism. (ii) The energy losses, which could be used to form the large-scale radio structure, are important for reconciling the differences of the kinetic power derived from the observations of the large-scale structure and the SED fitting results. Moreover, the jet energy losses in the propagation are more significant for Mrk 501 than for Mrk 421.

PurposeThe application of statistical inversion theory provides a powerful approach for solving estimation problems including the ability for uncertainty quantification (UQ) by means of Markov chain Monte Carlo (MCMC) methods and Monte Carlo integration. This paper aims to analyze the application of a state reduction technique within different MCMC techniques to improve the computational efficiency and the tuning process of these algorithms.Design/methodology/approachA reduced state representation is constructed from a general prior distribution. For sampling the Metropolis Hastings (MH) Algorithm and the Gibbs sampler are used. Efficient proposal generation techniques and techniques for conditional sampling are proposed and evaluated for an exemplary inverse problem.FindingsFor the MH-algorithm, high acceptance rates can be obtained with a simple proposal kernel. For the Gibbs sampler, an efficient technique for conditional sampling was found. The state reduction scheme stabilizes the ill-posed inverse problem, allowing a solution without a dedicated prior distribution. The state reduction is suitable to represent general material distributions.Practical implicationsThe state reduction scheme and the MCMC techniques can be applied in different imaging problems. The stabilizing nature of the state reduction improves the solution of ill-posed problems. The tuning of the MCMC methods is simplified.Originality/valueThe paper presents a method to improve the solution process of inverse problems within the Bayesian framework. The stabilization of the inverse problem due to the state reduction improves the solution. The approach simplifies the tuning of MCMC methods.

<abstract><p>The Power Rayleigh distribution (PRD) is a new extension of the standard one-parameter Rayleigh distribution. To employ this distribution as a life model in the analysis of reliability and survival data, we focused on the statistical inference for the parameters of the PRD under the adaptive Type-II censored scheme. Point and interval estimates for the model parameters and the corresponding reliability function at a given time are obtained using likelihood, Bootstrap and Bayesian estimation methods. A simulation study is conducted in different settings of the life testing experiment to compare and evaluate the performance of the estimates obtained. In addition, the estimation procedure is also investigated in real lifetimes data. The results indicated that the obtained estimates gave an accurate and efficient estimation of the model parameters. The Bootstrap estimates are better than the estimates obtained by the likelihood estimation approach, and estimates obtained using the Markov Chain Monte Carlo method by the Bayesian approach under both the squared error and the general entropy loss functions have priority over other point and interval estimates. Under the adaptive Type-II censoring scheme, concluding results confirmed that the PRD can be effectively used to model the lifetimes in survival and reliability analysis.</p></abstract>

Performance modelling of web applications involves the task of estimating service demands of requests at physical resources, such as CPUs. In this paper, we propose a service demand estimation algorithm based on a Markov Chain Monte Carlo (MCMC) technique, Gibbs sampling. Our methodology is widely applicable as it requires only queue length samples at each resource, which are simple to measure. Additionally, since we use a Bayesian approach, our method can use prior information on the distribution of parameters, a feature not always available with existing demand estimation approaches. The main challenge of Gibbs sampling is to efficiently evaluate the conditional expression required to sample from the posterior distribution of the demands. This expression is shown to be the equilibrium solution of a multiclass closed queueing network. We define a novel approximation to efficiently obtain the normalising constant to make the cost of its evaluation acceptable for MCMC applications. Experimental evaluation based on simulation data with different model sizes demonstrates the effectiveness of Gibbs sampling for service demand estimation.

This paper presents a methodology for evaluating the time-dependent system reliability of a pressurised gas pipeline segment containing multiple active metal-loss corrosion defects. The methodology incorporates three distinctive failure modes of the pipe segment due to corrosion, namely small leak, large leak and rupture. The growth of the depth of individual corrosion defect is assumed to follow a power-law function of time. The Bayesian updating and Markov Chain Monte Carlo (MCMC) simulation techniques are used to quantify the parameters of the power-law growth model based on data obtained from multiple inspections carried out at different times. The simple Monte Carlo and MCMC techniques are combined to evaluate the system reliability. A numerical example involving an in-service gas pipeline located in Alberta, Canada, is used to illustrate the proposed methodology. Results of the sensitivity analysis suggest that the use of a defect-specific or segment-specific growth model for the defect depth has a marked impact on the evaluated system reliability. The proposed methodology can be incorporated in reliability-based pipeline corrosion management programmes to assist integrity engineers in making informed decisions about defect repair and mitigation.

Group Importance Sampling for particle filtering and MCMC

In this study, a comparison between three methods for estimating unknown parameters of the Kumaraswamy Weibull distribution for different sample sizes of type II censoring data is presented. Specifically, we compare the behaviors of maximum likelihood estimates, Lindley and Markov chain Monte Carlo (MCMC) estimates as Bayesian estimates. We have not found any work on this topic after reviews of the literature except one with little information about the inference of this important distribution. The simplest form for Lindley approximation of the posterior mean is proposed and approximate closed forms of acceptable Bayes estimates for the models of multi-parameters such as Kumaraswamy Weibull distribution is derived. A Monte Carlo simulation is conducted to investigate the performances of the proposed estimators. Finally, three real data examples are analyzed to illustrate the application possibility of the different proposed estimation methods. The results reveal that, although, good performance of the approximate forms of Lindley estimators, the estimators resulting in the MCMC technique are better in the sense of the mean squared errors.

Markov Chain Monte Carlo (MCMC) techniques, in the context of Bayesian inference, constitute a practical and effective tool to produce samples from an arbitrary distribution. These algorithms are applied to calculate parameter values of predictive models of the phenomenon of varying volatility in data time series. For this purpose, 3 such research models of time-varying volatility are simulated in STAN a probabilistic programming language for statistical inference. The accuracy of these models’ predictive function is confirmed by applying in data time series with known prior values. Moreover, Stan models’ performance is illustrated by the real stock prices of two shares in the stock market of New York. Finally, an Information Criterion of the results is applied to each model as well, to evaluate their predictive ability, comparing and selecting the most effective one. Keywords: MCMC, Time-series, Time-varying volatility models, STAN.

Global fits of physics models require efficient methods for exploring high-dimensional and/or multimodal posterior functions. We introduce a novel method for accelerating Markov Chain Monte Carlo (MCMC) sampling by pairing a Metropolis-Hastings algorithm with a diffusion model that can draw global samples with the aim of approximating the posterior. We briefly review diffusion models in the context of image synthesis before providing a streamlined diffusion model tailored towards low-dimensional data arrays. We then present our adapted Metropolis-Hastings algorithm which combines local proposals with global proposals taken from a diffusion model that is regularly trained on the samples produced during the MCMC run. Our approach leads to a significant reduction in the number of likelihood evaluations required to obtain an accurate representation of the Bayesian posterior across several analytic functions, as well as for a physical example based on a global analysis of parton distribution functions. Our method is extensible to other MCMC techniques, and we briefly compare our method to similar approaches based on normalizing flows. A code implementation can be found at https://github.com/NickHunt-Smith/MCMC-diffusion.

Count variables are often positively skewed and may include many zero observations, requiring specific statistical approaches. Interpreting abiotic factor changes in insect populations of crop pests, under this condition, can be difficult. The analysis becomes even more complicated because of possible temporal or spatial correlation, irregularly spaced data, heterogeneity over time, and zero inflation. Generalized additive models (GAM) are important tools to evaluate abiotic factors. Moreover, Markov chain Monte Carlo (MCMC) techniques can be used to fit a model that contains a temporal correlation structure, based on Bayesian statistics (BGAM). We compared methods of modeling the effects of temperature, precipitation, and time for the Brevicoryne brassicae (L.) population in Uberlândia, Brasil. We applied the proposed BGAM to the data, comparing this to the GAM model with and without autocorrelation for time, using the statistical programming language R. Analysis of deviance identified significant effects of the smoothers for precipitation and time on the frequentist models. With BGAM, the problem in variance estimations for precipitation and temperature from the previous models was solved. Furthermore, trace and density plots for population-level effects for all parameters converged well. The estimated smoothing curves showed a linear effect with an increase of precipitation, where lower precipitation indicated no presence of the aphid. The average temperature did not affect the aphid incidence. Autocorrelation was solved with ARMA structures, and the excess of zero was solved with zero-inflation models. The example of B. brassicae incidence showed how well abiotic (and biotic) factors can be modeled and analyzed using BGAM.