Search results for "Uncertainty"
showing 10 items of 1010 documents
Deriving Reference Decisions
1998
To solve a statistical decision problem from a Bayesian viewpoint, the decision maker must specify a probability distribution on the parameter space, his prior distribution. In order to analyze the influence of this prior distribution on the solution of the problem, Bernardo (1981) proposed to compare the results with those that one would obtain by using that prior distribution which maximizes the useful experimental information, thus introducing the concept of reference decision. This definition is too involved for most of the problems usually found in practice. Here we analyze situations in which it is possible to simplify the definition of the reference decision, and we provide condition…
A more efficient second order blind identification method for separation of uncorrelated stationary time series
2016
The classical second order source separation methods use approximate joint diagonalization of autocovariance matrices with several lags to estimate the unmixing matrix. Based on recent asymptotic results, we propose a novel unmixing matrix estimator which selects the best lag set from a finite set of candidate sets specified by the user. The theory is illustrated by a simulation study.
Random dynamical system generated by the 3D Navier-Stokes equation with rough transport noise
2022
We consider the Navier-Stokes system in three dimensions perturbed by a transport noise which is sufficiently smooth in space and rough in time. The existence of a weak solution was proved recently, however, as in the deterministic setting the question of uniqueness remains a major open problem. An important feature of systems with uniqueness is the semigroup property satisfied by their solutions. Without uniqueness, this property cannot hold generally. We select a system of solutions satisfying the semigroup property with appropriately shifted rough path. In addition, the selected solutions respect the well accepted admissibility criterium for physical solutions, namely, maximization of th…
Broken ray transform on a Riemann surface with a convex obstacle
2014
We consider the broken ray transform on Riemann surfaces in the presence of an obstacle, following earlier work of Mukhometov. If the surface has nonpositive curvature and the obstacle is strictly convex, we show that a function is determined by its integrals over broken geodesic rays that reflect on the boundary of the obstacle. Our proof is based on a Pestov identity with boundary terms, and it involves Jacobi fields on broken rays. We also discuss applications of the broken ray transform.
Central Limit Theorem for Linear Eigenvalue Statistics for a Tensor Product Version of Sample Covariance Matrices
2017
For $$k,m,n\in {\mathbb {N}}$$ , we consider $$n^k\times n^k$$ random matrices of the form $$\begin{aligned} {\mathcal {M}}_{n,m,k}({\mathbf {y}})=\sum _{\alpha =1}^m\tau _\alpha {Y_\alpha }Y_\alpha ^T,\quad {Y}_\alpha ={\mathbf {y}}_\alpha ^{(1)}\otimes \cdots \otimes {\mathbf {y}}_\alpha ^{(k)}, \end{aligned}$$ where $$\tau _{\alpha }$$ , $$\alpha \in [m]$$ , are real numbers and $${\mathbf {y}}_\alpha ^{(j)}$$ , $$\alpha \in [m]$$ , $$j\in [k]$$ , are i.i.d. copies of a normalized isotropic random vector $${\mathbf {y}}\in {\mathbb {R}}^n$$ . For every fixed $$k\ge 1$$ , if the Normalized Counting Measures of $$\{\tau _{\alpha }\}_{\alpha }$$ converge weakly as $$m,n\rightarrow \infty $$…
A generalization of the Binomial distribution based on the dependence ratio
2014
We propose a generalization of the Binomial distribution, called DR-Binomial, which accommodates dependence among units through a model based on the dependence ratio (Ekholm et al., Biometrika, 82, 1995, 847). Properties of the DR-Binomial are discussed, and the constraints on its parameter space are studied in detail. Likelihood-based inference is presented, using both the joint and profile likelihoods; the usefulness of the DR-Binomial in applications is illustrated on a real dataset displaying negative unit-dependence, and hence under-dispersion compared with the Binomial. Although the DR-Binomial turns out to be a reparameterization of Altham's Additive-Binomial and Kupper–Haseman's Cor…
Algorithm AS 105: Fitting a Covariance Selection Model to a Matrix
1977
Statistical properties of a blind source separation estimator for stationary time series
2012
Abstract In this paper, we assume that the observed p time series are linear combinations of p latent uncorrelated weakly stationary time series. The problem is then, using the observed p -variate time series, to find an estimate for a mixing or unmixing matrix for the combinations. The estimated uncorrelated time series may then have nice interpretations and can be used in a further analysis. The popular AMUSE algorithm finds an estimate of an unmixing matrix using covariances and autocovariances of the observed time series. In this paper, we derive the limiting distribution of the AMUSE estimator under general conditions, and show how the results can be used for the comparison of estimate…
Uniform convergence and asymptotic confidence bands for model-assisted estimators of the mean of sampled functional data
2013
When the study variable is functional and storage capacities are limited or transmission costs are high, selecting with survey sampling techniques a small fraction of the observations is an interesting alternative to signal compression techniques, particularly when the goal is the estimation of simple quantities such as means or totals. We extend, in this functional framework, model-assisted estimators with linear regression models that can take account of auxiliary variables whose totals over the population are known. We first show, under weak hypotheses on the sampling design and the regularity of the trajectories, that the estimator of the mean function as well as its variance estimator …
Hydrokinetic simulations of nanoscopic precursor films in rough channels
2009
We report on simulations of capillary filling of high-wetting fluids in nano-channels with and without obstacles. We use atomistic (molecular dynamics) and hydrokinetic (lattice-Boltzmann) approaches which point out clear evidence of the formation of thin precursor films, moving ahead of the main capillary front. The dynamics of the precursor films is found to obey a square-root law as the main capillary front, z^2(t) ~ t, although with a larger prefactor, which we find to take the same value for the different geometries (2D-3D) under inspection. The two methods show a quantitative agreement which indicates that the formation and propagation of thin precursors can be handled at a mesoscopic…