混合线性模型M估计的强相合性

研究了混合样本线性模型中回归参数M估计的强相合性,在较弱的矩条件下,获得了M估计是强相合的充分条件,实质性地改进和推广了文[1]定理3.1.     

ρ混合、φ混合、ψ混合线性模型M估计的强相合性

研究了 ρ混合、φ混合、ψ混合样本线性模型中回归参数M估计的强相合性 ,在条件不变的情况下 ,获得与独立情形一样的M估计是强相合的充分条件 ,推广了文 [1 ]定理 2 .     

混合样本线性模型M估计的强相合性

研究了混合样本线性模型中的M估计,在较弱的矩条件下,获得了M估计是强相合估计的充分条件.与相应结论比较,有了较大的实质性改进.     

(ρ)混合样本线性模型M估计的强相合性

研究了(ρ)混合样本线性模型中的M估计,在较弱的矩条件下,获得了M估计是强相合估计的充分条件.与相应结论比较,有了较大的实质性改进.     

■混合样本下非参数核回归估计的强相合性

本文在■混合样本下讨论Gasser和Müller提出的一类非参数核回归估计的强相合性.在较弱的条件下,证明了该估计的强相合性与一致强相合性.     

M-估计下误差密度核估计的相合性

线性模型Yi=x′iβ ei,i=1,2…，其中{ei}i^∞=1,i.i.d.,有未知密度f(x），本文讨论了在对β作一般M－估计后，基于残差做出的误差密度核估计的相合性，在比文献弱的条件下，证明了误差密度核估计的逐点弱相合，逐点强相合和一致强相合。     

强混合样本且含附加信息情形M估计和分位数估计的渐近性质（英文）

在强混合样本且含附加信息情形,本文采用经验似然方法提出了一类新的M估计和新的分位数估计.结果表明,本文提出的M估计和分位数估计具有相合性和渐近正态性,且其渐近方差比一般M估计和分位数估计的渐近方差小.     

左截断右删失模型下乘积限估计的强大数律(Ⅱ)

对左截断右删失模型，在不要求分布函数连续的条件下，给出乘积限估计F_n是真分布的一致强相合估计的完整结果．作为推论，还给出右删失模型下的K－M估计和左截断模型下的乘积限估计的一致强相合性的完整结果．     

误差为NSD序列的广义线性模型的M估计的强相合性

研究了以NSD序列(negatively superadditive dependent)为误差的广义线性模型,得到了未知参数的M估计.在较弱的条件下,利用指数不等式、NSD序列加权和的强收敛性和Borel-Cantelli引理等证明了未知参数M估计的强相合性.此结果推广了独立误差和NSD误差的线性模型的相应结果.     

误差为NOD线性模型参数M估计的强相合性

研究了随机误差为NOD序列的线性模型中回归参数β_0的M估计,在较弱的矩条件下证明了回归参数M估计的强相合性,推广和改进了陈和赵(1996),杨(2002)和Wu(2006)等的结果,推广了肖(2007)等的结果.     

Signed graphs and the freeness of the Weyl subarrangements of type Bℓ

A Weyl arrangement is the hyperplane arrangement defined by a root system. Saito proved that every Weyl arrangement is free. The Weyl subarrangements of type $A_{\ell }$ are represented by simple graphs. Stanley gave a characterization of freeness for this type of arrangements in terms of their graph. In addition, the Weyl subarrangements of type $B_{\ell }$ can be represented by signed graphs. A characterization of freeness for them is not known. However, characterizations of freeness for a few restricted classes are known. For instance, Edelman and Reiner characterized the freeness of the arrangements between type $A_{\ell -1}$ and type $B_{\ell }$. In this paper, we give a characterization of the freeness and supersolvability of the Weyl subarrangements of type $B_{\ell }$ under certain assumption.     

Equivalences among Z2s-linear Hadamard codes

The ${\mathbb{Z}}_{2^s}$-additive codes are subgroups of ${\mathbb{Z}}_{2^s}^n$, and can be seen as a generalization of linear codes over ${\mathbb{Z}}_2$ and ${\mathbb{Z}}_4$. A ${\mathbb{Z}}_{2^s}$-linear Hadamard code is a binary Hadamard code which is the Gray map image of a ${\mathbb{Z}}_{2^s}$-additive code. A partial classification of these codes by using the dimension of the kernel is known. In this paper, we establish that some ${\mathbb{Z}}_{2^s}$-linear Hadamard codes of length $2^t$ are equivalent, once $t$ is fixed. This allows us to improve the known upper bounds for the number of such nonequivalent codes. Moreover, up to $t=11$, this new upper bound coincides with a known lower bound (based on the rank and dimension of the kernel). Finally, when we focus on $s\in \{2,3\}$, the full classification of the ${\mathbb{Z}}_{2^s}$-linear Hadamard codes of length $2^t$ is established by giving the exact number of such codes.     

Problems on matchings and independent sets of a graph

Let $G$ be a finite simple graph. For $X?V\left(G\right)$, the difference of $X$, $d\left(X\right)?\left|X\right|?\left|N\left(X\right)\right|$ where $N\left(X\right)$ is the neighborhood of $X$ and $max\{d\left(X\right):X?V\left(G\right)\}$ is called the critical difference of $G$. $X$ is called a critical set if $d\left(X\right)$ equals the critical difference and $\ker \left(G\right)$ is the intersection of all critical sets. $\mathrm{diadem}\left(G\right)$ is the union of all critical independent sets. An independent set $S$ is an inclusion minimal set with$d\left(S\right)>0$ if no proper subset of $S$ has positive difference.A graph $G$ is called a König–Egerváry graph if the sum of its independence number $\alpha \left(G\right)$ and matching number $\mu \left(G\right)$ equals $\left|V\left(G\right)\right|$.In this paper, we prove a conjecture which states that for any graph the number of inclusion minimal independent set $S$ with $d\left(S\right)>0$ is at least the critical difference of the graph.We also give a new short proof of the inequality $\left|\ker \left(G\right)\right|+\left|\mathrm{diadem}\left(G\right)\right|\le 2\alpha \left(G\right)$.A characterization of unicyclic non-König–Egerváry graphs is also presented and a conjecture which states that for such a graph $G$, the critical difference equals $\alpha \left(G\right)?\mu \left(G\right)$, is proved.We also make an observation about $\ker \left(G\right)$ using Edmonds–Gallai Structure Theorem as a concluding remark.     

Rough path properties for local time of symmetric α stable process

In this paper, we first prove that the local time associated with symmetric $\alpha$-stable processes is of bounded $p$-variation for any $p>\frac{2}{\alpha ?1}$ partly based on Barlow’s estimation of the modulus of the local time of such processes.  The fact that the local time is of bounded $p$-variation for any $p>\frac{2}{\alpha ?1}$ enables us to define the integral of the local time ${\int }_{?\infty }^{\infty }{?}_{?}^{\alpha ?1}f\left(x\right)d_x{L}_t^x$ as a Young integral for less smooth functions being of bounded $q$-variation with $1\le q<\frac{2}{3?\alpha }$. When $q\ge \frac{2}{3?\alpha }$, Young’s integration theory is no longer applicable. However, rough path theory is useful in this case. The main purpose of this paper is to establish a rough path theory for the integration with respect to the local times of symmetric $\alpha$-stable processes for $\frac{2}{3?\alpha }\le q<4$.     

Reconfiguration graphs of shortest paths

For a graph $G$ and$a,b\in V\left(G\right)$, the shortest path reconfiguration graph of $G$ with respect to $a$ and$b$ is denoted by $S(G,a,b)$. The vertex set of $S(G,a,b)$ is the set of all shortest paths between $a$ and$b$ in $G$. Two vertices in $V\left(S(G,a,b)\right)$ are adjacent, if their corresponding paths in $G$ differ by exactly one vertex. This paper examines the properties of shortest path graphs. Results include establishing classes of graphs that appear as shortest path graphs, decompositions and sums involving shortest path graphs, and the complete classification of shortest path graphs with girth 5 or greater. We include an infinite family of well structured examples, showing that the shortest path graph of a grid graph is an induced subgraph of a lattice.