首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 500 毫秒
1.
考虑多元分布的正态性检验问题,用投影寻踪方法,给出了两个检验统计量,模拟计算也表明所提出的检验统计量具有良好的功效.  相似文献   

2.
基于投影偏度和投影峰度的投影寻踪自助法的正态性检验   总被引:1,自引:0,他引:1  
陈广雷 《数学杂志》2006,26(2):147-154
本文研究了多元分布的正态性检验问题,用投影寻踪自助法,获得了投影偏度和投影峰度正态性检验统计量,证明了在零假设成立时,所提出的偏度和峰度检验统计量的极限分布为一高斯过程的上界.为计算机模拟计算提供了有力的手段和依据.  相似文献   

3.
考虑带有误差变量的多元正态检验问题,给出了新的投影偏度和峰度检验统计量,证明了在零假设成立时,所给的检验统计量的极限分布为一高斯过程的上界,为计算机模拟计算提供了有力的手段和依据.  相似文献   

4.
该文研究协变量随机缺失下半参数变系数部分线性模型的统计推断.利用逆概率加权最小二乘方法给出了模型中参数分量和非参数分量的估计,并证明了它们的渐近正态性.另外该文又提出了一个逆概率加权经验对数似然比统计量,并证明该统计量服从标准χ~2分布,从而构造了模型中参数分量的经验似然置信域.最后通过模拟研究和实例分析说明该文提出的方法具有较好的有限样本性质.  相似文献   

5.
在假设检验的过程中,对一个参数的检验法一般来说是不唯一的.对于正态总体,当均值已知,而就方差进行检验时,若能选用自由度为n的χ2统计量,则其为无偏检验,而且为一定标准下的最佳检验.  相似文献   

6.
在多元重复测量试验模型下,当受试对象观测矩阵的协方差矩阵∑为等方差等协方差结构时,给出了参数的似然比检验统计量.给出该检验在原假设下的渐近零分布和在备择假设下的渐近非零分布,并就检验的功效进行了分析.  相似文献   

7.
本文研究变系数EV模型,构造了未知系数函数的局部纠偏经验对数似然比统计量,在适当条件下,证明了所提出的统计量都具有渐近χ2分布,所得结果可以用来构造未知系数函数的逐点置信域.通过模拟研究比较了经验似然方法与正态逼近方法在逐点置信域构造方面的优劣.  相似文献   

8.
魏传华  郭双 《应用数学》2016,29(4):797-808
本文研究部分线性可加模型在因变量存在缺失情形下的统计推断问题. 首先基于完整数据方法提出了参数分量的Profile 最小二乘估计并证明估计量的渐近正态性. 为了给出参数分量的区间估计,构造了渐近分布为卡方分布的经验似然统计量. 为了检验参数分量的线性约束条件, 构造了调整的广义似然比检验统计量, 当原假设成立时其渐近分布为卡方分布,从而将广义似然比检验推广到了缺失数据情形. 最后通过数值模拟验证所提方法的有效性.  相似文献   

9.
本文研究部分线性可加模型在因变量存在缺失情形下的统计推断问题.首先基于完整数据方法提出了参数分量的Profile最小二乘估计并证明估计量的渐近正态性.为了给出参数分量的区间估计,构造了渐近分布为卡方分布的经验似然统计量.为了检验参数分量的线性约束条件,构造了调整的广义似然比检验统计量,当原假设成立时其渐近分布为卡方分布,从而将广义似然比检验推广到了缺失数据情形.最后通过数值模拟验证所提方法的有效性.  相似文献   

10.
秦永松  雷庆祝 《中国科学A辑》2007,37(12):1463-1473
研究含一个未知结构参数的二元正态混合模型齐一性检验的修正似然比统计量的渐近性质, 证明了修正似然比统计量在零假设下的极限分布为χ22.  相似文献   

11.
本文研究应力服从一类嵌套多元指数分布, 强度服从指数分布的应力---强度结构可靠度模型.分别在强度参数未知、应力参数已知和强度参数已知、应力参数未知的情况下给出了结构可靠度$P_{A}$的估计$\wh{P}_{A1}$和$\wh{P}_{A2}$,并讨论了它们的渐近性质,而且获得了$P_{A}$的近似置信区间.最后对这两种情况下模型结构可靠度的估计$\wh{P}_{A1}$和$\wh{P}_{A2}$进行了随机模拟,随机模拟结果令人满意.  相似文献   

