Search results for " Simulation"
showing 10 items of 4034 documents
Stochastic order characterization of uniform integrability and tightness
2013
We show that a family of random variables is uniformly integrable if and only if it is stochastically bounded in the increasing convex order by an integrable random variable. This result is complemented by proving analogous statements for the strong stochastic order and for power-integrable dominating random variables. Especially, we show that whenever a family of random variables is stochastically bounded by a p-integrable random variable for some p>1, there is no distinction between the strong order and the increasing convex order. These results also yield new characterizations of relative compactness in Wasserstein and Prohorov metrics.
On the use of asymptotic expansion in computing the null distribution of page's L-statistic
1989
Suppose that each out of n randomized complete blocks is obtained by observing a jointly continuous random variable taking values in Rk. Page's L-statistic is given then as a sum of i.i.d. lattice variables with finite moments of any order. Applying a well-known theorem on asymptotic expansions for the distribution function of such a sum yields higher order approximations to the significance probability of any observed value of L. The formula obtained by discarding terms smaller than o(n –1) is still very simple to use. Yet, due to it's strong analytical basis, it can be expected to provide substantial improvement on the traditional normal approximation. The results of extensive numerical i…
Local Spatial Log-Gaussian Cox Processes for seismic data
2022
AbstractIn this paper, we propose the use of advanced and flexible statistical models to describe the spatial displacement of earthquake data. The paper aims to account for the external geological information in the description of complex seismic point processes, through the estimation of models with space varying parameters. A local version of the Log-Gaussian Cox processes (LGCP) is introduced and applied for the first time, exploiting the inferential tools in Baddeley (Spat Stat 22:261–295, 2017), estimating the model by the local Palm likelihood. We provide methods and approaches accounting for the interaction among points, typically described by LGCP models through the estimation of th…
Maximum likelihood estimation for the exponential power function parameters
1995
This paper addresses the problem of obtaining maximum likelihood estimates for the three parameters of the exponential power function; the information matrix is derived and the covariance matrix is here presented; the regularity conditions which ensure asymptotic normality and efficiency are examined. A numerical investigation is performed for exploring the bias and variance of the maximum likelihood estimates and their dependence on sample size and shape parameter.
Large deviations results for subexponential tails, with applications to insurance risk
1996
AbstractConsider a random walk or Lévy process {St} and let τ(u) = inf {t⩾0 : St > u}, P(u)(·) = P(· | τ(u) < ∞). Assuming that the upwards jumps are heavy-tailed, say subexponential (e.g. Pareto, Weibull or lognormal), the asymptotic form of the P(u)-distribution of the process {St} up to time τ(u) is described as u → ∞. Essentially, the results confirm the folklore that level crossing occurs as result of one big jump. Particular sharp conclusions are obtained for downwards skip-free processes like the classical compound Poisson insurance risk process where the formulation is in terms of total variation convergence. The ideas of the proof involve excursions and path decompositions for Mark…
Multi-Phase epidemic model by a Markov chain
2008
Abstract In this paper we propose a continuous-time Markov chain to describe the spread of an infective and non-mortal disease into a community numerically limited and subjected to an external infection. We make a numerical simulation that shows tendencies for recurring epidemic outbreaks and for fade-out or extinction of the infection.
On 1-Laplacian Elliptic Equations Modeling Magnetic Resonance Image Rician Denoising
2015
Modeling magnitude Magnetic Resonance Images (MRI) rician denoising in a Bayesian or generalized Tikhonov framework using Total Variation (TV) leads naturally to the consideration of nonlinear elliptic equations. These involve the so called $1$-Laplacian operator and special care is needed to properly formulate the problem. The rician statistics of the data are introduced through a singular equation with a reaction term defined in terms of modified first order Bessel functions. An existence theory is provided here together with other qualitative properties of the solutions. Remarkably, each positive global minimum of the associated functional is one of such solutions. Moreover, we directly …
What we look at in paintings: A comparison between experienced and inexperienced art viewers
2016
How do people look at art? Are there any differences between how experienced and inexperienced art viewers look at a painting? We approach these questions by analyzing and modeling eye movement data from a cognitive art research experiment, where the eye movements of twenty test subjects, ten experienced and ten inexperienced art viewers, were recorded while they were looking at paintings. Eye movements consist of stops of the gaze as well as jumps between the stops. Hence, the observed gaze stop locations can be thought as a spatial point pattern, which can be modeled by a spatio-temporal point process. We introduce some statistical tools to analyze the spatio-temporal eye movement data, a…
Latin hypercube sampling with inequality constraints
2010
International audience; In some studies requiring predictive and CPU-time consuming numerical models, the sampling design of the model input variables has to be chosen with caution. For this purpose, Latin hypercube sampling has a long history and has shown its robustness capabilities. In this paper we propose and discuss a new algorithm to build a Latin hypercube sample (LHS) taking into account inequality constraints between the sampled variables. This technique, called constrained Latin hypercube sampling (cLHS), consists in doing permutations on an initial LHS to honor the desired monotonic constraints. The relevance of this approach is shown on a real example concerning the numerical w…
A computationally fast alternative to cross-validation in penalized Gaussian graphical models
2015
We study the problem of selection of regularization parameter in penalized Gaussian graphical models. When the goal is to obtain the model with good predicting power, cross validation is the gold standard. We present a new estimator of Kullback-Leibler loss in Gaussian Graphical model which provides a computationally fast alternative to cross-validation. The estimator is obtained by approximating leave-one-out-cross validation. Our approach is demonstrated on simulated data sets for various types of graphs. The proposed formula exhibits superior performance, especially in the typical small sample size scenario, compared to other available alternatives to cross validation, such as Akaike's i…