相关论文: An asymptotic approximation for the permanent of a…
Large and moderate deviation probabilities play an important role in many applied areas, such as insurance and risk analysis. This paper studies the exact moderate and large deviation asymptotics in non-logarithmic form for linear processes…
We consider a stable but nearly unstable autoregressive process of any order. The bridge between stability and instability is expressed by a time-varying companion matrix $A_{n}$ with spectral radius $\rho(A_{n}) < 1$ satisfying…
Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated, in particular when X 1 is not…
We show that the mixed discriminant of $n$ positive semidefinite $n \times n$ real symmetric matrices can be approximated within a relative error $\epsilon >0$ in quasi-polynomial $n^{O(\ln n -\ln \epsilon)}$ time, provided the distance of…
Exact integral expressions of the skew orthogonal polynomials involved in Orthogonal (beta=1) and Symplectic (beta=4) random matrix ensembles are obtained: the (even rank) skew orthogonal polynomials are average characteristic polynomials…
This paper presents new sufficient conditions for convergence and asymptotic or exponential stability of a stochastic discrete-time system, under which the constructed Lyapunov function always decreases in expectation along the system's…
In this paper, we consider directly estimating the eigenvalues of precision matrix, without inverting the corresponding estimator for the eigenvalues of covariance matrix. We focus on a general asymptotic regime, i.e., the large dimensional…
By application of the theory for second-order linear differential equations with two turning points developed in \cite{Olver1975}, uniform asymptotic approximations are obtained for the Lam\'{e} and Mathieu functions with a large real…
We prove relative asymptotic for the ratio of two sequences of multiple orthogonal polynomials with respect to Nikishin system of measures. The first Nikishin system ${\mathcal{N}}(\sigma_1,...,\sigma_m)$ is such that for each $k$,…
In an earlier paper, we discussed the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that…
This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…
Viewing a two time scale stochastic approximation scheme as a noisy discretization of a singularly perturbed differential equation, we obtain a concentration bound for its iterates that captures its behavior with quantifiable high…
For affine stochastic differential equation with uniformly distributed time delay the local asymptotic properties of the likelihood function are studied. Local asymptotic normality, local asymptotic mixed normality, periodic local…
Estimation of covariance matrices or their inverses plays a central role in many statistical methods. For these methods to work reliably, estimated matrices must not only be invertible but also well-conditioned. In this paper we present an…
We count mxn non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally efficient asymptotic formula approximating the number of…
The mean absolute deviation about the mean is an alternative to the standard deviation for measuring dispersion in a sample or in a population. For stationary, ergodic time series with a finite first moment, an asymptotic expansion for the…
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…
For each $n$, let $A_n=(\sigma_{ij})$ be an $n\times n$ deterministic matrix and let $X_n=(X_{ij})$ be an $n\times n$ random matrix with i.i.d. centered entries of unit variance. We study the asymptotic behavior of the empirical spectral…
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
A defect correction formula for quadratic matrix equations of the kind $A_1X^2+A_0X+A_{-1}=0$ is presented. This formula, expressed by means of an invariant subspace of a suitable pencil, allows us to introduce a modification of the…