12.
Given a set X, $\mathsf {AC}^{\mathrm{fin}(X)}$ denotes the statement: “$[X]^{<\omega }\backslash \lbrace \varnothing \rbrace$ has a choice set” and $\mathcal {C}_\mathrm{R}\big (\mathbf {2}^{X}\big )$ denotes the family of all closed subsets of the topological space $\mathbf {2}^{X}$ whose definition depends on a finite subset of X. We study the interrelations between the statements $\mathsf {AC}^{\mathrm{fin}(X)},$ $\mathsf {AC}^{\mathrm{fin}([X]^{<\omega })},$ $\mathsf {AC}^{\mathrm{fin} (F_{n}(X,2))},$ $\mathsf {AC}^{\mathrm{fin}(\mathcal {\wp }(X))}$ and “$\mathcal {C}_\mathrm{R}\big (\mathbf {2}^{X}\big )\backslash \lbrace \varnothing \rbrace$has a choice set”. We show:
  • (i) $\mathsf {AC}^{\mathrm{fin}(X)}$ iff $\mathsf {AC}^{\mathrm{fin}([X]^{<\omega } )}$ iff $\mathcal {C}_\mathrm{R}\big (\mathbf {2}^{X}\big )\backslash \lbrace \varnothing \rbrace$ has a choice set iff $\mathsf {AC}^{\mathrm{fin}(F_{n}(X,2))}$.
  • (ii) $\mathsf {AC}_{\mathrm{fin}}$ ($\mathsf {AC}$ restricted to families of finite sets) iff for every set X, $\mathcal {C}_\mathrm{R}\big (\mathbf {2}^{X}\big )\backslash \lbrace \varnothing \rbrace$ has a choice set.
  • (iii) $\mathsf {AC}_{\mathrm{fin}}$ does not imply “$\mathcal {K}\big (\mathbf {2}^{X}\big )\backslash \lbrace \varnothing \rbrace$ has a choice set($\mathcal {K}(\mathbf {X})$ is the family of all closed subsets of the space $\mathbf {X}$)
  • (iv) $\mathcal {K}(\mathbf {2}^{X})\backslash \lbrace \varnothing \rbrace$ implies $\mathsf {AC}^{\mathrm{fin}(\mathcal {\wp }(X))}$ but $\mathsf {AC}^{\mathrm{fin}(X)}$ does not imply $\mathsf {AC}^{\mathrm{fin}(\mathcal {\wp }(X))}$.
We also show that “For every setX, “$\mathcal {K}\big (\mathbf {2}^{X}\big )\backslash \lbrace \varnothing \rbrace$has a choice set” iff “for every setX, $\mathcal {K}\big (\mathbf {[0,1]}^{X}\big )\backslash \lbrace \varnothing \rbrace$has a choice set” iff “for every product$\mathbf {X}$of finite discrete spaces,$\mathcal {K}(\mathbf {X})\backslash \lbrace \varnothing \rbrace$ has a choice set”.  相似文献   

13.
Let F_q be a finite field of characteristic p. In this paper, by using the index sum method the authors obtain a sufficient condition for the existence of a primitive elementα∈ F_(q~n) such that α + α~(-1)is also primitive or α + α~(-1)is primitive and α is a normal element of F_(q~n) over F_q.  相似文献   

14.
Summary. Let $\widehat{\widehat T}_n$ and $\overline U_n$ denote the modified Chebyshev polynomials defined by $\widehat{\widehat T}_n (x) = {T_{2n + 1} \left(\sqrt{x + 3 \over 4} \right) \over \sqrt{x + 3 \over 4}}, \quad \overline U_{n}(x) = U_{n} \left({x + 1 \over 2}\right) \qquad (n \in \mathbb{N}_{0},\ x \in \mathbb{R}).$ For all $n \in \mathbb{N}_{0}$ define $\widehat{\widehat T}_{-(n + 1)} = \widehat{\widehat T}_n$ and $\overline U_{-(n + 2)} = - \overline U_n$, furthermore $\overline U_{-1} = 0$. In this paper, summation formulae for sums of type $\sum\limits^{+\infty}_{k = -\infty} \mathbf a_{\mathbf k}(\nu; x)$ are given, where $\bigl(\mathbf a_{\mathbf k}(\nu; x)\bigr)^{-1} = (-1)^k \cdot \Bigl( x \cdot \widehat{\widehat T}_{\left[k + 1 \over 2\right] - 1} (\nu) +\widehat{\widehat T}_{\left[k + 1 \over 2\right]}(\nu)\Bigr) \cdot \Bigl(x \cdot \overline U_{\left[k \over 2\right] - 1} (\nu) + \overline U_{\left[k \over 2\right]} (\nu)\Bigr)$ with real constants $ x, \nu $. The above sums will turn out to be telescope sums. They appear in connection with projective geometry. The directed euclidean measures of the line segments of a projective scale form a sequence of type $(\mathbf a_{\mathbf k} (\nu;x))_{k \in \mathbb{Z}}$ where $ \nu $ is the cross-ratio of the scale, and x is the ratio of two consecutive line segments once chosen. In case of hyperbolic $(\nu \in \mathbb{R} \setminus] - 3,1[)$ and parabolic $\nu = -3$ scales, the formula $\sum\limits^{+\infty}_{k = -\infty} \mathbf a_{\mathbf k} (\nu; x) = {\frac{1}{x - q_{{+}\atop(-)}}} - {\frac{1}{x - q_{{-}\atop(+)}}} \eqno (1)$ holds for $\nu > 1$ (resp. $\nu \leq - 3$), unless the scale is geometric, that is unless $x = q_+$ or $x = q_-$. By $q_{\pm} = {-(\nu + 1) \pm \sqrt{(\nu - 1)(\nu + 3)} \over 2}$ we denote the quotient of the associated geometric sequence.
  相似文献   

