On the estimation of optimal batch sizes in the analysis of simulation output

The estimation of the variance of point estimators is a classical problem of stochastic simulation. A more specific problem addresses the estimation of the variance of a sample mean from a steady-state autocorrelated process. Many proposed estimators of the variance of the sample mean are parameterized by batch size. A critical problem is to find an appropriate batch size that provides a good tradeoff between bias and variance. This paper proposes a procedure for determining the optimal batch size to minimize the mean squared error of estimators of the variance of the sample mean. This paper also presents the results of empirical studies of the procedure. The experiments involve symmetric two-state Markov chain models, first-order autoregressive processes, seasonal autoregressive processes, and queue-waiting times for several M/M/1 queueing models. The empirical results indicate that the estimation procedure works nearly as well as it would if the parameters of the processes were known.     

Minimax kernels for density estimation with biased data

This paper considers the asymptotic properties of two kernel estimates % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaacamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E82!\[\tilde f_{_n }\]and % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaqcamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E83!\[\hat f_{_n }\], which have been proposed by Bhattacharyya et al. (1988, Comm. Statist. Theory Methods, A17, 3629–3644) and Jones (1991, Biometrika, 78, 511–519), respectively, for estimating the underlying density f at a point under a general selection biased model. The asymptotic optimality of % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaqcamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E83!\[\hat f_{_n }\]and % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaacamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E82!\[\tilde f_{_n }\]is measured by the corresponding asymptotic minimax mean squared errors under a compactly supported Lipschitz continuous family of the underlying densities. It is shown that, in general, % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaqcamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E83!\[\hat f_{_n }\]is a superior local estimate than % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaacamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E82!\[\tilde f_{_n }\]in the sense that the asymptotic minimax risk of % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaqcamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E83!\[\hat f_{_n }\]is lower than that of % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaacamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E82!\[\tilde f_{_n }\]. The minimax kernels and bandwidths of % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaqcamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E83!\[\hat f_{_n }\]are computed explicity and shown to have simple forms and depend on the weight functions of the model.     

Toeplitz quantization on Fock space

For Toeplitz operators $T_f^{(t)}$ acting on the weighted Fock space $H_t^2$, we consider the semi-commutator $T_f^{(t)}{T}_g^{(t)}?T_{fg}^{(t)}$, where $t>0$ is a certain weight parameter that may be interpreted as Planck's constant ? in Rieffel's deformation quantization. In particular, we are interested in the semi-classical limit

($?$)$\underset{t\to 0}{\lim }?{6T_f^{(t)}{T}_g^{(t)}?T_{fg}^{(t)}6}_t.$

It is well-known that ${6T_f^{(t)}{T}_g^{(t)}?T_{fg}^{(t)}6}_t$ tends to 0 under certain smoothness assumptions imposed on f and g. This result was recently extended to $f,g\in \mathrm{BUC}({\mathbb{C}}^n)$ by Bauer and Coburn. We now further generalize (?) to (not necessarily bounded) uniformly continuous functions and symbols in the algebra $\mathrm{VMO}\cap L^{\infty }$ of bounded functions having vanishing mean oscillation on ${\mathbb{C}}^n$. Our approach is based on the algebraic identity $T_f^{(t)}{T}_g^{(t)}?T_{fg}^{(t)}=?{(H_{\overline{f}}^{(t)})}^{?}{H}_g^{(t)}$, where $H_g^{(t)}$ denotes the Hankel operator corresponding to the symbol g, and norm estimates in terms of the (weighted) heat transform. As a consequence, only f (or likewise only g) has to be contained in one of the above classes for (?) to vanish. For g we only have to impose ${\lim \sup }_{t\to 0}{6H_g^{(t)}6}_t<\infty$, e.g. $g\in L^{\infty }({\mathbb{C}}^n)$. We prove that the set of all symbols $f\in L^{\infty }({\mathbb{C}}^n)$ with the property that ${\lim }_{t\to 0}?{6T_f^{(t)}{T}_g^{(t)}?T_{fg}^{(t)}6}_t={\lim }_{t\to 0}?{6T_g^{(t)}{T}_f^{(t)}?T_{gf}^{(t)}6}_t=0$ for all $g\in L^{\infty }({\mathbb{C}}^n)$ coincides with $\mathrm{VMO}\cap L^{\infty }$. Additionally, we show that $\underset{t\to 0}{\lim }?{6T_f^{(t)}6}_t={6f6}_{\infty }$ holds for all $f\in L^{\infty }({\mathbb{C}}^n)$. Finally, we present new examples, including bounded smooth functions, where (?) does not vanish.     

