Assessing respondent-driven sampling: A simulation study across different networks

The purpose was to assess RDS estimators in populations simulated with diverse connectivity characteristics, incorporating the putative influence of misreported degrees and transmission processes. Four populations were simulated using different random graph models. Each population was “infected” using four different transmission processes. From each combination of population x transmission, one thousand samples were obtained using a RDS-like sampling strategy. Three estimators were used to predict the population-level prevalence of the “infection”. Several types of misreported degrees were simulated. Also, samples were generated using the standard random sampling method and the respective prevalence estimates, using the classical frequentist estimator. Estimation biases in relation to population parameters were assessed, as well as the variance. Variability was associated with the connectivity characteristics of each simulated population. Clustered populations yield greater variability and no RDS-based strategy could address the estimation biases. Misreporting degrees had modest effects, especially when RDS estimators were used. The best results for RDS-based samples were observed when the “infection” was randomly attributed, without any relation with the underlying network structure.     

Variable Selection via Regression Trees in the Presence of Irrelevant Variables

Many tree algorithms have been developed for regression problems. Although they are regarded as good algorithms, most of them suffer from loss of prediction accuracy when there are many irrelevant variables and the number of predictors exceeds the number of observations. We propose the multistep regression tree with adaptive variable selection to handle this problem. The variable selection step and the fitting step comprise the multistep method.

The multistep generalized unbiased interaction detection and estimation (GUIDE) with adaptive forward selection (fg) algorithm, as a variable selection tool, performs better than some of the well-known variable selection algorithms such as efficacy adaptive regression tube hunting (EARTH), FSR (false selection rate), LSCV (least squares cross-validation), and LASSO (least absolute shrinkage and selection operator) for the regression problem. The results based on simulation study show that fg outperforms other algorithms in terms of selection result and computation time. It generally selects the important variables correctly with relatively few irrelevant variables, which gives good prediction accuracy with less computation time.     

Optimal scheduling replacement policies for a system with multiple random works

From the economical viewpoint in reliability theory, this paper addresses a scheduling replacement problem for a single operating system which works at random times for multiple jobs. The system is subject to stochastic failure which results the imperfect maintenance activity based on some random failure mechanism: minimal repair due to type-I (repairable) failure, or corrective replacement due to type-II (non-repairable) failure. Three scheduling models for the system with multiple jobs are considered: a single work, N tandem works, and N parallel works. To control the deterioration process, the preventive replacement is planned to undergo at a scheduling time T or the job's completion time of for each model. The objective is to determine the optimal scheduling parameters (T^* or N^*) that minimizes the mean cost rate function in a finite time horizon for each model. A numerical example is provided to illustrate the proposed analytical model. Because the framework and analysis are general, the proposed models extend several existing results.     

Closure property of consistently varying random variables based on precise large deviation principles

Let X = {X₁, X₂, …} be a sequence of independent but not necessarily identically distributed random variables, and let η be a counting random variable independent of X. Consider randomly stopped sum S_η = ∑^η_{k = 1}X_k and random maximum S_(η) ? max?{S₀, …, S_η}. Assuming that each X_k belongs to the class of consistently varying distributions, on the basis of the well-known precise large deviation principles, we prove that the distributions of S_η and S_(η) belong to the same class under some mild conditions. Our approach is new and the obtained results are further studies of Kizinevi?, Sprindys, and ?iaulys (2016) and Andrulyt?, Manstavi?ius, and ?iaulys (2017).     

平实的深刻:论朱自清的《新诗杂话》

《新诗杂话》是朱自清先生研究中国现代新诗的一部著作。朱先生在这部诗学著作中,坚守诗歌文本的分析,坚持对诗歌意义进进缜密详实的“解读”,并认为这是新诗研究的基础。论及范围宽泛,富于创见性,是这部著作的显著特点。以“解诗”为出发点,《新诗杂话》探讨了诗与感觉、诗与哲理、诗与幽默、抗战与诗、诗与建国、诗的形式、歌谣与译诗、新诗的进步性、新诗的发展趋势等诸多关系,平实而深刻,精确而简洁,“将深化为浅”是《新诗杂话》最富于生机与活力的语言叙述原则。     

Deconvolution methods for non-parametric inference in two-level mixed models

Summary.  We develop a general non-parametric approach to the analysis of clustered data via random effects. Assuming only that the link function is known, the regression functions and the distributions of both cluster means and observation errors are treated non-parametrically. Our argument proceeds by viewing the observation error at the cluster mean level as though it were a measurement error in an errors-in-variables problem, and using a deconvolution argument to access the distribution of the cluster mean. A Fourier deconvolution approach could be used if the distribution of the error-in-variables were known. In practice it is unknown, of course, but it can be estimated from repeated measurements, and in this way deconvolution can be achieved in an approximate sense. This argument might be interpreted as implying that large numbers of replicates are necessary for each cluster mean distribution, but that is not so; we avoid this requirement by incorporating statistical smoothing over values of nearby explanatory variables. Empirical rules are developed for the choice of smoothing parameter. Numerical simulations, and an application to real data, demonstrate small sample performance for this package of methodology. We also develop theory establishing statistical consistency.     

On the use of quasi-likelihood for estimation in hidden-Markov random fields

This paper illustrates the use of quasi-likelihood methods of inference for hidden Markov random fields. These are simple to use and can be employed under circumstances where only the model form and its covariance structure are specified. In particular they can be used to derive the same estimating equations as the E-M algorithm or change of measure methods, which make full distributional assumptions.