General Weak Laws of Large Numbers for Bootstrap Sample Means

Abstract

For bootstrap sample means resulting from a sequence {X _n , n ≥ 1} of random variables, very general weak laws of large numbers are established. The random variables {X _n , n ≥ 1} do not need to be independent or identically distributed or be of any particular dependence structure. In general, no moment conditions are imposed on the {X _n , n ≥ 1}. Examples are provided that illustrate the sharpness of the main results.     

On Markov Chain Approximations to Semilinear Partial Differential Equations Driven by Poisson Measure Noise

We consider the stochastic model of water pollution, which mathematically can be written with a stochastic partial differential equation driven by Poisson measure noise. We use a stochastic particle Markov chain method to produce an implementable approximate solution. Our main result is the annealed law of large numbers establishing convergence in probability of our Markov chains to the solution of the stochastic reaction-diffusion equation while considering the Poisson source as a random medium for the Markov chains.     

模n剩余类环零因子图的一些性质

模n剩余类环Z_n的零因子图记为Γ(Z_n),其顶点为Z_n的所有非零零因子,两个不同的顶点x与y有一条边相连当且仅当xy=0.对Γ(Zn)和(?)的欧拉性及一笔画性进行了探讨,完全确定了当n为何值时,Γ(Z_n)和(?)为欧拉图或是一笔画图.     

Strong Laws of Large Numbers for Weighted Sums of Ч-mixing Sequence

In this paper, strong laws of large numbers for weighted sums of Ч-mixing sequence are investigated. Our results extend the corresponding results for negatively associated sequence to the case of Ч-mixing sequence.     

φ^~混合序列的大数定律和完全收敛性

主要研究了φ^~混合序列的大数定律和完全收敛性,获得了与独立情形一样的大数定律和完全收敛定理．     

Christoffel Words and Markoff Triples: An Algebraic Approach

We introduce a family of modules, called Markoff modules, generated by a cluster-mutation-like iterative process. We show that these modules are combinatorially similar to Christoffel words. Furthermore, we construct a bijective map between the set of Markoff module triples and the set of proper Markoff triples. This allows us to interpret the uniqueness conjecture for Markoff numbers within an algebraic framework.     

Resolutions of 2 and 3 Dimensional Rings of Invariants for Cyclic Groups

Let G be the cyclic group of order n, and suppose F is a field containing a primitive nth root of unity. We consider the ring of invariants F[W] ^G of a three dimensional representation W of G where G ? SL(W). We describe minimal generators and relations for this ring and prove that the lead terms of the relations are quadratic. These minimal generators for the relations form a Gröbner basis with a surprisingly simple combinatorial structure. We describe the graded Betti numbers for a minimal free resolution of F[W] ^G . The case where W is any two dimensional representation of G is also handled.     

Leap-frogging Newton's method

Using Newton's method as an intermediate step, we introduce an iterative method that approximates numerically the solution of f (x) = 0. The method is essentially a leap-frog Newton's method. The order of convergence of the proposed method at a simple root is cubic and the computational efficiency in general is less, but close to that of Newton's method. Like Newton's method, the new method requires only function and first derivative evaluations. The method can easily be implemented on computer algebra systems where high machine precision is available.