Results 151 to 160 of about 1,682,384 (202)
Some of the next articles are maybe not open access.
Mathematics of the USSR-Izvestiya, 1971
In this article a problem in the theory of Toeplitz forms is analyzed. The problem was first formulated and solved by G. Szeg? in 1952, and since solved by many authors under more general conditions. A solution is given to Szeg?'s problem under conditions which are best possible, and also some refinements of the problem are examined.
Golinskii, B. L., Ibragimov, I. A.
openaire +1 more source
In this article a problem in the theory of Toeplitz forms is analyzed. The problem was first formulated and solved by G. Szeg? in 1952, and since solved by many authors under more general conditions. A solution is given to Szeg?'s problem under conditions which are best possible, and also some refinements of the problem are examined.
Golinskii, B. L., Ibragimov, I. A.
openaire +1 more source
2005
We characterize convergence of a sequence of d-dimensional random vectors by convergence of the one-dimensional margins and of the copula. The result is applied to the approximation of portfolios modelled by t-copulas with large degrees of freedom, and to the convergence of certain dependence measures of bivariate distributions.
Lindner, Alexander M. +1 more
openaire +2 more sources
We characterize convergence of a sequence of d-dimensional random vectors by convergence of the one-dimensional margins and of the copula. The result is applied to the approximation of portfolios modelled by t-copulas with large degrees of freedom, and to the convergence of certain dependence measures of bivariate distributions.
Lindner, Alexander M. +1 more
openaire +2 more sources
Acta Applicandae Mathematicae, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saulis, L., Deltuvienė, D.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saulis, L., Deltuvienė, D.
openaire +2 more sources
Random Structures and Algorithms, 1996
Summary: Central and local limit theorems (including large deviations) are established for the number of comparisons used by the standard top-down recursive mergesort under the uniform permutation model. The method of proof utilizes Dirichlet series, Mellin transforms, and standard analytic methods in probability theory.
openaire +3 more sources
Summary: Central and local limit theorems (including large deviations) are established for the number of comparisons used by the standard top-down recursive mergesort under the uniform permutation model. The method of proof utilizes Dirichlet series, Mellin transforms, and standard analytic methods in probability theory.
openaire +3 more sources
2008
At the end of the 17th century, the mathematician Abraham de Moivre first used the normal distribution as an approximation for the percentage of successes in a large number of experiments. Later on, Laplace generalized his results, but it took 20th century mathematics to give an exact and complete description of this subject. So let me now describe the
openaire +1 more source
At the end of the 17th century, the mathematician Abraham de Moivre first used the normal distribution as an approximation for the percentage of successes in a large number of experiments. Later on, Laplace generalized his results, but it took 20th century mathematics to give an exact and complete description of this subject. So let me now describe the
openaire +1 more source
Advances in Applied Probability, 1976
Let be an adapted sequence of integrable random variables on the probability space . Let us set .The following result can be immediately derived from Brown [2]:
openaire +1 more source
Let be an adapted sequence of integrable random variables on the probability space . Let us set .The following result can be immediately derived from Brown [2]:
openaire +1 more source
Theory of Probability & Its Applications, 1976
Limit theorems are proved by using certain pseudometrics as distances between distributions in the scheme of summation of series of independent random variables with values in a separable Hilbert space.
openaire +2 more sources
Limit theorems are proved by using certain pseudometrics as distances between distributions in the scheme of summation of series of independent random variables with values in a separable Hilbert space.
openaire +2 more sources
Unconditional limit theorems from conditional limit theorems
Journal of Nonparametric Statistics, 1997The method of proof developed here may be used to obtain unconditional limit theorems from conditional limit theorems in a variety of settings. It is known that given two samples with the same arbitrary nondegenerate common distribution function, the conditional distribution of the sum of the tied midranks of one sample within the pooled ordered sample,
Mark Finkelstein, Howard G. Tucker
openaire +1 more source