WEAK CONVERGENCE FOR NON-UNIFORM φ-MIXING RANDOM FIELDS

Let $\{\xi_{\bold t}, {\bold t} \in {\bold Z}^d\}$ be a nonuniform $\varphi$-mixing strictly stationary real random field with $E\xi_{\bold 0}=0, E|\xi_{\bold 0}|^{2+\delta}<\infty$ for some $0<\delta<1$. A sufficient condition is given for the sequence of partial sum set-indexed process $\{Z_n(A),\ A\in \Cal A\}$ to converge to Brownian motion. By a direct calculation, the author shows that the result holds for a more general class of set index ${\Cal A}$, where ${\Cal A}$ is assumed only to have the metric entropy exponent $r, 0相似文献   

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

一种可能的简并谱NNS分布

利用随机矩阵理论,通过对一特殊情形的简并谱展开研究,得到了简并谱一种可能的最小相邻间距NNS分布函数．研究表明,由于简并的存在,简并谱不仅可分解成随机谱和规则谱两个子谱,同时还影响其规则谱,使规则谱的能级斥力减少．     

On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes

It is well known that the complexity, i.e. the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as Θ(n²). It is also known that if the points are chosen Independently Identically Distributed uniformly from a 3-dimensional region such as a cube or sphere, then the expected complexity falls to O(n). In this paper we introduce the problem of analyzing what occurs if the points are chosen from a 2-dimensional region in 3-dimensional space. As an example, we examine the situation when the points are drawn from a Poisson distribution with rate n on the surface of a convex polytope. We prove that, in this case, the expected complexity of the resulting Voronoi diagram is O(n).     

Synthesis of molecular imprinted organic-inorganic hybrid polymer binding caffeine

Random copolymers of poly{(methacrylamide)-co-(vinyl trimethoxysilane)} and poly{(methacrylic acid)-co-(vinyl trimethoxysilane)} were synthesized via a free radical polymerization reaction. Acid catalyzed sol-gel process of tetraethylorthosilicate (TEOS) with aforementioned polymers in the presence of methyl xanthine class of alkaloid like caffeine resulted in the formation of highly transparent monoliths. Solvent extraction of the template leaves behind the recognition sites intact with high selectivity towards the print molecule. The ionic and non-specific adsorptions, which are considered to be the main disadvantages of the molecularly imprinted polymers (MIP), are prevented to a considerable extent by the end capping of surface silanol groups. The template binding efficiencies of MIP were determined by HPLC analysis.     

Moments of an exponential functional of random walks and permutations with given descent sets

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial Y = 1 + ξ₁ + ξ₁ξ₂ + ξ₁ξ₂ξ₃ + ⋯ of independent and identically distributed non-negative random variables. It has moments that are rational functions of the variables μ _k = E(ξ ^k ) < 1 with universal coefficients. It turns out that such a coefficient is equal to the number of permutations with descent set defined by the multiindex of the coefficient. A recursion enumerates all numbers of permutations with given descent sets in the form of a Pascal-type triangle. This revised version was published online in August 2006 with corrections to the Cover Date.     

基于重复测量数据的Poisson回归模型的偏大离差的Score检验

Poisson回归模型广泛应用于分析计数型数据 ,Dean&Lawless(1989)和Dean(1992 )讨论了非重复测量得到的计数型数据的偏大离差存在性的检验问题 .本文分别利用随机系数模型和对数非线性模型讨论了基于重复测量得到的计数型数据的偏大离差的检验问题 ,得到了检验的score统计量 .     

One-dimensional non-nearest-neighbor random walks in the presence of traps

A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site.     

Euler characteristic and related measures for random geometric sets

By an elementary calculation we obtain the exact mean values of Minkowksi functionals for a standard model of percolating sets. In particular, a recurrence theorem for the mean Euler characteristic recently put forward is shown to be incorrect. Related previous mathematical work is mentioned. We also conjecture bounds for the threshold density of continuum percolation, which are associated with the Euler characteristic.