δ修正Cramr-von Mises检验的非无偏性(英文)

在简单假设下,证明了对任意给定水平α∈(0,1)和样本容量n,δ修正Cramr-von Mises检验的非无偏性.     

δ修正Cramér-von Mises检验的非无偏性

在简单假设下,证明了对任意给定水平α∈(0,1)和样本容量n,δ修正Cramér-von Mises检验的非无偏性.     

空间非齐次白噪声驱动的分数阶随机热方程的矩估计

该文主要研究如下伴有Cauchy初值条件的分数阶随机热方程■其中a∈(1,2]为算子D_δ^α的阶数,δ(|δ|≤2-α)称为偏度参数,扩散系数g(·):R→R是非随机的可测函数:?²/?_t?_xw_ρ(t,x)表示空间非齐次白噪声,在关于非齐次布朗单w_ρ(t,x)催化测度ρ的适当假设下,证明了该方程解的存在性、唯一性和H?lder连续性.同时,也证明了方程解的矩估计.     

多元时间序列GARCH型模型的诊断检验

多元时间序列GARCH型模型已被证实在理论和实际中具有重要作用.该文对这一类模型的拟合优度提出了一组得分型检验统计量.这些检验在零假设模型下渐近服从卡方分布,计算简单,临界值容易得到.检验对备择模型比较敏感,能侦察到以1/n~(1/2)的速度收敛到零假设的备择模型.对于可能的多个备择,构造了渐近分布自由的Maximin检验;而对于饱和备择情形,基于得分型检验的思想提出了一个构造Omnibus检验的可能性.值得指出的是构造的这组检验能检测到零假设模型的条件协差阵的每一部分可能的偏离,从而当模型被错误指定时,该检验能提供相关信息进行模型修正.模拟结果表明该文的检验表现理想.     

Bochner-Riesz算子在加权弱型Hardy空间上的有界性

