首页 OALib 期刊 OALib 预印 快速投稿通道 排名 新闻 我的图书馆 常见问题 关于我们 关注我们+
 标题 关键字 摘要 作者 全部

 第1页/共100条 每页显示 5 10 20 条
 Statistics , 2013, Abstract: We propose a semiparametric method for fitting the tail of a heavy-tailed population given a relatively small sample from that population and a larger sample from a related background population. We model the tail of the small sample as an exponential tilt of the better-observed large-sample tail, using a robust sufficient statistic motivated by extreme value theory. In particular, our method induces an estimator of the small-population mean, and we give theoretical and empirical evidence that this estimator outperforms methods that do not use the background sample. We demonstrate substantial efficiency gains over competing methods in simulation and on data from a large controlled experiment conducted by Facebook.
 Mathematics , 2014, Abstract: We consider several different models for generating random fractals including random self-similar sets, random self-affine carpets, and fractal percolation. In each setting we compute either the \emph{almost sure} or the \emph{Baire typical} Assouad dimension and consider some illustrative examples. Our results reveal a common phenomenon in all of our models: the Assouad dimension of a randomly generated fractal is generically as big as possible and does not depend on the measure theoretic or topological structure of the sample space. This is in stark contrast to the other commonly studied notions of dimension like the Hausdorff or packing dimension.
 Peter Reimann Statistics , 2008, DOI: 10.1007/s10955-008-9576-1 Abstract: Consider a mixed quantum mechanical state, describing a statistical ensemble in terms of an arbitrary density operator $\rho$ of low purity, $\tr\rho^2\ll 1$, and yielding the ensemble averaged expectation value $\tr(\rho A)$ for any observable $A$. Assuming that the given statistical ensemble $\rho$ is generated by randomly sampling pure states $|\psi>$ according to the corresponding so-called Gaussian adjusted projected measure $[$Goldstein et al., J. Stat. Phys. 125, 1197 (2006)$]$, the expectation value $<\psi|A|\psi>$ is shown to be extremely close to the ensemble average $\tr(\rho A)$ for the overwhelming majority of pure states $|\psi>$ and any experimentally realistic observable $A$. In particular, such a `typicality' property holds whenever the Hilbert space $\hr$ of the system contains a high dimensional subspace $\hr_+\subset\hr$ with the property that all $|\psi>\in\hr_+$ are realized with equal probability and all other $|\psi> \in\hr$ are excluded.
 Mathematics , 2012, Abstract: This paper presents new results concerning the observer design for wide classes of nonlinear systems with both sampled and delayed measurements. By using a small gain approach we provide sufficient conditions, which involve both the delay and the sampling period, ensuring exponential convergence of the observer system error. The proposed observer is robust with respect to measurement errors and perturbations of the sampling schedule. Moreover, new results on the robust global exponential state predictor design problem are provided, for wide classes of nonlinear systems.
 Computer Science , 2015, Abstract: We consider the matrix completion problem of recovering a structured matrix from noisy and partial measurements. Recent works have proposed tractable estimators with strong statistical guarantees for the case where the underlying matrix is low--rank, and the measurements consist of a subset, either of the exact individual entries, or of the entries perturbed by additive Gaussian noise, which is thus implicitly suited for thin--tailed continuous data. Arguably, common applications of matrix completion require estimators for (a) heterogeneous data--types, such as skewed--continuous, count, binary, etc., (b) for heterogeneous noise models (beyond Gaussian), which capture varied uncertainty in the measurements, and (c) heterogeneous structural constraints beyond low--rank, such as block--sparsity, or a superposition structure of low--rank plus elementwise sparseness, among others. In this paper, we provide a vastly unified framework for generalized matrix completion by considering a matrix completion setting wherein the matrix entries are sampled from any member of the rich family of exponential family distributions; and impose general structural constraints on the underlying matrix, as captured by a general regularizer $\mathcal{R}(.)$. We propose a simple convex regularized $M$--estimator for the generalized framework, and provide a unified and novel statistical analysis for this general class of estimators. We finally corroborate our theoretical results on simulated datasets.
 Mathematics , 2014, Abstract: Sparse signals can be recovered from a reduced set of samples by using compressive sensing algorithms. In common methods the signal is recovered in the sparse domain. A method for the reconstruction of sparse signal which reconstructs the remaining missing samples/measurements is recently proposed. The available samples are fixed, while the missing samples are considered as minimization variables. Recovery of missing samples/measurements is done using an adaptive gradient-based algorithm in the time domain. A new criterion for the parameter adaptation in this algorithm, based on the gradient direction angles, is proposed. It improves the algorithm computational efficiency. A theorem for the uniqueness of the recovered signal for given set of missing samples (reconstruction variables) is presented. The case when available samples are a random subset of a uniformly or nonuniformly sampled signal is considered in this paper. A recalculation procedure is used to reconstruct the nonuniformly sampled signal. The methods are illustrated on statistical examples.
 Hiroyuki Masuyama Statistics , 2012, Abstract: This paper considers the tail asymptotics for a cumulative process $\{B(t); t \ge 0\}$ sampled at a heavy-tailed random time $T$. The main contribution of this paper is to establish several sufficient conditions for the asymptotic equality ${\sf P}(B(T) > bx) \sim {\sf P}(M(T) > bx) \sim {\sf P}(T>x)$ as $x \to \infty$, where $M(t) = \sup_{0 \le u \le t}B(u)$ and $b$ is a certain positive constant. The main results of this paper can be used to obtain the subexponential asymptotics for various queueing models in Markovian environments. As an example, using the main results, we derive subexponential asymptotic formulas for the loss probability of a single-server finite-buffer queue with an on/off arrival process in a Markovian environment.
 Physics , 2011, DOI: 10.1103/PhysRevB.85.214435 Abstract: We analyze the thermalization properties and the validity of the Eigenstate Thermalization Hypothesis in a generic class of quantum Hamiltonians where the quench parameter explicitly breaks a Z_2 symmetry. Natural realizations of such systems are given by random matrices expressed in a block form where the terms responsible for the quench dynamics are the off-diagonal blocks. Our analysis examines both dense and sparse random matrix realizations of the Hamiltonians and the observables. Sparse random matrices may be associated with local quantum Hamiltonians and they show a different spread of the observables on the energy eigenstates with respect to the dense ones. In particular, the numerical data seems to support the existence of rare states, i.e. states where the observables take expectation values which are different compared to the typical ones sampled by the micro-canonical distribution. In the case of sparse random matrices we also extract the finite size behavior of two different time scales associated with the thermalization process.
 Liviu Ixaru Mathematics and its Applications : Annals of the Academy of Romanian Scientists , 2011, Abstract: We present the main elements of the exponential fitting techniquefor building up linear approximation formulae. We cover the two maincomponents of this technique, that is the error analysis and the wayin which the coefficients of the new formulae can be determined. Wepresent briefly the recently developed error analysis of Coleman andIxaru, whose main result is that the error of the formulae based on the exponential fitting (ef, for short) is a sum of two Lagrange-like terms, in contrast to the case of the classical formulae where it consists of a single term. For application we consider the case of two quadrature formulae (extended Newton-Cotes and Gauss), which are indistinguishable in the frame of the traditional error analysis, to find out that the Gauss rule is more accurate. As for the determination of the coefficients, we show how the ef procedure can be applied for deriving formulae of classical type. We re-obtain wellknown formulae and also derive some new ones.
 Mathematics , 2015, Abstract: We prove a functional central limit theorem for partial sums of symmetric stationary long range dependent heavy tailed infinitely divisible processes with a certain type of negative dependence. Previously only positive dependence could be treated. The negative dependence involves cancellations of the Gaussian second order. This leads to new types of limiting processes involving stable random measures, due to heavy tails, Mittag-Leffler processes, due to long memory, and Brownian motions, due to the Gaussian second order cancellations.
 第1页/共100条 每页显示 5 10 20 条