Search results for "Statistics & Probability"

Simulation of BSDEs with jumps by Wiener Chaos Expansion

2016

International audience; We present an algorithm to solve BSDEs with jumps based on Wiener Chaos Expansion and Picard's iterations. This paper extends the results given in Briand-Labart (2014) to the case of BSDEs with jumps. We get a forward scheme where the conditional expectations are easily computed thanks to chaos decomposition formulas. Concerning the error, we derive explicit bounds with respect to the number of chaos, the discretization time step and the number of Monte Carlo simulations. We also present numerical experiments. We obtain very encouraging results in terms of speed and accuracy.

On delocalization of eigenvectors of random non-Hermitian matrices

2019

We study delocalization of null vectors and eigenvectors of random matrices with i.i.d entries. Let $A$ be an $n\times n$ random matrix with i.i.d real subgaussian entries of zero mean and unit variance. We show that with probability at least $1-e^{-\log^{2} n}$ $$ \min\limits_{I\subset[n],\,|I|= m}\|{\bf v}_I\| \geq \frac{m^{3/2}}{n^{3/2}\log^Cn}\|{\bf v}\| $$ for any real eigenvector ${\bf v}$ and any $m\in[\log^C n,n]$, where ${\bf v}_I$ denotes the restriction of ${\bf v}$ to $I$. Further, when the entries of $A$ are complex, with i.i.d real and imaginary parts, we show that with probability at least $1-e^{-\log^{2} n}$ all eigenvectors of $A$ are delocalized in the sense that $$ \min\l…

Donsker-Type Theorem for BSDEs: Rate of Convergence

2019

In this paper, we study in the Markovian case the rate of convergence in Wasserstein distance when the solution to a BSDE is approximated by a solution to a BSDE driven by a scaled random walk as introduced in Briand, Delyon and Mémin (Electron. Commun. Probab. 6 (2001) Art. ID 1). This is related to the approximation of solutions to semilinear second order parabolic PDEs by solutions to their associated finite difference schemes and the speed of convergence. peerReviewed

A PHASE TRANSITION FOR LARGE VALUES OF BIFURCATING AUTOREGRESSIVE MODELS

2019

We describe the asymptotic behavior of the number $$Z_n[a_n,\infty )$$ of individuals with a large value in a stable bifurcating autoregressive process, where $$a_n\rightarrow \infty $$ . The study of the associated first moment is equivalent to the annealed large deviation problem of an autoregressive process in a random environment. The trajectorial behavior of $$Z_n[a_n,\infty )$$ is obtained by the study of the ancestral paths corresponding to the large deviation event together with the environment of the process. This study of large deviations of autoregressive processes in random environment is of independent interest and achieved first. The estimates for bifurcating autoregressive pr…

Reference Posterior Distributions for Bayesian Inference

1979

Estimation of total electricity consumption curves by sampling in a finite population when some trajectories are partially unobserved

2019

International audience; Millions of smart meters that are able to collect individual load curves, that is, electricity consumption time series, of residential and business customers at fine scale time grids are now deployed by electricity companies all around the world. It may be complex and costly to transmit and exploit such a large quantity of information, therefore it can be relevant to use survey sampling techniques to estimate mean load curves of specific groups of customers. Data collection, like every mass process, may undergo technical problems at every point of the metering and collection chain resulting in missing values. We consider imputation approaches (linear interpolation, k…

On powerful exact nonrandomized tests for the Poisson two-sample setting.

2020

In the case of two independent samples from Poisson distributions, the natural target parameter for hypothesis testing is the ratio of the two population means. The conditional tests which have been derived for this class of problems already in the 1940s are well known to be optimal in terms of power only when randomized decisions between hypotheses are admitted at the boundary of the respective rejection regions. The major objective of this contribution is to show how the approach used by Boschloo in 1970 for constructing a powerful nonrandomized version of Fisher’s exact test for hypotheses about the odds ratio between two binomial parameters can successfully be adapted for the Poisson c…

Fourth Moments and Independent Component Analysis

2015

In independent component analysis it is assumed that the components of the observed random vector are linear combinations of latent independent random variables, and the aim is then to find an estimate for a transformation matrix back to these independent components. In the engineering literature, there are several traditional estimation procedures based on the use of fourth moments, such as FOBI (fourth order blind identification), JADE (joint approximate diagonalization of eigenmatrices), and FastICA, but the statistical properties of these estimates are not well known. In this paper various independent component functionals based on the fourth moments are discussed in detail, starting wi…

Deducing self-interaction in eye movement data using sequential spatial point processes

2016

Eye movement data are outputs of an analyser tracking the gaze when a person is inspecting a scene. These kind of data are of increasing importance in scientific research as well as in applications, e.g. in marketing and man-machine interface planning. Thus the new areas of application call for advanced analysis tools. Our research objective is to suggest statistical modelling of eye movement sequences using sequential spatial point processes, which decomposes the variation in data into structural components having interpretation. We consider three elements of an eye movement sequence: heterogeneity of the target space, contextuality between subsequent movements, and time-dependent behaviou…

GAMLSS for high-variability data: an application to liver fibrosis case

2020

In this paper, we propose management of the problem caused by overdispersed data by applying the generalized additive model for location, scale and shape framework (GAMLSS) as introduced by Rigby and Stasinopoulos (2005). The idea of using a GAMLSS approach for handling our problem comes from the idea of Aitkin (1996) consisting in the use of an EM maximum likelihood estimation algorithm (Dempster, Laird, and Rubin, 1977) to deal with overdispersed generalized linear models (GLM). As in the GLM case, the algorithm is initially derived as a form of Gaussian quadrature assuming a normal mixing distribution. The GAMLSS specification allows the extension of the Aitkin algorithm to probability d…