Analysis of blockwise shrinkage wavelet estimates via lower bounds for no-signal setting

A blockwise shrinkage is a popular procedure of adaptation that has allowed the statisticians to establish an impressive bouquet of asymptotic mathematical results and develop softwares for solving practical problems. Traditionally risks of the estimates are studied via upper bounds that imply sufficient conditions for a blockwise shrinkage procedure to be minimax. This article suggests to analyze the estimates via exact (non-asymptotic) lower bounds established for a no-signal setting. The approach complements the familiar minimax, Bayesian and numerical analysis, it allows to find necessary conditions for a procedure to attain desired rates, and it sheds a new light on popular choices of blocks and thresholds recommended in the literature. Mathematical results are complemented by a numerical study. Supported in part by NSF Grants DMS-9971051 and DMS-0243606.     

Sequential Estimation of the Parameters in a Trigonometric Regression Model with the Gaussian Coloured Noise

This paper considers the estimation problem for a trigonometric regression model with the noise specified by the Ornstein–Uhlenbeck process with unknown parameter. We propose a sequential procedure which ensures a prescribed mean square precision uniformly in the nuisance parameter. The asymptotic behaviour of the procedure duration mean has been studied. This revised version was published online in August 2006 with corrections to the Cover Date.     

A strong law of large numbers for generalized random sets from the viewpoint of empirical processes

In this article we prove a strong law of large numbers for Borel measurable nonseparably valued random elements in the case of generalized random sets.

     

Second Order Representations of the Least Absolute Deviation Regression Estimator

We consider exact weak and strong Bahadur-Kiefer representations of the least absolute deviation estimator for the linear regression model. The precise behavior of these representations is obtained under minimal conditions.     

Extension of multivariate regression trees to interval data. Application to electricity load profiling

Summary  Several data can be presented as interval curves where intervals reflect a within variability. In particular, this representation is well adapted for load profiles, which depict the electricity consumption of a class of customers. Electricity load profiling consists in assigning a daily load curve to a customer based on their characteristics such as energy requirement. Within the load profiling scope, this paper investigates the extension of multivariate regression trees to the case of interval dependent (or response) variables. The tree method aims at setting up simultaneously load profiles and their assignment rules based on independent variables. The extension of multivariate regression trees to interval responses is detailed and a global approach is defined. It consists in a first stage of a dimension reduction of the interval response variables. Thereafter, the extension of the tree method is applied to the first principal interval components. Outputs are the classes of the interval curves where each class is characterized both by an interval load profile (e.g. the class prototype) and an assignment rule based on the independent variables.     

随机删失场合半参数回归模型参数估计的重对数律‘

本文探讨了随机删失场合半参数回归模型的参数估计问题.考虑半参数回归模型Y =X}}3 + g(T)十。，其中(X,T)’为取值于Kp X [0,1〕上的随机向量，月为1'维未知参数向量，8为定义于【0.1]上的未知函数，。为随机误差，Ee = 0 . Eez = az }。未知，且(X ,T)与。独立，).被一个与之独立的随机变量V所截.此时仅能观察到:Z=min(Y,V),o=1(Y簇V)，参数I3,az的估计量禽及公 z可综合非参数的权函数估计法与参数的最小二乘估计方法得到.本文对核函数的情形得到了念及ar z的精确收敛速度即重对数律.     

Self-organized critical pinball machine

The nature of self-organized criticality (SOC) is pin-pointed with a simple mechanical model: a pinball machine. Its phase space is fully parameterized by two integer variables, one describing the state of an on-going game, the other describing the state of the machine. This is the simplest possible SOC system, having only two degrees of freedom and no spatial correlations, yet is not solvable by analytical means.     

田径径赛记录模型及其分析

文平，马振东．田径径赛记录模型及其分析．数理统计与管理，１９９８，１７（３），１６～２０．本文给出了世界和亚洲的田径径赛记录模型，从统计学的角度分析和说明了田径赛容易突破的项目，提出了田径理论中的一些新观点，最后对世界记录做了预测     

Discrete and Continuous Time Modulated Random Walks with Heavy-Tailed Increments

We consider a modulated process S which, conditional on a background process X, has independent increments. Assuming that S drifts to −∞ and that its increments (jumps) are heavy-tailed (in a sense made precise in the paper), we exhibit natural conditions under which the asymptotics of the tail distribution of the overall maximum of S can be computed. We present results in discrete and in continuous time. In particular, in the absence of modulation, the process S in continuous time reduces to a Lévy process with heavy-tailed Lévy measure. A central point of the paper is that we make full use of the so-called “principle of a single big jump” in order to obtain both upper and lower bounds. Thus, the proofs are entirely probabilistic. The paper is motivated by queueing and Lévy stochastic networks.     

BERNOULLI CONVOLUTIONS ASSOCIATED WITH CERTAIN NON-PISOT NUMBERS

1　IntroductionForany 0 <λ <1 ,letνλ　denotethedistributionof ∞n=0 εnλn wherethecoefficientsεnareeither0or1 ,chosenindependentlywithprobability12 foreach .Itistheinfiniteconvo lutionproductofthedistributions 12 (δ0 +δλn) ,givingrisetotheterm“infiniteBernoulliconvolution”orsimply“Bernoulliconvolution” .TheBernoulliconvolutioncanbeexpressedasaself similarmeasureνλsatisfyingtheequationνλ =12 νλ φ- 10 + 12 νλ φ- 11,( 1 .1 )whereφ0 (x) =λxand φ1(x) =λx + 1 .Thisme…