首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
It is proved that Wigner's semicircle law for the distribution of eigenvalues of random matrices, which is important in the statistical theory of energy levels of heavy nuclei, possesses the following completely deterministic version. Let An=(aij), 1?i, ?n, be the nth section of an infinite Hermitian matrix, {λ(n)}1?k?n its eigenvalues, and {uk(n)}1?k?n the corresponding (orthonormalized column) eigenvectors. Let v1n=(an1,an2,?,an,n?1), put
Xn(t)=[n(n-1)]-12k=1[(n-1)t]|vn1uf(n-1)|2,0?t?1
(bookeeping function for the length of the projections of the new row v1n of An onto the eigenvectors of the preceding matrix An?1), and let finally
Fn(x)=n-1(number of λk(n)?xn,1?k?n)
(empirical distribution function of the eigenvalues of Ann. Suppose (i) limnannn=0, (ii) limnXn(t)=Ct(0<C<∞,0?t?1). Then
Fn?W(·,C)(n→∞)
,where W is absolutely continuous with (semicircle) density
w(x,C)=(2Cπ)-1(4C-x212for|x|?2C0for|x|?2C
  相似文献   

2.
Let Fn(x) be the empirical distribution function based on n independent random variables X1,…,Xn from a common distribution function F(x), and let X = Σi=1nXin be the sample mean. We derive the rate of convergence of Fn(X) to normality (for the regular as well as nonregular cases), a law of iterated logarithm, and an invariance principle for Fn(X).  相似文献   

3.
Let the set T = {(x1, x2,…, xn): xi = 0, 1}. Since the elements of T can be seen as binary representations of integers, we order them with their corresponding integer values. Let Γ1 be the set of (n + 1) × (n + 1) matrices of the form [1 … D], where the n + 1 rows of D are distinct ordered elements of T. We show that the proportion of singular matrices in Γ1 approaches 0 as n → ∞.  相似文献   

4.
Let (X, A) be a measurable space, Θ ? R an open interval and PΩA, Ω ? Θ, a family of probability measures fulfilling certain regularity conditions. Let Ωn be the maximum likelihood estimate for the sample size n. Let λ be a prior distribution on Θ and let Rn,x be the posterior distribution for the sample size n given x ? Xn. L: Θ × Θ → R denotes a loss function fulfilling certain regularity conditions and Tn denotes the Bayes estimate relative to λ and L for the sample size n. It is proved that for every compact K ? Θ there exists cK ≥ 0 such that
suptheta;∈KPtheta;nh{x∈Xn∥ Tn(x) ? ?nx|? cK(log n)n?} = o(n?12).
This theorem improves results of Bickel and Yahav [3], and Ibragimov and Has'minskii [4], as far as the speed of convergence is concerned.  相似文献   

5.
For a sequence A = {Ak} of finite subsets of N we introduce: δ(A) = infm?nA(m)2n, d(A) = lim infn→∞ A(n)2n, where A(m) is the number of subsets Ak ? {1, 2, …, m}.The collection of all subsets of {1, …, n} together with the operation a ∪ b, (a ∩ b), (a 1 b = a ∪ b ? a ∩ b) constitutes a finite semi-group N (semi-group N) (group N1). For N, N we prove analogues of the Erdös-Landau theorem: δ(A+B) ? δ(A)(1+(2λ)?1(1?δ(A>))), where B is a base of N of the average order λ. We prove for N, N, N1 analogues of Schnirelmann's theorem (that δ(A) + δ(B) > 1 implies δ(A + B) = 1) and the inequalities λ ? 2h, where h is the order of the base.We introduce the concept of divisibility of subsets: a|b if b is a continuation of a. We prove an analog of the Davenport-Erdös theorem: if d(A) > 0, then there exists an infinite sequence {Akr}, where Akr | Akr+1 for r = 1, 2, …. In Section 6 we consider for N∪, N∩, N1 analogues of Rohrbach inequality: 2n ? g(n) ? 2n, where g(n) = min k over the subsets {a1 < … < ak} ? {0, 1, 2, …, n}, such that every m? {0, 1, 2, …, n} can be expressed as m = ai + aj.Pour une série A = {Ak} de sous-ensembles finis de N on introduit les densités: δ(A) = infm?nA(m)2m, d(A) = lim infn→∞ A(n)2nA(m) est le nombre d'ensembles Ak ? {1, 2, …, m}. L'ensemble de toutes les parties de {1, 2, …, n} devient, pour les opérations a ∪ b, a ∩ b, a 1 b = a ∪ b ? a ∩ b, un semi-groupe fini N, N ou un groupe N1 respectivement. Pour N, N on démontre l'analogue du théorème de Erdös-Landau: δ(A + B) ? δ(A)(1 + (2λ)?1(1?δ(A))), où B est une base de N d'ordre moyen λ. On démontre pour N, N, N1 l'analogue du théorème de Schnirelmann (si δ(A) + δ(B) > 1, alors δ(A + B) = 1) et les inégalités λ ? 2h, où h est l'ordre de base. On introduit le rapport de divisibilité des enembles: a|b, si b est une continuation de a. On démontre l'analogue du théorème de Davenport-Erdös: si d(A) > 0, alors il existe une sous-série infinie {Akr}, où Akr|Akr+1, pour r = 1, 2, … . Dans le Paragraphe 6 on envisage pour N, N, N1 les analogues de l'inégalité de Rohrbach: 2n ? g(n) ? 2n, où g(n) = min k pour les ensembles {a1 < … < ak} ? {0, 1, 2, …, n} tels que pour tout m? {0, 1, 2, …, n} on a m = ai + aj.  相似文献   

6.
We consider an extremal problem for directed graphs which is closely related to Turán's theorem giving the maximum number of edges in a graph on n vertices which does not contain a complete subgraph on m vertices. For an integer n?2, let Tn denote the transitive tournament with vertex set Xn={1,2,3,…,n} and edge set {(i,j):1?i<j?n}. A subgraph H of Tn is said to be m-locally unipathic when the restriction of H to each m element subset of Xn consisting of m consecutive integers is unipathic. We show that the maximum number of edges in a m-locally unipathic subgraph of Tn is (q2)(m?1)2+q(m?1)r+?14r2? where n= q(m?1+r and ?12(m?1)??r<?32(m?1)?. As is the case with Turán's theorem, the extremal graphs for our problem are complete multipartite graphs. Unlike Turán's theorem, the part sizes will not be uniform. The proof of our principal theorem rests on a combinatorial theory originally developed to investigate the rank of partially ordered sets.  相似文献   

7.
Let S(n) denote the set of subsets of an n-element set. For an element x of S(n), let Γx and Px denote, respectively, all (|x| ?1)-element subsets of x and all (|x| + 1)-element supersets of x in S(n). Several inequalities involving Γ and P are given. As an application, an algorithm for finding an x-element antichain X1 in S(n) satisfying | YX1 | ? | YX | for all x-element antichains X in S(n) is developed, where YX is the set of all elements of S(n) contained in an element of X. This extends a result of Kleitman [9] who solved the problem in case x is a binomial coefficient.  相似文献   

8.
Let u∈C([0,T1[;Ln(Rn)n) be a maximal solution of the Navier–Stokes equations. We prove that u is C on ]0,T1Rn and there exists a constant ε1>0, which depends only on n, such that if T1 is finite then, for all ω∈S(Rn)n, we have limt→T16u(t)?ω6B?1,∞1.To cite this article: R. May, C. R. Acad. Sci. Paris, Ser. I 336 (2003).  相似文献   

9.
Let X1, X2, X3, … be i.i.d. r.v. with E|X1| < ∞, E X1 = μ. Given a realization X = (X1,X2,…) and integers n and m, construct Yn,i, i = 1, 2, …, m as i.i.d. r.v. with conditional distribution P1(Yn,i = Xj) = 1n for 1 ? j ? n. (P1 denotes conditional distribution given X). Conditions relating the growth rate of m with n and the moments of X1 are given to ensure the almost sure convergence of (1mmi=1 Yn,i toμ. This equation is of some relevance in the theory of Bootstrap as developed by Efron (1979) and Bickel and Freedman (1981).  相似文献   

10.
For any tournament T on n vertices, let h(T) denote the maximum number of edges in the intersection of T with a transitive tournament on the same vertex set. Sharpening a previous result of Spencer, it is proved that, if Tn denotes the random tournament on n vertices, then, P(h(Tn) ≤ 12(2n) + 1.73n32) → 1 as n → ∞.  相似文献   

11.
Let φ be the Euler's function. A question of Rosser and Schoenfeld is answered, showing that there exists infinitely many n such that nφ(n) > eylog log n, where γ is the Euler's constant. More precisely, if Nk is the product of the first k primes, it is proved that, under the Riemann's hypothesis, Nkφ(Nk) > eylog log Nk holds for any k ≥ 2, and, if the Riemann's hypothesis is false this inequality holds for infinitely many k, and is false for infinitely many k.  相似文献   

12.
Let T+ denote the first increasing ladder epoch in a random walk with a typical step-length X. It is known that for a large class of random walks with E(X)=0,E(X2)=∞, and the right-hand tail of the distribution function of X asymptotically larger than the left-hand tail, PT+?n∽n1β?1L+(n) as n→∞, with 1<β<2 and L+ slowly varying, if and only ifP{X?x}∽ 1/{xβL(x)} as x→+∞, with L slowly varying. In this paper it is shown how the asymptotic behaviour of L determines the asymptotic behaviour of L+ and vice versa. As a by-product, it follows that a certain class of random walks which are in the domain of attraction of one-sided stable laws is such that the down-going ladder height distribution has finite mean.  相似文献   

13.
Let X be a maximal set of pairwise disjoint partitions of n into t distinct parts. Let Mt(n) (resp. mt(n)) denote the size of the largest (resp. smallest) such maximal set X. Upper and lower bounds for Mt(n)n and mt(n)n are established.  相似文献   

14.
Let α(n1, n2) be the probability of classifying an observation from population Π1 into population Π2 using Fisher's linear discriminant function based on samples of size n1 and n2. A standard estimator of α, denoted by T1, is the proportion of observations in the first sample misclassified by the discriminant function. A modification of T1, denoted by T2, is obtained by eliminating the observation being classified from the calculation of the discriminant function. The UMVU estimators, T11 and T21, of ET1 = τ1(n1, n2) and ET2 = τ2(n1, n2) = α(n1 ? 1, n2) are derived for the case when the populations have multivariate normal distributions with common dispersion matrix. It is shown that T11 and T21 are nonincreasing functions of D2, the Mahalanobis sample distance. This result is used to derive the sampling distributions and moments of T11 and T21. It is also shown that α is a decreasing function of Δ2 = (μ1 ? μ2)′Σ?11 ? μ2). Hence, by truncating T11 and T21 (or any estimator) at the value of α for Σ = 0, new estimators are obtained which, for all samples, are as close or closer to α.  相似文献   

15.
Let C(S) be the space of real-valued continuous functions on a compact metric space S. Let {Xn, n ? 1} be a sequence of independent identically distributed C(S)-valued random variables with mean zero and supt?sE[X12(t)] = 1. We show that the measures induced by (X1 + ··· + Xn) n?12 converge weakly to a Gaussian measure on C(S) under different conditions on X1, one of which consolidates and extends results of Strassen and Dudley, Giné, and Dudley. Our method of proof is different from the methods employed by these authors.  相似文献   

16.
Let O = limnZ/pnZ, let A = O[g2, g3]Δ, where g2 and g3 are coefficients of the elliptic curve: Y2 = 4X3 ? g2X ? g3 over a finite field and Δ = g23 ? 27g32 and let B = A[X, Y](Y2 ? 4X3 + g2X + g3). Then the p-adic cohomology theory will be applied to compute explicitly the zeta matrices of the elliptic curves, induced by the pth power map on the free A2?ZQ-module H1(X, A2?ZQ). Main results are; Theorem 1.1: X2dY and YdX are basis elements for H1(X, ΓA1(X)2?ZQ); Theorem 1.2: YdX, X2dY, Y?1dX, Y?2dX and XY?2dX are basis elements for H1(X ? (Y = 0), ΓA1(X)2?ZQ), where X is a lifting of X, and all the necessary recursive formulas for this explicit computation are given.  相似文献   

17.
Let Cn×n and Hn denote respectively the space of n×n complex matrices and the real space of n×n hermitian matrices. Let p,q,n be positive integers such that p?q?n. For A?Cn×n, the (p,q)-numerical range of A is the set
Wp,q(A)={trCp(JqUAU1):U unitary}
, where Cp(X) is the pth compound matrix of X, and Jq is the matrix Iq?On-q. Let L denote Hn or Cn×n. The problem of determining all linear operators T: LL such that
Wp,q(T(A))=Wp,q(A) for all A?L
is treated in this paper.  相似文献   

18.
Let Xi be iidrv's and Sn=X1+X2+…+Xn. When EX21<+∞, by the law of the iterated logarithm (Snn)(n log n)12→0 a.s. for some constants αn. Thus the r.v. Y=supn?1[|Snn|?(δn log n)12]+ is a.s.finite when δ>0. We prove a rate of convergence theorem related to the classical results of Baum and Katz, and apply it to show, without the prior assumption EX21<+∞ that EYh<+∞ if and only if E|X1|2+h[log|X1|]-1<+∞ for 0<h<1 and δ> hE(X1?EX1)2, whereas EYh=+∞ whenever h>0 and 0<δ<hE(X1?EX1)2.  相似文献   

19.
Let A(x,ε) be an n×n matrix function holomorphic for |x|?x0, 0<ε?ε0, and possessing, uniformly in x, an asymptotic expansion A(x,ε)?Σr=0Ar(x) εr, as ε→0+. An invertible, holomorphic matrix function P(x,ε) with an asymptotic expansion P(x,ε)?Σr=0Pr(x)εr, as ε→0+, is constructed, such that the transformation y = P(x,ε)z takes the differential equation εhdydx = A(x,ε)y,h a positive integer, into εhdzdx = B(x,ε)z, where B(x,ε) is asymptotically equal, to all orders, to a matrix in a canonical form for holomorphic matrices due to V.I. Arnold.  相似文献   

20.
Let T be a subnormal, nonnormal operator on a Hilbert space and suppose that the point spectrum of T1 is empty. Then there exist vectors x ≠ 0 for which (T1 ? zI)?1x exists and is weakly continuous for all z. It is shown that under certain conditions, the Cauchy integral of this vector function taken around an appropriate contour, not necessarily lying in the resolvent set of T1, leads to a proper (nontrivial) invariant subspace of T1.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号