Affiliation networks with an increasing degree sequence

Affiliation network is one kind of two-mode social network with two different sets of nodes (namely, a set of actors and a set of social events) and edges representing the affiliation of the actors with the social events. Although a number of statistical models are proposed to analyze affiliation networks, the asymptotic behaviors of the estimator are still unknown or have not been properly explored. In this article, we study an affiliation model with the degree sequence as the exclusively natural sufficient statistic in the exponential family distributions. We establish the uniform consistency and asymptotic normality of the maximum likelihood estimator when the numbers of actors and events both go to infinity. Simulation studies and a real data example demonstrate our theoretical results.     

Asymptotic distribution in affiliation finite discrete weighted networks with an increasing degree sequence

Abstract

The asymptotic normality of a fixed number of the maximum likelihood estimators (MLEs) in the affiliation finite discrete weighted networks with an increasing degree sequence has been established recently. In this article, we further derive a central limit theorem for a linear combination of all the MLEs with an increasing dimension. Simulation studies are provided to illustrate the asymptotic results.     

ASYMPTOTIC PROPERTIES OF RESTRICTED MAXIMUM LIKELIHOOD (REML) ESTIMATES FOR HIERARCHICAL MIXED LINEAR MODELS

This paper explores the asymptotic distribution of the restricted maximum likelihood estimator of the variance components in a general mixed model. Restricting attention to hierarchical models, central limit theorems are obtained using elementary arguments with only mild conditions on the covariates in the fixed part of the model and without having to assume that the data are either normally or spherically symmetrically distributed. Further, the REML and maximum likelihood estimators are shown to be asymptotically equivalent in this general framework, and the asymptotic distribution of the weighted least squares estimator (based on the REML estimator) of the fixed effect parameters is derived.     

LIKELIHOOD MOMENT ESTIMATION FOR THE GENERALIZED PARETO DISTRIBUTION

Traditional methods for estimating parameters in the generalized Pareto distribution have theoretical and computational defects. The moment estimator and the probability‐weighted moment estimator have low asymptotic efficiencies. They may not exist or may give nonsensical estimates. The maximum likelihood estimator, which sometimes does not exist, is asymptotically efficient, but its computation is complex and has convergence problems. The likelihood moment estimator is proposed, which is computationally easy and has high asymptotic efficiency.     

A novel weighted likelihood estimation with empirical Bayes flavor

We propose a novel approach to estimation, where a set of estimators of a parameter is combined into a weighted average to produce the final estimator. The weights are chosen to be proportional to the likelihood evaluated at the estimators. We investigate the method for a set of estimators obtained by using the maximum likelihood principle applied to each individual observation. The method can be viewed as a Bayesian approach with a data-driven prior distribution. We provide several examples illustrating the new method and argue for its consistency, asymptotic normality, and efficiency. We also conduct simulation studies to assess the performance of the estimators. This straightforward methodology produces consistent estimators comparable with those obtained by the maximum likelihood method. The method also approximates the distribution of the estimator through the “posterior” distribution.     

Asymptotic distributions in affiliation networks with an increasing sequence

A central limit theorem for a linear combination of all the maximum likelihood estimators with an increasing dimension for affiliation networks has been established. Simulation studies are provided to illustrate the asymptotic results.     

Asymptotic properties of the ols and grls estimator for the replicated functional relationship model

For the simple linear functional relationship model with replication, the asymptotic properties of the ordinary (OLS) and grouping least squares (GRLS) estimator of the slope are investi- gated under the assumption of normally distributed errors with unknown covariance matrix. The relative performance of the OLS and GRLS estimator is compared in terms of the asymptotic mean square error, and a set of critical parameters are identified for determining the dominance of one estimator over the other. It is also shown that the GRLS estimator is asymptoticallyequivalent to the maximum likelihood (ML) estimator under the given assumptions.     

Asymptotically efficient estimation in response adaptive trials

We examine the issue of asymptotic efficiency of estimation for response adaptive designs of clinical trials, from which the collected data set contains a dependency structure. We establish the asymptotic lower bound of exponential rates for consistent estimators. Under certain regularity conditions, we show that the maximum likelihood estimator achieves the asymptotic lower bound for response adaptive trials with dichotomous responses. Furthermore, it is shown that the maximum likelihood estimator of the treatment effect is asymptotically efficient in the Bahadur sense for response adaptive clinical trials.     

Estimation in zero-inflated binomial regression with missing covariates

We investigate inverse-probability-weighted (IPW) maximum likelihood estimation in zero-inflated binomial regression with missing-at-random covariates. Large sample properties (consistency, asymptotic normality) of the IPW estimator are established. Finite sample properties are assessed via simulations. The methodology is illustrated on a real data set.     

Efficiency of projected score methods in rectangular array asymptotics

Summary. The paper considers a rectangular array asymptotic embedding for multistratum data sets, in which both the number of strata and the number of within-stratum replications increase, and at the same rate. It is shown that under this embedding the maximum likelihood estimator is consistent but not efficient owing to a non-zero mean in its asymptotic normal distribution. By using a projection operator on the score function, an adjusted maximum likelihood estimator can be obtained that is asymptotically unbiased and has a variance that attains the Cramér–Rao lower bound. The adjusted maximum likelihood estimator can be viewed as an approximation to the conditional maximum likelihood estimator.     

Asymptotic cumulants of the estimator of the canonical parameter in the exponential family

