Rare Events in Random Geometric Graphs

This work introduces and compares approaches for estimating rare-event probabilities related to the number of edges in the random geometric graph on a Poisson point process. In the one-dimensional setting, we derive closed-form expressions for a variety of conditional probabilities related to the number of edges in the random geometric graph and develop conditional Monte Carlo algorithms for estimating rare-event probabilities on this basis. We prove rigorously a reduction in variance when compared to the crude Monte Carlo estimators and illustrate the magnitude of the improvements in a simulation study. In higher dimensions, we use conditional Monte Carlo to remove the fluctuations in the estimator coming from the randomness in the Poisson number of nodes. Finally, building on conceptual insights from large-deviations theory, we illustrate that importance sampling using a Gibbsian point process can further substantially reduce the estimation variance.

     

Parameter estimation in geometric process with Weibull distribution

We consider geometric process (GP) when the distribution of the first occurrence time of an event is assumed to be Weibull. Explicit estimators of the parameters in GP are derived by using the method of modified maximum likelihood (MML) proposed by Tiku [24]. Asymptotic distributions and consistency properties of these estimators are obtained. We show that our estimators are more efficient than the widely used modified moment (MM) estimators via Monte Carlo simulation study. Further, two real life examples are given at the end of the paper.     

Bivariate Birnbaum–Saunders distribution and associated inference

Univariate Birnbaum–Saunders distribution has been used quite effectively to model positively skewed data, especially lifetime data and crack growth data. In this paper, we introduce bivariate Birnbaum–Saunders distribution which is an absolutely continuous distribution whose marginals are univariate Birnbaum–Saunders distributions. Different properties of this bivariate Birnbaum–Saunders distribution are then discussed. This new family has five unknown parameters and it is shown that the maximum likelihood estimators can be obtained by solving two non-linear equations. We also propose simple modified moment estimators for the unknown parameters which are explicit and can therefore be used effectively as an initial guess for the computation of the maximum likelihood estimators. We then present the asymptotic distributions of the maximum likelihood estimators and use them to construct confidence intervals for the parameters. We also discuss likelihood ratio tests for some hypotheses of interest. Monte Carlo simulations are then carried out to examine the performance of the proposed estimators. Finally, a numerical data analysis is performed in order to illustrate all the methods of inference discussed here.     

Some closed form robust moment‐based estimators for the MEM(1,1)

In this paper, we extend the closed form moment estimator (ordinary MCFE) for the autoregressive conditional duration model given by Lu et al (2016) and propose some closed form robust moment‐based estimators for the multiplicative error model to deal with the additive and innovational outliers. The robustification of the closed form estimator is done by replacing the sample mean and sample autocorrelation with some robust estimators. These estimators are more robust than the quasi‐maximum likelihood estimator (QMLE) often used to estimate this model, and they are easy to implement and do not require the use of any numerical optimization procedure and the choice of initial value. The performance of our proposal in estimating the parameters and forecasting conditional mean μ_t of the MEM(1,1) process is compared with the proposals existing in the literature via Monte Carlo experiments, and the results of these experiments show that our proposal outperforms the ordinary MCFE, QMLE, and least absolute deviation estimator in the presence of outliers in general. Finally, we fit the price durations of IBM stock with the robust closed form estimators and the benchmarks and analyze their performances in estimating model parameters and forecasting the irregularly spaced intraday Value at Risk.     

Asymptotic representations for importance-sampling estimators of value-at-risk and conditional value-at-risk

Value-at-risk (VaR) and conditional value-at-risk (CVaR) are important risk measures. They are often estimated by using importance-sampling (IS) techniques. In this paper, we derive the asymptotic representations for IS estimators of VaR and CVaR. Based on these representations, we are able to prove the consistency and asymptotic normality of the estimators and to provide simple conditions under which the IS estimators have smaller asymptotic variances than the ordinary Monte Carlo estimators.     

A Nonparametric Test for Multiple Changes in the Mean of Independent Random Series

A nonparametric procedure is proposed to detect multiple changes in the mean of independent random series and the asymptotic distribution is derived. Simultaneously, the estimators for the locations of the change points are obtained. Moreover, the performance of the test is studied by Monte Carlo simulation, which demonstrates that the proposed test has high powers and good sizes for heavy-tailed innovations. Finally, the feasibility of the proposed test is illustrated by the application on the LBC data of stock prices.     