设w是一个Muckenhoupt议函数且WH_w^p(Rp(Rⁿ)是加仅的弱型Hardy空间.通过WH_wn)是加仅的弱型Hardy空间.通过WH_w^p(Rp(Rⁿ)的原子分解定理,将证明当0n/p-(n+1)/2时,极大Bochner-Riesz算子T_*n)的原子分解定理,将证明当0n/p-(n+1)/2时,极大Bochner-Riesz算子T_*^δ是从WH_wδ是从WH_w^p(Rp(Rⁿ)到WL_wn)到WL_w^p(Rp(Rⁿ)有界的.而且还将证明对于0n/p-(n+1)/2,Bochner-Riesz算子T_Rn)有界的.而且还将证明对于0n/p-(n+1)/2,Bochner-Riesz算子T_R^δ在加权弱型Hardy空间WH_wδ在加权弱型Hardy空间WH_w^p(Rp(Rⁿ)上也是有界的.本文的结果即使对于非加,仅情形也是新的.     

带边流形上k-Yamabe方程的变分结构

本文考虑了n维带边流形上的k-Yamabe问题.当2 k≤n/2时,假设方程是具有变分结构的.在之前的文献中,人们都是假设流形是局部共形平坦的.当k=2时,在较弱的假设下,本文可以推广已有的k-Yamabe问题的结论.特别地,本文证明了,当n4、边界的平均曲率非负、且流形的Yamabe常数比标准半球面的Yamabe常数严格小时,2-Yamabe问题是可解的.     

(δ,)-等距的稳定性

本文讨论了Banach空间之间非满射、非线性的弱等距逼近问题.在某些条件假设下,对(δ,(?))-等距算子的稳定性给出了一些肯定的结果,从而修正并推广了文[1—4]中的一些结果.     

(δ,)-等距的稳定性

本文讨论了Banach空间之间非满射、非线性的弱等距逼近问题.在某些条件假设下,对(δ,(?))-等距算子的稳定性给出了一些肯定的结果,从而修正并推广了文[1—4]中的一些结果.     

一类多元重复测量模型参数的似然比检验及其功效分析

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

(δ,ψ)-等距的稳定性

本文讨论了Banach空间之间非满射、非线性的弱等距逼近问题.在某些条件假设下,对(δ,ψ)-等距算子的稳定性给出了一些肯定的结果,从而修正并推广了文[1-4]中的一些结果.     

图的点可区别Ⅳ-全色数的一个上界

δ和△分别表示图G的最小度和最大度,利用概率方法研究点可区别IV-全色数的上界,证得如果δ≥2,δ≥61n△,n≤([16Δ(Δ-1)]~(δ-1))/(96π·δ~(δ+2)·(Δ+1)),那么x_(vt)~(iv)(G)≤16Δ(Δ-1).     

Homogenization of Elliptic Problems with Neumann Boundary Conditions in Non-smooth Domains

We consider a family of second-order elliptic operators {L_ε} in divergence form with rapidly oscillating and periodic coefficients in Lipschitz and convex domains in R~n. We are able to show that the uniform W~(1,p) estimate of second order elliptic systems holds for 2n/(n+1)-δ p 2n/(n-1)+ δ where δ 0 is independent of ε and the ranges are sharp for n = 2, 3. And for elliptic equations in Lipschitz domains, the W~(1,p) estimate is true for 3/2-δ p 3 + δ if n ≥ 4, similar estimate was extended to convex domains for 1 p ∞.     

Inequalities for the Gaussian hypergeometric function

we study the monotonicity of certain combinations of the Gaussian hypergeometric functions F(-1/2,1/2;1;1- xc) and F(-1/2- δ,1/2 + δ;1;1- xd) on(0,1) for given 0 c 5d/6 ∞ andδ∈(-1/2,1/2),and find the largest value δ1 = δ1(c,d) such that inequality F(-1/2,1/2;1;1- xc) F(-1/2- δ,1/2 + δ;1;1- xd) holds for all x ∈(0,1). Besides,we also consider the Gaussian hypergeometric functions F(a- 1- δ,1- a + δ;1;1- x3) and F(a- 1,1- a;1;1- x2) for given a ∈ [1/29,1) and δ∈(a- 1,a),and obtain the analogous results.     

图是超限制性边连通的充分条件

设G=（V,E）是连通图.边集S E是一个限制性边割,如果G-S是不连通的且G—S的每个分支至少有两个点.G的限制性连通度λ＇（G）是G的一个最小限制性边割的基数.G是λ＇-连通的,如果G存在限制性边割.G是λ＇-最优的,如果λ＇（G）=ζ（G）,其中ζ（G）是min{d（x）＋d（y）-2：xy是G的一条边}.进一步,如果每个最小的限制性边割都孤立一条边,则称G是超限制性边连通的或是超-λ＇.G的逆度R（G）=∑_（v∈V） 1/d（v）,其中d（v）是点v的度数.我们证明了G是λ＇-连通的且不含三角形,如果R（G）≤2＋1/ζ-ζ/（（2δ-2）（2δ-3））＋（n-2δ-ζ＋2）/（（n-2δ＋1）（n-2δ＋2））,则G是超-λ＇.     

Rate of decay of solutions of the wave equation with arbitrary localized nonlinear damping

We study the rate of decay of solutions of the wave equation with localized nonlinear damping without any growth restriction and without any assumption on the dynamics. Providing regular initial data, the asymptotic decay rates of the energy functional are obtained by solving nonlinear ODE. Moreover, we give explicit uniform decay rates of the energy. More precisely, we find that the energy decays uniformly at last, as fast as 1/(ln(t+2))^2−δ,∀δ>0, when the damping has a polynomial growth or sublinear, and for an exponential damping at the origin the energy decays at last, as fast as 1/(ln(ln(t+e²)))^2−δ,∀δ>0.     

The forcing number of graphs with given girth

In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial subset S of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to be colored. The initial set S is called a forcing set of G if, by iteratively applying the forcing process, every vertex in G becomes colored. The forcing number, originally known as the zero forcing number, and denoted F (G), of G is the cardinality of a smallest forcing set of G. We study lower bounds on the forcing number in terms of its minimum degree and girth, where the girth g of a graph is the length of a shortest cycle in the graph. Let G be a graph with minimum degree δ ≥ 2 and girth g ≥ 3. Davila and Kenter [Theory and Applications of Graphs, Volume 2, Issue 2, Article 1, 2015] conjecture that F (G) ≥ δ + (δ ? 2)(g ? 3). This conjecture has recently been proven for g ≤ 6. The conjecture is also proven when the girth g ≥ 7 and the minimum degree is sufficiently large. In particular, it holds when g = 7 and δ ≥ 481, when g = 8 and δ ≥ 649, when g = 9 and δ ≥ 30, and when g = 10 and δ ≥ 34. In this paper, we prove the conjecture for g ∈ {7, 8, 9, 10} and for all values of δ ≥ 2.     

Degree-bounded minimum spanning trees

Given n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks for a spanning tree of minimum weight in which the degree of each vertex is at most δ. The problem is NP-hard for 2≤δ≤3, while the NP-hardness of the problem is open for δ=4. The problem is polynomial-time solvable when δ=5. By presenting an improved approximation analysis for Chan’s degree-4 MST algorithm [T. Chan, Euclidean bounded-degree spanning tree ratios, Discrete & Computational Geometry 32 (2004) 177-194], we show that, for any arbitrary collection of points in the Euclidean plane, there always exists a degree-4 spanning tree of weight at most times the weight of an MST.     

推广的Bessel过程的L~p估计

随机微分方程dX_t=(δf~2(t)-h(t)X_t)dt+2f(t) │X_t│～(1/2)dBt,(X_0=x,δ>0)的解X_t是一种推广的δ(δ>0)维Bessel过程.文章对于任意停时τ给出了‖sup0≤t≤τη(t)X_t‖p的L~p估计,其中η:R_+→R_+是一个R+上的可微函数,而且满足微分方程dη/dt-h(t)η=-η~2f~2(t),η(0)=1.     

图簇Y_(λ_kδ)∪β_kS_δ~*的伴随分解及其补图的色等价性

设P_n是具有n个顶点的路,令δ=rn+1,我们S_δ~*表示把rP_(n+1)的每个分支的一个1度点重迭在一起得到的图.用Y_(λ_1δ)~(S*)表示把r_1S_δ~*中每个分支的r度顶点与S_δ~*的r度顶点依次邻接后得到的图,Y_(λ_2δ)~(S*)表示把用r_2Y_(λ_1δ)~(S*)中每个分支的r+r1度顶点与S_δ~*的r度顶点依次邻接后得到的图,一般地,Y_(λ_kδ)~(S*)表示把用r_kY_(λ_(k-1)δ)~(S*)中每个分支的r+r_k-1度顶点与S_δ~*的r度顶点依次邻接后得到的图,运用图的伴随多项式的性质,证明了图Y_(λ_kδ)~(S*)∪β_kS_δ~*的伴随多项式的因式分解定理,进而得到了这类图的补图的色等价性.     

An asymptotic expansion for the semi‐infinite sum of Dirac‐δ functions

In this paper, we derive an asymptotic expansion for the semi‐infinite sum of Dirac‐δ functions centered at discrete equidistant points defined by the set . The method relies on the Laplace transform of the semi‐infinite sum of Dirac‐δ functions. The derived series distribution takes the form of the Euler‐Maclaurin summation when the distributions are defined for complex or real‐valued continuous functions over the interval . For n=1, the series expansion contributes with a term equal to δ(x)/2, which survives in the limit when a→0⁺. This term represents a correction term, which is in general omitted in calculations of the density of states of quantum confined systems by finite‐size effects.