Search results for "Statistics & Probability"
showing 10 items of 436 documents
A note on Malliavin smoothness on the Lévy space
2017
We consider Malliavin calculus based on the Itô chaos decomposition of square integrable random variables on the Lévy space. We show that when a random variable satisfies a certain measurability condition, its differentiability and fractional differentiability can be determined by weighted Lebesgue spaces. The measurability condition is satisfied for all random variables if the underlying Lévy process is a compound Poisson process on a finite time interval. peerReviewed
The Induced Smoothed lasso: A practical framework for hypothesis testing in high dimensional regression.
2020
This paper focuses on hypothesis testing in lasso regression, when one is interested in judging statistical significance for the regression coefficients in the regression equation involving a lot of covariates. To get reliable p-values, we propose a new lasso-type estimator relying on the idea of induced smoothing which allows to obtain appropriate covariance matrix and Wald statistic relatively easily. Some simulation experiments reveal that our approach exhibits good performance when contrasted with the recent inferential tools in the lasso framework. Two real data analyses are presented to illustrate the proposed framework in practice.
Selecting the tuning parameter in penalized Gaussian graphical models
2019
Penalized inference of Gaussian graphical models is a way to assess the conditional independence structure in multivariate problems. In this setting, the conditional independence structure, corresponding to a graph, is related to the choice of the tuning parameter, which determines the model complexity or degrees of freedom. There has been little research on the degrees of freedom for penalized Gaussian graphical models. In this paper, we propose an estimator of the degrees of freedom in $$\ell _1$$ -penalized Gaussian graphical models. Specifically, we derive an estimator inspired by the generalized information criterion and propose to use this estimator as the bias term for two informatio…
Clusters of effects curves in quantile regression models
2018
In this paper, we propose a new method for finding similarity of effects based on quantile regression models. Clustering of effects curves (CEC) techniques are applied to quantile regression coefficients, which are one-to-one functions of the order of the quantile. We adopt the quantile regression coefficients modeling (QRCM) framework to describe the functional form of the coefficient functions by means of parametric models. The proposed method can be utilized to cluster the effect of covariates with a univariate response variable, or to cluster a multivariate outcome. We report simulation results, comparing our approach with the existing techniques. The idea of combining CEC with QRCM per…
Nonlinear parametric quantile models
2020
Quantile regression is widely used to estimate conditional quantiles of an outcome variable of interest given covariates. This method can estimate one quantile at a time without imposing any constraints on the quantile process other than the linear combination of covariates and parameters specified by the regression model. While this is a flexible modeling tool, it generally yields erratic estimates of conditional quantiles and regression coefficients. Recently, parametric models for the regression coefficients have been proposed that can help balance bias and sampling variability. So far, however, only models that are linear in the parameters and covariates have been explored. This paper …
On the stability and ergodicity of adaptive scaling Metropolis algorithms
2011
The stability and ergodicity properties of two adaptive random walk Metropolis algorithms are considered. The both algorithms adjust the scaling of the proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of the algorithms, the adapted scaling parameter is not constrained within a predefined compact interval. The first algorithm is based on scale adaptation only, while the second one incorporates also covariance adaptation. A strong law of large numbers is shown to hold assuming that the target density is smooth enough and has either compact support or super-exponentially decaying tails.
Testing for local structure in spatiotemporal point pattern data
2017
The detection of clustering structure in a point pattern is one of the main focuses of attention in spatiotemporal data mining. Indeed, statistical tools for clustering detection and identification of individual events belonging to clusters are welcome in epidemiology and seismology. Local second-order characteristics provide information on how an event relates to nearby events. In this work, we extend local indicators of spatial association (known as LISA functions) to the spatiotemporal context (which will be then called LISTA functions). These functions are then used to build local tests of clustering to analyse differences in local spatiotemporal structures. We present a simulation stud…
Quantitative ergodicity for some switched dynamical systems
2012
International audience; We provide quantitative bounds for the long time behavior of a class of Piecewise Deterministic Markov Processes with state space Rd × E where E is a finite set. The continuous component evolves according to a smooth vector field that switches at the jump times of the discrete coordinate. The jump rates may depend on the whole position of the process. Under regularity assumptions on the jump rates and stability conditions for the vector fields we provide explicit exponential upper bounds for the convergence to equilibrium in terms of Wasserstein distances. As an example, we obtain convergence results for a stochastic version of the Morris-Lecar model of neurobiology.
Stochastic ordering of classical discrete distributions
2010
For several pairs $(P,Q)$ of classical distributions on $\N_0$, we show that their stochastic ordering $P\leq_{st} Q$ can be characterized by their extreme tail ordering equivalent to $ P(\{k_\ast \})/Q(\{k_\ast\}) \le 1 \le \lim_{k\to k^\ast} P(\{k\})/Q(\{k\})$, with $k_\ast$ and $k^\ast$ denoting the minimum and the supremum of the support of $P+Q$, and with the limit to be read as $P(\{k^\ast\})/Q(\{k^\ast\})$ for $k^\ast$ finite. This includes in particular all pairs where $P$ and $Q$ are both binomial ($b_{n_1,p_1} \leq_{st} b_{n_2,p_2}$ if and only if $n_1\le n_2$ and $(1-p_1)^{n_1}\ge(1-p_2)^{n_2}$, or $p_1=0$), both negative binomial ($b^-_{r_1,p_1}\leq_{st} b^-_{r_2,p_2}$ if and on…
An extended continuous mapping theorem for outer almost sure weak convergence
2019
International audience; We prove an extended continuous mapping theorem for outer almost sure weak convergence in a metric space, a notion that is used in bootstrap empirical processes theory. Then we make use of those results to establish the consistency of several bootstrap procedures in empirical likelihood theory for functional parameters.