���ģ���һЩ�½�չ

??This review article introduces two recent advances in stochastic simulation: the construction of efficient algorithms for estimating rare events and the generation of samples from a stationary distribution that has no closed form. Estimating a very small quantity requires extreme accuracy to form a useful confidence interval. This makes the slowly convergent rare-event simulation a challenge task in both efficiency and accuracy. In this report, we introduce the examples of rare events of interest and the difficulties in estimating them. Various approaches to pursue robust and efficient estimators along the development are discussed and evaluated. Numerical experiments on estimating ruin probability are provided to show the quality of these approaches. In steady-state simulation, how to generate samples from a stationary stochastic process has long been the key subject. The common practice is to discard the data gathered during the initial transient period. However, how long the warm-up period must be raises another problem that has no satisfactory answer. Fortunately, by the development in the past two decades, exact simulation has become possible for certain stochastic models. In this report, we will introduce two important methods and related applications.     

Proportional hazards regression under progressive Type-II censoring

This paper proposes an inferential method for the semiparametric proportional hazards model for progressively Type-II censored data. We establish martingale properties of counting processes based on progressively Type-II censored data that allow to derive the asymptotic behavior of estimators of the regression parameter, the conditional cumulative hazard rate functions, and the conditional reliability functions. A Monte Carlo study and an example are provided to illustrate the behavior of our estimators and to compare progressive Type-II censoring sampling plans with classical Type-II right censoring sampling plan.     

���ɾʧ�����»��ָ���ֲ��Ĺ���

The hybrid censoring scheme is a mixture of type-I and type-II censoring schemes. It is a popular censoring scheme in the literature of life data analysis. Mixed exponential distribution (MED) models is a class of favorable models in reliability statistics. Nevertheless, there is no much discussion to focus on parameters estimation for MED models with hybrid censored samples. We will address this problem in this paper. The EM (Expectation-Maximization) algorithm is employed to derive the closed form of the maximum likelihood estimators (MLEs). Finally, Monte Carlo simulations and a real-world data analysis are conducted to illustrate the proposed method.     

Combinatorics of reliability Monte Carlo

We study one class of unbiased Monte Carlo estimators for system reliability, avoiding the rare event difficulty. This class is closely related to the system combinatorics and contains unique “extreme” members, having the minimum and maximum relative error. Some known Monte Carlo heuristics for network reliability, including fully polynomial cases, are of this type. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14: 329–343, 1999     

空间半参数变系数部分线性回归中的分位数估计

本文研究了空间数据变系数部分线性回归中的分位数估计. 模型中的参数估计量通过未知系数函数的分段多项式逼近得到, 而未知系数函数的估计量通过将参数估计量代入模型中并通过局部线性逼近得到. 文中推导了未知参数向量估计量的渐近分布, 并建立了未知系数函数估计量在内点及边界点的渐近分布. 通过Monte Carlo 模拟研究了估计量的有限样本性质.     

Minimum distance method for directional data and outlier detection

In this paper, we propose estimators based on the minimum distance for the unknown parameters of a parametric density on the unit sphere. We show that these estimators are consistent and asymptotically normally distributed. Also, we apply our proposal to develop a method that allows us to detect potential atypical values. The behavior under small samples of the proposed estimators is studied using Monte Carlo simulations. Two applications of our procedure are illustrated with real data sets.     

Rare event probabilities in stochastic networks

The paper is dealing with estimation of rare event probabilities in stochastic networks. The well known variance reduction technique, called Importance Sampling (IS) is an effective tool for doing this. The main idea of IS is to simulate the random system under a modified set of parameters, so as to make the occurrence of the rare event more likely. The major problem of the IS technique is that the optimal modified parameters, called reference parameters to be used in IS are usually very difficult to obtain. Rubinstein (Eur J Oper Res 99:89–112, 1997) developed the Cross Entropy (CE) method for the solution of this problem of IS technique and then he and his collaborators applied this for estimation of rare event probabilities in stochastic networks with exponential distribution [see De Boer et al. (Ann Oper Res 134:19–67, 2005)]. In this paper, we test this simulation technique also for medium sized stochastic networks and compare its effectiveness to the simple crude Monte Carlo (CMC) simulation. The effectiveness of a variance reduction simulation algorithm is measured in the following way. We calculate the product of the necessary CPU time and the estimated variance of the estimation. This product is compared to the same for the simple Crude Monte Carlo simulation. This was originally used for comparison of different variance reduction techniques by Hammersley and Handscomb (Monte Carlo Methods. Methuen & Co Ltd, London, 1967). The main result of the paper is the extension of CE method for estimation of rare event probabilities in stochastic networks with beta distributions. In this case the calculation of reference parameters of the importance sampling distribution requires numerical solution of a nonlinear equation system. This is done by applying a Newton–Raphson iteration scheme. In this case the CPU time spent for calculation of the reference parameter values cannot be neglected. Numerical results will also be presented. This work was supported by grant from the Hungarian National Scientific Research Grant OTKA T047340.     