15.
如我们所知,诸如视频和图像等信号可以在某些框架下被表示为稀疏信号,因此稀疏恢复(或稀疏表示)是信号处理、图像处理、计算机视觉、机器学习等领域中被广泛研究的问题之一.通常大多数在稀疏恢复中的有效快速算法都是基于求解$l^0$或者$l^1$优化问题.但是,对于求解$l^0$或者$l^1$优化问题以及相关算法所得到的理论充分性条件对信号的稀疏性要求过严.考虑到在很多实际应用中,信号是具有一定结构的,也即,信号的非零元素具有一定的分布特点.在本文中,我们研究分片稀疏恢复的唯一性条件和可行性条件.分片稀疏性是指一个稀疏信号由多个稀疏的子信号合并所得.相应的采样矩阵是由多个基底合并组成.考虑到采样矩阵的分块结构,我们引入了子矩阵的互相干性,由此可以得到相应$l^0$或者$l^1$优化问题可精确恢复解的稀疏度的新上界.本文结果表明.通过引入采样矩阵的分块结构信息.可以改进分片稀疏恢复的充分性条件.以及相应$l^0$或者$l^1$优化问题整体稀疏解的可靠性条件.  相似文献   

16.
Suppose that Z1,Z2…,Zn are independent normal random variables with common mean μ and variance σ^2. Then S^2=∑n n=1 (zi-z)^2/σ^2 and T =(n-1的平方根)-Z/(S^2/n的平方根) have x2n-1 distribution and tn-1 distribution respectively. If the normal assumption fails, there will be the remainders of the distribution functions and density functions. This paper gives the direct expansions of distribution functions and density functions of S^2 and T up to o(n^-1). They are more intuitive and convenient than usual Edgeworth expansions.  相似文献   

17.
We introduce a family of bi-dimensional theta functions which give uniformly explicit formulae for the theta series of hermitian lattices over imaginary quadratic fields constructed from codes over and , and give an interesting geometric characterization of the theta series that arise in terms of the basic strongly modular lattice . We identify some of the hermitian lattices constructed and observe an interesting pair of nonisomorphic 3/2 dimensional codes over that give rise to isomorphic hermitian lattices when constructed at the lowest level 7 but nonisomorphic lattices at higher levels. The results show that the two alphabets and are complementary and raise the natural question as to whether there are other such complementary alphabets for codes.

  相似文献   


18.
Given a family of vectors in a Hilbert space we characterize the existence of a family of commuting contractions on having regular dilation and such that


The theorem is a multi-dimensional analogue for some well-known operator moment problems due to Sebestyén in case or, recently, to Gavruta and Paunescu in case .

  相似文献   


19.
We prove the following result concerning the degree spectrum of the atom relation on a computable Boolean algebra. Let be a computable Boolean algebra with infinitely many atoms and be the Turing degree of the atom relation of . If is a c.e. degree such that , then there is a computable copy of where the atom relation has degree . In particular, for every c.e. degree , any computable Boolean algebra with infinitely many atoms has a computable copy where the atom relation has degree .

  相似文献   


20.
Suppose that there is a variance components model $$\[\left\{ {\begin{array}{*{20}{c}} {E\mathop Y\limits_{n \times 1} = \mathop X\limits_{n \times p} \mathop \beta \limits_{p \times 1} }\{DY = \sigma _2^2{V_1} + \sigma _2^2{V_2}} \end{array}} \right.\]$$ where $\[\beta \]$,$\[\sigma _1^2\]$ and $\[\sigma _2^2\]$ are all unknown, $\[X,V > 0\]$ and $\[{V_2} > 0\]$ are all known, $\[r(X) < n\]$. The author estimates simultaneously $\[(\sigma _1^2,\sigma _2^2)\]$. Estimators are restricted to the class $\[D = \{ d({A_1}{A_2}) = ({Y^''}{A_1}Y,{Y^''}{A_2}Y),{A_1} \ge 0,{A_2} \ge 0\} \]$. Suppose that the loss function is $\[L(d({A_1},{A_2}),(\sigma _1^2,\sigma _2^2)) = \frac{1}{{\sigma _1^4}}({Y^''}{A_1}Y - \sigma _1^2) + \frac{1}{{\sigma _2^4}}{({Y^''}{A_2}Y - \sigma _2^2)^2}\]$. This paper gives a necessary and sufficient condition for $\[d({A_1},{A_2})\]$ to be an equivariant D-asmissible estimator under the restriction $\[{V_1} = {V_2}\]$, and a sufficient condition and a necessary condition for $\[d({A_1},{A_2})\]$ to equivariant D-asmissible without the restriction.  相似文献   

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

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