The opportunity cost of mean–variance choice under estimation risk

Mean–variance portfolio choice is often criticized as sub-optimal in the more general expected utility framework. It is argued that the expected utility framework takes into consideration higher moments ignored by mean variance analysis. A body of research suggests that mean–variance choice, though arguably sub-optimal, provides very close-to-expected utility maximizing portfolios and their expected utilities, basing its evaluation on in-sample analysis where mean–variance choice is sub-optimal by definition. In order to clarify this existing research, this study provides a framework that allows comparing in-sample and out-of-sample performance of the mean variance portfolios against expected utility maximizing portfolios. Our in-sample results confirm the results of earlier studies. On the other hand, our out-of-sample results show that the expected utility model performs worse. The out-of-sample inferiority of the expected utility model is more pronounced for preferences and constraints under which in-sample mean variance approximations are weakest. We argue that, in addition to its elegance and simplicity, the mean–variance model extracts more information from sample data because it uses the covariance matrix of returns. The expected utility model may reach its optimal solution without using information from the covariance matrix.     

气体分子碰撞的模型无关分析

本文纯粹基于统计平均的思想,模型无关分析导出了气体分子的碰壁数和平均碰撞频率.     

Shears mechanism in two-dimensional cranking relativistic mean field approach

Using the new two-dimensional cranking relativistic mean field (RMF) approach, the shears mechanism of magnetic rotation based on configuration πh²_11/2⊙νh^－2_11/2 in ¹⁴²Gd is microscopically and self-consistently examined by investigating the aligning angular momenta of the valence nucleons.     

Entropy squeezing of an atom with a k-photon in the Jaynes--Cummings model

The entropy squeezing of an atom with a k-photon in the Jaynes-Cummings model is investigated. For comparison, we also study the corresponding variance squeezing and atomic inversion. Analytical results show that entropy squeezing is preferable to variance squeezing for zero atomic inversion. Moreover, for initial conditions of the system the relation between squeezing and photon transition number is also discussed. This provides a theoretical approach to finding out the optimal entropy squeezing.     

关于Smarandache LCM函数的一类均方差问题

利用初等及解析方法研究均方差(SL(n)-(Ω)(n)))2的均值分布问题,并获得了一个有趣的渐近公式.     

Parameter allocation of parallel array bistable stochastic resonance and its application in communication systems

In this paper, we propose a parameter allocation scheme in a parallel array bistable stochastic resonance-based communication system(P-BSR-CS) to improve the performance of weak binary pulse amplitude modulated(BPAM) signal transmissions. The optimal parameter allocation policy of the P-BSR-CS is provided to minimize the bit error rate(BER)and maximize the channel capacity(CC) under the adiabatic approximation condition. On this basis, we further derive the best parameter selection theorem in realistic communication scenarios via variable transformation. Specifically, the P-BSR structure design not only brings the robustness of parameter selection optimization, where the optimal parameter pair is not fixed but variable in quite a wide range, but also produces outstanding system performance. Theoretical analysis and simulation results indicate that in the P-BSR-CS the proposed parameter allocation scheme yields considerable performance improvement, particularly in very low signal-to-noise ratio(SNR) environments.