This paper deals with a homoskedastic errors-in-variables linear regression model and properties of the total least squares (TLS) estimator. We partly revise the consistency results for the TLS estimator previously obtained by the author [18]. We present complete and comprehensive proofs of consistency theorems. A theoretical foundation for construction of the TLS estimator and its relation to the generalized eigenvalue problem is explained. Particularly, the uniqueness of the estimate is proved. The Frobenius norm in the definition of the estimator can be substituted by the spectral norm, or by any other unitarily invariant norm; then the consistency results are still valid.
A nonlinear stochastic differential equation with the order of nonlinearity higher than one, with several discrete and distributed delays and time varying coefficients is considered. It is shown that the sufficient conditions for exponential mean square stability of the linear part of the considered nonlinear equation also are sufficient conditions for stability in probability of the initial nonlinear equation. Some new sufficient condition of stability in probability for the zero solution of the considered nonlinear non-autonomous stochastic differential equation is obtained which can be considered as a multi-condition of stability because it allows to get for one considered equation at once several different complementary of each other sufficient stability conditions. The obtained results are illustrated with numerical simulations and figures.
From a practical point of view this allows less restrictive moment conditions on the underlying random variables and one can use other distance functions than Euclidean distance, e.g. Minkowski distance. Most importantly, it serves as the basic building block for distance multivariance, a quantity to measure and estimate dependence of multiple random vectors, which is introduced in a follow-up paper [Distance Multivariance: New dependence measures for random vectors (submitted). Revised version of arXiv: 1711.07775v1] to the present article.
It is shown that the absolute constant in the BerryâEsseen inequality for i.i.d. Bernoulli random variables is strictly less than the Esseen constant, if $1\le n\le 500000$, where n is a number of summands. This result is got both with the help of a supercomputer and an interpolation theorem, which is proved in the paper as well. In addition, applying the method developed by S. Nagaev and V. Chebotarev in 2009â2011, an upper bound is obtained for the absolute constant in the BerryâEsseen inequality in the case under consideration, which differs from the Esseen constant by no more than 0.06%. As an auxiliary result, we prove a bound in the local MoivreâLaplace theorem which has a simple and explicit form.
Despite the best possible result, obtained by J. Schulz in 2016, we propose our approach to the problem of finding the absolute constant in the BerryâEsseen inequality for two-point distributions since this approach, combining analytical methods and the use of computers, could be useful in solving other mathematical problems.