Asymptotic cumulants of the maximum likelihood estimator of the canonical parameter in the exponential family are obtained up to the fourth order with the added higher-order asymptotic variance. In the case of a scalar parameter, the corresponding results with and without studentization are given. These results are also obtained for the estimators by the weighted score, especially for those using the Jeffreys prior. The asymptotic cumulants are used for reducing bias and mean square error to improve a point estimator and for interval estimation to have higher-order accuracy. It is shown that the kurtosis to squared skewness ratio of the sufficient statistic plays a fundamental role.     

Optimal rank set sampling estimates for a population proportion

This paper examines two different classes of estimates for a population proportion based on an unbalanced rank set sample. Specifically, the two classes correspond to the maximum likelihood estimator (MLE) and a weighted average (WA) estimate. Both estimators are asymptotically normal, so standard inference procedures can still be implemented. Furthermore, these results can be used to develop optimal allocation schemes for both estimators. The performances of the optimal estimators are studied in terms of both finite sample and asymptotic relative efficiency. In general, the MLE is more efficient than the WA estimate. Lastly, the practicality of the optimal sampling plans is addressed and illustrated via an example.     

Inference based on adaptive grid selection of probability transforms

Probability transform-based inference, for example, characteristic function-based inference, is a good alternative to likelihood methods when the probability density function is unavailable or intractable. However, a set of grids needs to be determined to provide an effective estimator based on probability transforms. This paper is concerned with parametric inference based on adaptive selection of grids. By employing a closeness measure to evaluate the asymptotic variance of the transform-based estimator, we propose a statistical inference procedure, accompanied with adaptive grid selection. The selection algorithm aims for a small set of grids, and yet the resulting estimator can be highly efficient. Generally, the asymptotic variance is very close to that of the maximum likelihood estimator.     

Focused information criterion and model averaging based on weighted composite quantile regression

We study the focused information criterion and frequentist model averaging and their application to post‐model‐selection inference for weighted composite quantile regression (WCQR) in the context of the additive partial linear models. With the non‐parametric functions approximated by polynomial splines, we show that, under certain conditions, the asymptotic distribution of the frequentist model averaging WCQR‐estimator of a focused parameter is a non‐linear mixture of normal distributions. This asymptotic distribution is used to construct confidence intervals that achieve the nominal coverage probability. With properly chosen weights, the focused information criterion based WCQR estimators are not only robust to outliers and non‐normal residuals but also can achieve efficiency close to the maximum likelihood estimator, without assuming the true error distribution. Simulation studies and a real data analysis are used to illustrate the effectiveness of the proposed procedure.     

NETWORK EXPLORATION VIA THE ADAPTIVE LASSO AND SCAD PENALTIES

Graphical models are frequently used to explore networks, such as genetic networks, among a set of variables. This is usually carried out via exploring the sparsity of the precision matrix of the variables under consideration. Penalized likelihood methods are often used in such explorations. Yet, positive-definiteness constraints of precision matrices make the optimization problem challenging. We introduce non-concave penalties and the adaptive LASSO penalty to attenuate the bias problem in the network estimation. Through the local linear approximation to the non-concave penalty functions, the problem of precision matrix estimation is recast as a sequence of penalized likelihood problems with a weighted L(1) penalty and solved using the efficient algorithm of Friedman et al. (2008). Our estimation schemes are applied to two real datasets. Simulation experiments and asymptotic theory are used to justify our proposed methods.     

Can we recover information from concordant pairs in binary matched pairs?

When possible values of a response variable are limited, distributional assumptions about random effects may not be checkable. This may cause a distribution-robust estimator, such as the conditional maximum likelihood estimator to be recommended; however, it does not utilize all the information in the data. We show how, with binary matched pairs, the hierarchical likelihood can be used to recover information from concordant pairs, giving an improvement over the conditional maximum likelihood estimator without losing distribution-robustness.     

Bias Corrected Maximum Likelihood Estimator Under the Generalized Linear Model for a Binary Variable

Under the generalized linear models for a binary variable, an approximate bias of the maximum likelihood estimator of the coefficient, that is a special case of linear parameter in Cordeiro and McCullagh (1991), is derived without a calculation of the third-order derivative of the log likelihood function. Using the obtained approximate bias of the maximum likelihood estimator, a bias-corrected maximum likelihood estimator is defined. Through a simulation study, we show that the bias-corrected maximum likelihood estimator and its variance estimator have a better performance than the maximum likelihood estimator and its variance estimator.     

Likelihood Analysis of the I(2) Model

The I (2) model is defined as a submodel of the general vector autoregressive model, by two reduced rank conditions. The model describes stochastic processes with stationary second difference. A parametrization is suggested which makes likelihood inference feasible. Consistency of the maximum likelihood estimator is proved, and the asymptotic distribution of the maximum likelihood estimator is given. It is shown that the asymptotic distribution is either Gaussian, mixed Gaussian or, in some cases, even more complicated.     

Improved inference for areal unit count data using graph-based optimisation

Statistics and Computing - Profile likelihood confidence intervals are a robust alternative to Wald’s method if the asymptotic properties of the maximum likelihood estimator are not met....     

Estimation of the scale parameter of the half-logistic distribution under progressively type II censored sample

Based on a progressively type II censored sample, the maximum likelihood and Bayes estimators of the scale parameter of the half-logistic distribution are derived. However, since the maximum likelihood estimator (MLE) and Bayes estimator do not exist in an explicit form for the scale parameter, we consider a simple method of deriving an explicit estimator by approximating the likelihood function and derive the asymptotic variances of MLE and approximate MLE. Also, an approximation based on the Laplace approximation (Tierney and Kadane in J Am Stat Assoc 81:82–86, 1986) and importance sampling methods are used for obtaining the Bayes estimator. In order to compare the performance of the MLE, approximate MLE and Bayes estimates of the scale parameter, we use Monte Carlo simulation.