Asymptotic Estimates of Finite-Time Ruin Probabilities with Dependent Risks and CMC Simulations

We consider a discrete-time risk model with dependence structures, where the claim-sizes \{X_n\}_{n\geq1} follow a one-sided linear process with independent and identically distributed (i.i.d.) innovations $\{\varepsilon_n\}_{n\geq1}$, and the innovations and financial risks form a sequence of independent and identically distributed copies of a random pair $(\varepsilon,Y)$ with dependent components. When the product \varepsilon Y has a heavy-tailed distribution, we establish some asymptotic estimates of the ruin probabilities in this discrete-time risk model. Finally, we use a Crude Monte Carlo (CMC) simulation to verify our results.     

Optimizing random scan Gibbs samplers

The Gibbs sampler is a popular Markov chain Monte Carlo routine for generating random variates from distributions otherwise difficult to sample. A number of implementations are available for running a Gibbs sampler varying in the order through which the full conditional distributions used by the Gibbs sampler are cycled or visited. A common, and in fact the original, implementation is the random scan strategy, whereby the full conditional distributions are updated in a randomly selected order each iteration. In this paper, we introduce a random scan Gibbs sampler which adaptively updates the selection probabilities or “learns” from all previous random variates generated during the Gibbs sampling. In the process, we outline a number of variations on the random scan Gibbs sampler which allows the practitioner many choices for setting the selection probabilities and prove convergence of the induced (Markov) chain to the stationary distribution of interest. Though we emphasize flexibility in user choice and specification of these random scan algorithms, we present a minimax random scan which determines the selection probabilities through decision theoretic considerations on the precision of estimators of interest. We illustrate and apply the results presented by using the adaptive random scan Gibbs sampler developed to sample from multivariate Gaussian target distributions, to automate samplers for posterior simulation under Dirichlet process mixture models, and to fit mixtures of distributions.     

Dimension Reduction in Regressions With Exponential Family Predictors

We present first methodology for dimension reduction in regressions with predictors that, given the response, follow one-parameter exponential families. Our approach is based on modeling the conditional distribution of the predictors given the response, which allows us to derive and estimate a sufficient reduction of the predictors. We also propose a method of estimating the forward regression mean function without requiring an explicit forward regression model. Whereas nearly all existing estimators of the central subspace are limited to regressions with continuous predictors only, our proposed methodology extends estimation to regressions with all categorical or a mixture of categorical and continuous predictors. Supplementary materials including the proofs and the computer code are available from the JCGS website.     

Efficient Simulation of Ruin Probabilities When Claims are Mixtures of Heavy and Light Tails

We consider the classical Cramér-Lundberg risk model with claim sizes that are mixtures of phase-type and subexponential variables. Exploiting a specific geometric compound representation, we propose control variate techniques to efficiently simulate the ruin probability in this situation. The resulting estimators perform well for both small and large initial capital. We quantify the variance reduction as well as the efficiency gain of our method over another fast standard technique based on the classical Pollaczek-Khinchine formula. We provide a numerical example to illustrate the performance, and show that for more time-consuming conditional Monte Carlo techniques, the new series representation also does not compare unfavorably to the one based on the Pollaczek-Khinchine formula.

     

多元正态分布的VDR条件拟合优度检验

提出多元正态性χ2检验统计量.多元正态分布转换样本Yd=RVd服从PearsonII型分布,证明了R2服从贝塔分布.基于贝塔分布和单位球均匀分布,得到多元正态性检验统计量χ2的渐近卡方分布.功效模拟显示,χ2统计量优于已有主要多元正态性检验统计量.做iris数据多元正态性的拟合优度检验.