On an improved Erdő-Rényi-type law for increments of partial sums

Let X₁, X₂,… be an independently and identically distributed sequence with ξX₁ = 0, ξ exp (tX₁ < ∞ (t ≧ 0) and partial sums S_n = X₁ + … + X_n. Consider the maximum increment D₁ (N, K) = max_{0≤n ≤ N - K} (S_{n + K} - S_n)of the sequence (S_n) in (0, N) over a time K = K_N, 1 ≦ K ≦ N. Under appropriate conditions on (K_N) it is shown that in the case K_N/log N → 0, but K_N/(log N)^1/2 → ∞, there exists a sequence (α_N) such that K_-1/2 D₁ (N, K) - α_N converges to 0 w. p. 1. This result provides a small increment analogue to the improved Erd?s-Rényi-type laws stated by Csörg? and Steinebach (1981).     

H公式的三个巧合

本文对H公式统一了不同的完全相关数对的规律，H公式与异常级数和素数公式之间的联系，H公式与哈代－李特伍德公式的关系作了一定的分析研究与探讨。     

Refinements of the no-envy solution in economies with indivisible goods

We consider the problem of fair allocation in economies with indivisible goods. Our primary concept is that of an envy-free allocation, that is, an allocation such that no agent would prefer anyone else's bundle to his own. Since there typically is a large set (a continuum) of such allocations, the need arises to identify well-behaved selections from the no-envy solution. First we establish the non-existence of population monotonic selections. Then we propose a variety of selections motivated by intuitive considerations of fairness.     

Two Birthday Problems

ABSTRACT

This article focuses on two birthday problems which naturally follow from the most common birthday problems taught in statistics courses. The solutions to these new problems provide a good illustration of several combinatorial techniques.     

Convergence properties for weighted sums of NSD random variables

Abstract

Let {X_n, n ? 1} be a sequence of negatively superadditive dependent (NSD, in short) random variables and {b_ni, 1 ? i ? n, n ? 1} be an array of real numbers. In this article, we study the strong law of large numbers for the weighted sums ∑ⁿ_{i = 1}b_niX_i without identical distribution. We present some sufficient conditions to prove the strong law of large numbers. As an application, the Marcinkiewicz-Zygmund strong law of large numbers for NSD random variables is obtained. In addition, the complete convergence for the weighted sums of NSD random variables is established. Our results generalize and improve some corresponding ones for independent random variables and negatively associated random variables.     

The strong law of large numbers and the Shannon-McMillan theorem for the mth-order nonhomogeneous Markov chains indexed by an m rooted Cayley tree

ABSTRACT

In this article, we studied the strong law of large numbers(LLN) and Shannon-McMillan theorem for an mth-order nonhomogeneous Markov chain indexed by an m- rooted Cayley tree. This article generalized the relative results of level mth-order nonhomogeneous Markov chains indexed by an m- rooted Cayley tree.     

Third-Order Translog Utility Functions

This article examines the advantages of estimating a third-order rather than a second-order translog utility function in a theoretical and empirical context. It is demonstrated that the rigor of tests for appropriate functional form is increased by increasing the order of approximation. An empirical example demonstrates that a second-order approximation can lead to inconsistent parameter estimates, whereas the third-order translog allows for better modeling of the preference structure and more consistent estimates for policy decisions.     

Evaluation of Beta Generation Algorithms

In this article, we discuss the maximum likelihood estimates (MLEs) for the exponential and Weibull distributions by considering progressive Type-I interval censored data. For exponential distribution, the explicit expression of MLE of failure rate cannot be obtained when the intervals are not equal in length. The direct application of some numerical algorithms, such as the Newton–Raphson algorithm, is non-ideal because of the cumbersome second derivative. We apply some equivalent quantities to obtain the MLE of failure rate of exponential distribution. Based on the equivalent quantities and the Weibull-to-exponential transformation technique, we propose a new algorithm to obtain the MLEs for the parameters of progressive Type-I interval Weibull data. An example reanalysis and some simulation studies are carried out to illustrate the performance of the estimations using the new algorithm.     

Fast Random Number Generation Using 128-Bit Multimedia Extension Registers on Pentium Class Machines

In this article, it is shown how 128-bit SSE2 multimedia extension registers, present in Pentium IV class 32-bit processors, may be used to generate random numbers at several times greater speed then when regular general purpose registers are used. In particular, a 128-bit algorithm is presented for the Marsaglia MWC1616 generator from the DIEHARD battery of random number generator tests, and its performance is compared to that of the conventional approach.     

区间型符号数据回归分析及其应用

介绍了符号数据分析方法的基本理论.针对一种最常用的符号数据——区间型符号数据,基于误差传递的理论,提出了区间回归分析的方法.方法包括了线性回归分析和可线性化的非线性回归分析两种情形.讨论了基于Hausdorff距离的区间数距离,基于此定义了回归模型的评价指标.进行了方法的应用研究,选取沪深300指数与中信规模风格指数,从时间维上对其日内数据进行数据打包,形成区间型符号数据;建立了区间线性回归分析模型,从全局上揭示了两类指数间的相关性.结论表明,与针对点数据的传统回归分析相比,区间型符号数据的回归分析方法不仅实现了样本空间的降维,而且有利于从整体上把握变量之间的内在关系.