ordering and selecting extreme populations by means of entropies and divergences this paper studies the simultaneous selection of extreme populations from a set of independent populations two types of subset selection rules for k populations are proposed and studied the first type selects one subset of populations that should contain the population with the smallest and another subset of populations that should contain the population with the largest f entropy the second type selects analogously but in terms of the extreme f divergences with respect a known control population properties of the proposed procedures are stated and studied examples are presented in order to illustrate the results

divergence statistics for testing uniform association in cross classifications in this paper we consider the problem of testing uniform association in cross classifications having ordered categories taking as test statistic one in the family proposed by conde and salicru j conde m salicru uniform association in contingency tables associated to csiszar divergence statistics and probability letters 37 1998 149 154 we consider two approximations to the null distribution of the test statistics in this family an estimation of the asymptotic null distribution and a bootstrap estimator we prove that both approximations are asymptotically equivalent to study their finite sample performance we carried out two simulation experiments whose results are presented from the simulations it can be concluded that the bootstrap estimator behaves much better than the estimated asymptotic null distribution

goodness of fit tests based on rao s divergence under sparseness assumptions in many practical situations the classical fixed cells assumptions to test goodness of fit are inappropriate and we consider an alternative set of assumptions which we call sparseness assumptions it is proved that under general conditions the proposed family of statistics based on rao s divergence is asymptotically normal when the sample size n and the number of cells m n tend to infinity so that n m n n 0 this result is extended to contiguous alternatives and subsequently it is possible to find the asymptotically most efficient member of the family

robust fitting of the binomial model we consider the problem of robust inference for the binomial m pi model the discreteness of the data and the fact that the parameter and sample spaces are bounded mean that standard robustness theory gives surprising results for example the maximum likelihood estimator mle is quite robust it cannot be improved on for m 1 but can be for m 1 we discuss four other classes of estimators m estimators minimum disparity estimators optimal mgp estimators and a new class of estimators which we call e estimators we show that e estimators have a non standard asymptotic theory which challenges the accepted relationship between robustness concepts and thereby provided new perspectives on these concepts

random parking sequential adsorption and the jamming limit identical cars are dropped sequentially from above into a large parking lot each car is positioned uniformly at random subject to non overlap with its predecessors until jamming occurs there have been many studies of the limiting mean coverage as the parking lot becomes large but no complete proof that such a limit exists until now

powerful goodness of fit tests based on the likelihood ratio summary a new approach of parameterization is proposed to construct a general goodnessof fit test it can not only generate traditional tests including the kolmogorov smirnov cramer von mises and anderson darling tests but also produce new types of omnibus tests which are generally much more powerful than the old ones

confidence limits to the risk ratio for the problem of obtaining confidence limits to the risk ratio or the ratio of two binomial probabilities katz et al 1978 biometrics 34 469 474 proposed a method based on the logarithm of the observed ratio and using fieller s result we propose a method based on a power of the observed ratio the power being chosen to minimize the skewness of the pivotal random variable the method is simple to use and more stable than that of katz et al a continuity correction is suggested if a conservative interval is desired

repairing reed solomon codes we study the performance of reed solomon rs codes for the exact repair problem in distributed storage our main result is that in some parameter regimes reed solomon codes are optimal regenerating codes among maximum distance separable mds codes with linear repair schemes moreover we give a characterization of mds codes with linear repair schemes which holds in any parameter regime and which can be used to give non trivial repair schemes for rs codes in other settings more precisely we show that for k dimensional rs codes whose evaluation points are a finite field of size n there are exact repair schemes with bandwidth n 1 log n 1 n k bits and that this is optimal for any mds code with a linear repair scheme in contrast the naive commonly implemented repair algorithm for this rs code has bandwidth k log n bits when the entire field is used as evaluation points the number of nodes n is much larger than the number of bits per node which is o log n and so this result holds only when the degree of sub packetization is small however our method applies in any parameter regime and to illustrate this for high levels of sub packetization we give an improved repair scheme for a specific 14 10 rs code used in the facebook hadoop analytics cluster

combining estimators to improve structural model estimation and inference under quadratic loss asymptotically semi parametric estimators of the parameters in linear structural models have the same sampling properties in finite samples the sampling properties of these estimators vary and large biases may result for sample sizes often found in practice with a goal of improving asymptotic risk performance and finite sample efficiency properties we investigate the idea of combining correlated structural equation estimators with different finite and asymptotic sampling characteristics based on a quadratic loss measure we present evidence that the finite sample performance of the resulting combination estimator can be notably superior to that of a leading traditional moment based estimator

large deviations in one dimensional random sequential adsorption in random sequential adsorption rsa objects are deposited randomly irreversibly and sequentially attempts leading to an overlap with previously deposited objects are discarded the process continues until the system reaches a jammed state when no further additions are possible we analyze a class of lattice rsa models in which landing on an empty site in a segment is allowed when at least b neighboring sites on the left and the right are unoccupied for the minimal model b 1 we compute the full counting statistics of the occupation number we reduce the determination of the full counting statistics to a riccati equation that appears analytically solvable only when b 1 we develop a perturbation procedure which in principle allows one to determine cumulants consecutively and we compute the variance of the occupation number for all b

jackknifing and bootstrapping goodness of fit statistics in sparse multinomials abstract many goodness of fit problems can be put in the following form n n 1 nk is a multinomial n vector and it is desired to test the composite null hypothesis h 0 p against all possible alternatives the usual tests used are pearson s 1900 statistic or the likelihood ratio statistic neyman and pearson 1928 cressie and read 1984 pointed out that both of these statistics are in the power family of statistics with 1 and 0 respectively they suggested an alternative statistic with although all of these statistics are asymptotically 2 in the usual situation of k fixed and n this is not the case if the multinomial is sparse specifically morris 1975 showed that under certain regularity conditions with k and n both x 2 and g 2 are asymptotically normal with different mean and variance under a simple null hypothesis cressie and read 1984 extended these results to the general 2ni family although these results have not been proven for composite nul

on goodness of fit tests for multiple recursive random number generators abstract this paper considers the problem of reducing the computational time in testing uniformity for a full period multiple recursive generator mrg if a sequence of random numbers generated by a mrg is divided into even number of segments say 2 s then the multinomial goodness of fit tests and the empirical distribution function goodness of fit tests calculated from the i th segment are the same as those of the s i th segment the equivalence properties of the goodness of fit test statistics for a mrg and its associated reverse and additive inverse mrgs are also discussed

error correction based on partial information we consider the decoding of linear and array codes from errors when we are only allowed to download a part of the codeword more specifically suppose that we have encoded k data symbols using an n k code with code length n and dimension k during storage some of the codeword coordinates might be corrupted by errors we aim to recover the original data by reading the corrupted codeword with a limit on the transmission bandwidth namely we can only download an alpha proportion of the corrupted codeword for a given alpha our objective is to design a code and a decoding scheme such that we can recover the original data from the largest possible number of errors a naive scheme is to read alpha n coordinates of the codeword this method used in conjunction with mds codes guarantees recovery from any lfloor alpha n k 2 rfloor errors in this paper we show that we can instead download an alpha proportion from each of the codeword s coordinates for a well designed mds code this method can guarantee recovery from lfloor n k alpha 2 rfloor errors which is 1 alpha times more than the naive method and is also the maximum number of errors that an n k code can correct by downloading only an alpha proportion of the codeword we present two families of such optimal constructions and decoding schemes of which one is based on interleaved reed solomon codes and the other on folded reed solomon codes we further show that both code constructions attain asymptotically optimal list decoding radius when downloading only a part of the corrupted codeword we also construct an ensemble of random codes that with high probability approaches the upper bound on the number of correctable errors when the decoder downloads an alpha proportion of the corrupted codeword

tests of independence for bivariate data with random censoring a contingency table approach procedures are proposed for testing the hypothesis of independence between two discrete or discretized random variables one or both of which may be randomly censored the censoring mechanisms can be either independent bivariate censoring or identical univariate censoring the proposed tests reduce to goodness of fit tests for log linear models applied to either complete or incomplete contingency tables three examples are analyzed for illustrative purposes

nonparametric kernel regression subject to monotonicity constraints we suggest a method for monotonizing general kernel type estimators for example local linear estimators and nadaraya watson estimators attributes of our approach include the fact that it produces smooth estimates indeed with the same smoothness as the unconstrained estimate the method is applicable to a particularly wide range of estimator types it can be trivially modified to render an estimator strictly monotone and it can be employed after the smoothing step has been implemented therefore an experimenter may use his or her favorite kernel estimator and their favorite bandwidth selector to construct the basic nonparametric smoother and then use our technique to render it monotone in a smooth way implementation involves only an off the shelf programming routine the method is based on maximizing fidelity to the conventional empirical approach subject to monotonicity we adjust the unconstrained estimator by tilting the empirical distribution so as to make the least possible change in the sense of a distance measure subject to imposing the constraint of monotonicity

bootstrap confidence regions in multinomial sampling power divergences can be used to give a measure of distance between two probability vectors in multinomial sampling arguments can be substituted by empirical and theoretical proportions to obtain confidence regions of parameters in this paper the bootstrap versions of these confidence regions are constructed monte carlo simulation experiments are carried out to calculate average coverage probabilities and to compare the behavior of the introduced procedures

explicit constructions of optimal access mds codes with nearly optimal sub packetization an n k l maximum distance separable mds array code of length n dimension k n r and sub packetization l is formed of l times n matrices over a finite field f with every column of the matrix stored on a separate node in the distributed storage system and viewed as a coordinate of the codeword repair of a failed node recovery of one erased column can be performed by accessing a set of d le n 1 surviving helper nodes the code is said to have the optimal access property if the amount of data accessed at each of the helper nodes meets a lower bound on this quantity for optimal access mds codes with d n 1 the sub packetization l satisfies the bound l ge r k 1 r in our previous work ieee trans inf theory vol 63 no 4 2017 for any n and r we presented an explicit construction of optimal access mds codes with sub packetization l r n 1 in this paper we take up the question of reducing the sub packetization value l to make it to approach the lower bound we construct an explicit family of optimal access codes with l r lceil n r rceil which differs from the optimal value by at most a factor of r 2 these codes can be constructed over any finite field f as long as f ge r lceil n r rceil and afford low complexity encoding and decoding procedures we also define a version of the repair problem that bridges the context of regenerating codes and codes with locality constraints lrc codes which we call group repair with optimal access in this variation we assume that the set of n sm nodes is partitioned into m repair groups of size s and require that the amount of accessed data for repair is the smallest possible whenever the d s k 1 helper nodes include all the other s 1 nodes from the same group as the failed node for this problem we construct a family of codes with the group optimal access property these codes can be constructed over any field f of size f ge n and also afford low complexity encoding and decoding procedures

efficient derivative pricing by the extended method of moments in this paper we introduce the extended method of moments xmm estimator this estimator accommodates a more general set of moment restrictions than the standard generalized method of moments gmm estimator more specifically the xmm differs from the gmm in that it can handle not only uniform conditional moment restrictions i e valid for any value of the conditioning variable but also local conditional moment restrictions valid for a given fixed value of the conditioning variable the local conditional moment restrictions are of special relevance in derivative pricing to reconstruct the pricing operator on a given day by using the information in a few cross sections of observed traded derivative prices and a time series of underlying asset returns the estimated derivative prices are consistent for a large time series dimension but a fixed number of cross sectionally observed derivative prices the asymptotic properties of the xmm estimator are nonstandard since the combination of uniform and local conditional moment restrictions induces different rates of convergence parametric and nonparametric for the parameters

power approximations to multinomial tests of fit abstract multinomial tests for the fit of iid observations x 1 xn to a specified distribution f are based on the counts ni of observations falling in k cells e 1 ek that partition the range of the x j the earliest such test is based on the pearson 1900 chi squared statistic x 2 k i 1 ni npi 2 npi where pi pf xj in ei are the cell probabilities under the null hypothesis a common competing test is the likelihood ratio test based on lr 2 k i 1 ni log ni npi cressie and read 1984 introduced a class of multinomial goodness of fit statistics r based on measures of the divergence between discrete distributions this class includes both x 2 when 1 and lr when 0 all of the r have the same chi squared limiting null distribution the power of the commonly used members of the class is usually approximated from a noncentral chi squared distribution that is also the same for all we propose new approximations to the power that vary with the statistic chosen bot

the existence of binary linear concatenated codes with reed solomon outer codes which asymptotically meet the gilbert varshamov bound binary linear concatenated codes with reed solomon codes as the outer code and varying nonsystematic inner codes are investigated it is shown that codes exist in this class which asymptotically meet the gilbert varshamov bound

approximating the moments and distribution of the likelihood ratio statistic for multinomial goodness of fit abstract approximations were derived for the mean and variance of g 2 the likelihood ratio statistic for testing goodness of fit in a k cell multinomial distribution these approximate moments accurate to o n 3 may be used in fitting the distribution of g 2 extensive numerical studies of the exact and approximate distributions were performed in the special case of equiprobability the asymptotic chi squared distribution was found to fit poorly for k 4 satisfactory results were obtained using a multiplicative correction to the chi squared fit more sophisticated procedures using the beta distribution produced increased accuracy but at the cost of excessive computational labor

information and entropy econometrics editor s view amos golan department of economics american university roper 200 4400 massachusetts ave nw washington dc 20016 usa

explicit codes achieving list decoding capacity error correction with optimal redundancy in this paper we present error correcting codes that achieve the information theoretically best possible tradeoff between the rate and error correction radius specifically for every 0 r 1 and epsiv 0 we present an explicit construction of error correcting codes of rate that can be list decoded in polynomial time up to a fraction 1 r epsiv of worst case errors at least theoretically this meets one of the central challenges in algorithmic coding theory our codes are simple to describe they are folded reed solomon codes which are in fact exactly reed solomon rs codes but viewed as a code over a larger alphabet by careful bundling of codeword symbols given the ubiquity of rs codes this is an appealing feature of our result and in fact our methods directly yield better decoding algorithms for rs codes when errors occur in phased bursts the alphabet size of these folded rs codes is polynomial in the block length we are able to reduce this to a constant depending on epsiv using existing ideas concerning ldquolist recoveryrdquo and expander based codes concatenating the folded rs codes with suitable inner codes we get binary codes that can be efficiently decoded up to twice the radius achieved by the standard gmd decoding

linear logistic latent class analysis for polytomous data abstract for latent class analysis a widely known statistical method for the unmixing of an observed frequency table into several unobservable ones a flexible model is presented in order to restrain the unknown class sizes mixing weights and the unknown latent response probabilities two systems of basic equations are stated such that they simultaneously allow parameter fixations the equality of certain parameters as well as linear logistic constraints of each of the original parameters the maximum likelihood equations for the parameters of this linear logistic latent class analysis are given and their estimation by means of the em algorithm is described further the criteria for their local identifiability and statistical tests pearson and likelihood ratio 2 for goodness of fit are outlined the practical applicability of linear logistic latent class analysis is demonstrated by three examples mixed logistic regression a mixed bradley terry model for paired comparisons with ties and a lo

distributed estimation and detection for sensor networks using hidden markov random field models we develop a hidden markov random field hmrf framework for distributed signal processing in sensor network environments under this framework spatially distributed observations collected at the sensors form a noisy realization of an underlying random field that has a simple structure with markovian dependence we derive iterated conditional modes icm algorithms for distributed estimation of the hidden random field from the noisy measurements we consider both parametric and nonparametric measurement error models the proposed distributed estimators are computationally simple applicable to a wide range of sensing environments and localized implying that the nodes communicate only with their neighbors to obtain the desired results we also develop a calibration method for estimating markov random field model parameters from training data and discuss initialization of the icm algorithms the hmrf framework and icm algorithms are applied to event region detection numerical simulations demonstrate the performance of the proposed approach

using permutations to detect dependence between time series abstract in this paper we propose an independence test between two time series which is based on permutations the proposed test can be carried out by means of different common statistics such as pearson s chi square or the likelihood ratio we also point out why an exact test is necessary simulated and real data return exchange rates between several currencies reveal the capacity of this test to detect linear and nonlinear dependences

goodness of fit tests in models for life history data based on cumulative hazard rates to check the validity of an assumed parametric model for survival data one may compare t the nonparametric nelson aalen plot of the cumulative hazard rate with a t the estimated parametric cumulative hazard rate being for example the maximum likelihood estimator convergence in distribution of n t a t and more general processes is studied employing the general framework of counting processes which allows for quite general models for life history data and for quite general censoring schemes the results are applied to the construction of 2 type statistics for goodness of fit cramer von mises and kolmogorov smirnov type tests are presented in the case where the unknown parameter is one dimensional

efficient information theoretic inference for conditional moment restrictions abstract the generalised method of moments estimator may be substantially biased in finite samples especially so when there are large numbers of unconditional moment conditions this paper develops a class of first order equivalent semi parametric efficient estimators and tests for conditional moment restrictions models based on a local or kernel weighted version of the cressie read power divergence family of discrepancies this approach is similar in spirit to the empirical likelihood methods of kitamura et al 2004 empirical likelihood based inference in conditional moment restrictions models econometrica 72 1667 1714 and tripathi and kitamura 2003 testing conditional moment restrictions annals of statistics 31 2059 2095 these efficient local methods avoid the necessity of explicit estimation of the conditional jacobian and variance matrices of the conditional moment restrictions and provide empirical conditional probabilities for the observations

maxallent maximizers of all entropies and uncertainty of uncertainty a b s t r a c t the entropy maximum approach maxent was developed as a minimization of the subjective uncertainty measured by the boltzmann gibbs shannon entropy many new entropies have been invented in the second half of the 20th century now there exists a rich choice of entropies for fitting needs this diversity of entropies gave rise to a maxent anarchism the maxent approach is now the conditional maximization of an appropriate entropy for the evaluation of the probability distribution when our information is partial and incomplete the rich choice of non classical entropies causes a new problem which entropy is better for a given class of applications we understand entropy as a measure of uncertainty which increases in markov processes in this work we describe the most general ordering of the distribution space with respect to which all continuous time markov processes are monotonic the markov order for inference this approach results in a set of conditionally most random distributions each distribution from this set is a maximizer of its own entropy this uncertainty of uncertainty is unavoidable in the analysis of nonequilibrium systems surprisingly the constructive description of this set of maximizers is possible two decomposition theorems for markov processes provide a tool for this description

explicit constructions of high rate mds array codes with optimal repair bandwidth maximum distance separable mds codes are optimal error correcting codes in the sense that they provide the maximum failure tolerance for a given number of parity nodes suppose that an mds code with k information nodes and r n k parity nodes is used to encode data in a distributed storage system it is known that if h out of the n nodes are inaccessible and d surviving helper nodes are used to recover the lost data then we need to download at least h d h k fraction of the data stored in each of the helper nodes dimakis et al 2010 and cadambe et al 2013 if this lower bound is achieved for the repair of any h erased nodes from any d helper nodes we say that the mds code has the h d optimal repair property we study high rate mds array codes with the optimal repair property also known as minimum storage regenerating codes or msr codes explicit constructions of such codes in the literature are only available for the cases where there are at most three parity nodes and these existing constructions can only optimally repair a single node failure by accessing all the surviving nodes in this paper given any r and n we present two explicit constructions of mds array codes with the h d optimal repair property for all h le r and k le d le n h simultaneously codes in the first family can be constructed over any base field f as long as f ge sn where s text lcm 1 2 dots r the encoding decoding repair of failed nodes and update procedures of these codes all have low complexity codes in the second family have the optimal access property and can be constructed over any base field f as long as f ge n 1 moreover both code families have the optimal error resilience capability when repairing failed nodes we also construct several other related families of mds codes with the optimal repair property

a family of confidence intervals for the ratio of two binomial proportions the power divergence family of statistics introduced by cressie and read 1984 journal of the royal statistical society series b 46 440 464 is used to obtain approximate confidence intervals for the ratio of two proportions intervals based on inverting the pearson likelihood ratio and freeman tukey statistics are included in this family small sample comparisons of the intervals are presented

neglected heterogeneity in moment condition models abstract the central concern of this paper is parameter heterogeneity in models specified by a number of unconditional or conditional moment conditions and thereby the provision of a framework for the development of apposite optimal m tests against its potential presence we initially consider the unconditional moment restrictions framework optimal m tests against moment condition parameter heterogeneity are derived with the relevant jacobian matrix obtained in terms of the second order own derivatives of the moment indicator in a leading case gmm and gel tests of specification based on generalized information matrix equalities appropriate for moment based models are described and their relation to optimal m tests against moment condition parameter heterogeneity examined a fundamental and important difference is noted between gmm and gel constructions the paper is concluded by a generalization of these tests to the conditional moment context and the provision of a limited set of simulation experiments to illustrate the efficacy of the proposed tests

benford s law and the fsd distribution of economic behavioral micro data abstract in this paper we focus on the first significant digit fsd distribution of european micro income data and use information theoretic entropy based methods to investigate the degree to which benford s fsd law is consistent with the nature of these economic behavioral systems we demonstrate that benford s law is not an empirical phenomenon that occurs only in important distributions in physical statistics but that it also arises in self organizing dynamic economic behavioral systems the empirical likelihood member of the minimum divergence entropy family is used to recover country based income fsd probability density functions and to demonstrate the implications of using a benford prior reference distribution in economic behavioral system information recovery

testing a point null hypothesis the irreconcilability of p values and evidence abstract the problem of testing a point null hypothesis or a small interval null hypothesis is considered of interest is the relationship between the p value or observed significance level and conditional and bayesian measures of evidence against the null hypothesis although one might presume that a small p value indicates the presence of strong evidence against the null such is not necessarily the case expanding on earlier work especially edwards lindman and savage 1963 and dickey 1977 it is shown that actual evidence against a null as measured say by posterior probability or comparative likelihood can differ by an order of magnitude from the p value for instance data that yield a p value of 05 when testing a normal mean result in a posterior probability of the null of at least 30 for any objective prior distribution objective here means that equal prior weight is given the two hypotheses and that the prior is symmetric and nonincreasing away from the null other definiti

sample selection and information theoretic alternatives to gmm information theoretic alternatives to general method of moments gmm use over identifying moments to estimate the data generating distribution jointly with the parameters of interest this paper demonstrates how these estimates can be interpreted when the sample is not a random draw from the population of interest i make explicit the selection probability implied by the empirical likelihood and exponential tilting estimators two commonly used estimators in this class in addition i propose an alternative estimator that corresponds to a logisitic selection model the small sample properties of the estimators are demonstrated with a monte carlo experiment

robust and efficient estimation by minimising a density power divergence a minimum divergence estimation method is developed for robust parameter estimation the proposed approach uses new density based divergences which unlike existing methods of this type such as minimum hellinger distance estimation avoid the use of nonparametric density estimation and associated complications such as bandwidth selection the proposed class of density power divergences is indexed by a single parameter which controls the trade off between robustness and efficiency the methodology affords a robust extension of maximum likelihood estimation for which 0 choices of near zero afford considerable robustness while retaining efficiency close to that of maximum likelihood

the number of classes in chi squared goodness of fit tests abstract the power of pearson chi squared and likelihood ratio goodness of fit tests based on different partitions is studied by considering families of densities between the null density and fixed alternative densities for sample sizes n local asymptotic theory with respect to the number of classes k is developed for such families simple sufficient and almost necessary conditions are derived under which it is asymptotically optimal to let k tend to infinity with n a numerical study shows that the results of the asymptotic local theory for contamination families agree well with the actual power performance of the tests for heavy tailed alternatives the tests have the best power when k is relatively large unbalanced partitions with some small classes in the tails perform surprisingly well in particular when the alternatives have fairly heavy tails

robust estimation for grouped data here we investigate the robustness properties of the class of minimum power divergence estimators for grouped data this class contains the classical maximum likelihood estimators for grouped data we find that the bias of these estimators due to deviations from the assumed underlying model can be large therefore we propose a more general class of estimators that allows us to construct robust procedures by analogy with hampel s theorem we define optimal bounded influence function estimators and by a simulation study we show that under small model contaminations these estimators are more stable than the classical estimators for grouped data finally we apply our results to a particular real example

the moment corrected phi divergence test statistics for symmetry in this paper we consider the family of f divergence test statistics t n f s for the problem of symmetry in ixi contingency tables whose asymptotic distribution is chi square with i i 1 2 degrees of freedom and we propose a moment corrected f divergence test statistic in order to improve the accuracy of the chi square approximation of the distribution of t n f s under the hypothesis of symmetry

data tilting for time series summary we develop a general methodology for tilting time series data attention is focused on a large class of regression problems where errors are expressed through autoregressive processes the class has a range of important applications and in the context of our work may be used to illustrate the application of tilting methods to interval estimation in regression robust statistical inference and estimation subject to constraints the method can be viewed as empirical likelihood with nuisance parameters

tests of additional conditional moment restrictions abstract the primary focus of this article is the provision of tests for the validity of a set of conditional moment constraints additional to those defining the maintained hypothesis that are relevant for independent cross sectional data contexts the point of departure and principal contribution of the paper is the explicit and full incorporation of the conditional moment information defining the maintained hypothesis in the design of the test statistics thus the approach mirrors that of the classical parametric likelihood setting by defining restricted tests in contradistinction to unrestricted tests that partially or completely fail to incorporate the maintained information in their formulation the framework is quite general allowing the parameters defining the additional and maintained conditional moment restrictions to differ and permitting the conditioning variates to differ likewise gmm and generalised empirical likelihood test statistics are suggested the asymptotic properties of the statistics are described under both null hypothesis and a suitable sequence of local alternatives an extensive set of simulation experiments explores the practical efficacy of the various test statistics in terms of empirical size and size adjusted power confirming the superiority of restricted over unrestricted tests a number of restricted tests possess both sufficiently satisfactory empirical size and power characteristics to allow their recommendation for econometric practice

normal goodness of fit tests for multinomial models with large degrees of freedom abstract goodness of fit tests for independent multinomials with parameters to be estimated are usually based on pearson s x 2 or the likelihood ratio g 2 both are included in the family of power divergence statistics sd for increasing sample sizes each sd has an asymptotic x 2 distribution provided that the number of cells remains fixed we are dealing with an increasing cells approach where the number j of independent multinomials increases while the number of classes for each multinomial and the number of parameters remain fixed extending results on x 2 and g 2 the asymptotic normality of any sd is obtained for increasing cells the corresponding normal goodness of fit tests discussed here apply for models with large degrees of freedom with no restrictions imposed on the sizes n j of each multinomial allowing large as well as small expectations sparse data within each cell the asymptotic expectation and variance of sd are easy to compute for pearson s x 2 and simplify considerably for

generalized random sequential adsorption on erdős renyi random graphs we investigate random sequential adsorption rsa on a random graph via the following greedy algorithm order the n vertices at random and sequentially declare each vertex either active or frozen depending on some local rule in terms of the state of the neighboring vertices the classical rsa rule declares a vertex active if none of its neighbors is in which case the set of active nodes forms an independent set of the graph we generalize this nearest neighbor blocking rule in three ways and apply it to the erd s renyi random graph we consider these generalizations in the large graph limit n rightarrow infty and characterize the jamming constant the limiting proportion of active vertices in the maximal greedy set

rendering parametric procedures more robust by empirically tilting the model summary we suggest methods for tilting a likelihood so as to enhance the robustness of maximum likelihood procedures from the viewpoint of computation tilting amounts to choosing unequal weights for the score function in such a way as to maximise likelihood subject to moving a given distance from equally weighted scores empirical methods based on standard parametric q q plots are used to determine the appropriate amount of tilting distance may be measured in a variety of ways and we devote particular attention to power divergence approaches in this context one of the two kullback leibler distance measures is shown to be advantageous

power divergence family of statistics for person parameters in irt models we generalize the power divergence pd family of statistics to the two parameter logistic irt model for the purpose of constructing hypothesis tests and confidence intervals of the person parameter the well known score test statistic is a special case of the proposed pd family we also prove the proposed pd statistics are asymptotically equivalent and converge in distribution to chi 1 2 in addition a moment matching method is introduced to compare statistics and choose the optimal one within the pd family simulation results suggest that the coverage rate of the associated confidence interval is well controlled even under small sample sizes for some pd statistics compared to some other approaches the associated confidence intervals exhibit smaller lengths while maintaining adequate coverage rates the utilities of the proposed method are demonstrated by analyzing a real data set

approximate confidence intervals for the parameters of a stationary binary markov chain the power divergence family of test statistics introduced by cressie and read 1984 is used to obtain approximate confidence intervals for the parameters of a stationary first order binary markov chain intervals based on inverting the likelihood ratio pearson and freeman tukey statistics are included in this family small sample comparisons are used to select the best intervals for the different parameters the results show that the best power divergence intervals for the probability of success and in particular the likelihood ratio interval have error rates closer to nominal levels than the sample proportion based intervals suggested by crow 1979 the properties of power divergence joint confidence regions for the transition probabilities are also explored

efficient robust regression via two stage generalized empirical likelihood large and finite sample efficiency and resistance to outliers are the key goals of robust statistics although often not simultaneously attainable we develop and study a linear regression estimator that comes close efficiency is obtained from the estimator s close connection to generalized empirical likelihood and its favorable robustness properties are obtained by constraining the associated sum of weighted squared residuals we prove maximum attainable finite sample replacement breakdown point and full asymptotic efficiency for normal errors simulation evidence shows that compared to existing robust regression estimators the new estimator has relatively high efficiency for small sample sizes and comparable outlier resistance the estimator is further illustrated and compared to existing methods via application to a real dataset with purported outliers

the repair problem for reed solomon codes optimal repair of single and multiple erasures with almost optimal node size the repair problem in distributed storage addresses recovery of the data encoded using an erasure code for instance a reed solomon rs code we consider the problem of repairing a single node or multiple nodes in rs coded storage systems using the smallest possible amount of inter nodal communication according to the cut set bound communication cost of repairing h geqslant 1 failed nodes for an n k n r maximum distance separable mds code using d helper nodes is at least dhl d h k where l is the size of the node guruswami and wootters 2016 initiated the study of efficient repair of rs codes showing that they can be repaired using a smaller bandwidth than under the trivial approach at the same time their work as well as follow up papers stopped short of constructing rs codes or any scalar mds codes that meet the cut set bound with equality in this paper we construct the families of rs codes that achieve the cut set bound for repair of one or several nodes in the single node case we present the rs codes of length n over the field mathbb f q l l exp 1 o 1 n log n that meet the cut set bound we also prove an almost matching lower bound on l showing that super exponential scaling is both necessary and sufficient for scalar mds codes to achieve the cut set bound using linear repair schemes for the case of multiple nodes we construct a family of rs codes that achieve the cut set bound universally for the repair of any h 1 2 dots r failed nodes from any subset of d helper nodes k leqslant d leqslant n h for a fixed number of parities r the node size of the constructed codes is close to the smallest possible node size for codes with such properties

a tilting approach to ranking influence summary we suggest a new approach which is applicable for general statistics computed from random samples of univariate or vector valued or functional data to assessing the influence that individual data have on the value of a statistic and to ranking the data in terms of that influence our method is based on first perturbing the value of the statistic by tilting or reweighting each data value where the total amount of tilt is constrained to be the least possible subject to achieving a given small perturbation of the statistic and then taking the ranking of the influence of data values to be that which corresponds to ranking the changes in data weights it is shown both theoretically and numerically that this ranking does not depend on the size of the perturbation provided that the perturbation is sufficiently small that simple result leads directly to an elegant geometric interpretation of the ranks they are the ranks of the lengths of projections of the weights onto a line determined by the first empirical principal component function in a generalized measure of covariance to illustrate the generality of the method we introduce and explore it in the case of functional data where for example it leads to generalized boxplots the method has the advantage of providing an interpretable ranking that depends on the statistic under consideration for example the ranking of data in terms of their influence on the value of a statistic is different for a measure of location and for a measure of scale this is as it should be a ranking of data in terms of their influence should depend on the manner in which the data are used additionally the ranking recognizes rather than ignores sign and in particular can identify left and right hand tails of the distribution of a random function or vector

a new class of asymptotically efficient estimators for moment condition models in this paper we propose a new class of asymptotically efficient estimators for moment condition models these estimators share the same higher order bias properties as the generalized empirical likelihood estimators and once bias corrected have the same higher order efficiency properties as the bias corrected generalized empirical likelihood estimators unlike the generalized empirical likelihood estimators our new estimators are much easier to compute a simulation study finds that our estimators have better finite sample performance than the two step gmm and compare well to several potential alternatives in terms of both computational stability and overall performance

small sample comparisons for the power divergence goodness of fit statistics abstract the small sample properties of the power divergence family of goodness of fit statistics cressie and read in press are examined the asymptotic 2 and three alternative approximations are used to obtain appropriate test levels for comparison with the exact level it is shown that if the 2 approximation is to be used then there are many preferable statistics to the log likelihood ratio g 2 including pearson s 2 furthermore exact power comparisons under specific alternatives to the symmetric null hypothesis show that the power of the well known tests based on g 2 and 2 can be improved by choosing other statistics from the family an explanation is proposed in terms of the effect of relative deviations between observed and expected counts

minimum phi divergence estimation in constrained latent class models for binary data the main purpose of this paper is to introduce and study the behavior of minimum divergence estimators as an alternative to the maximum likelihood estimator in latent class models for binary items as it will become clear below minimum divergence estimators are a natural extension of the maximum likelihood estimator the asymptotic properties of minimum divergence estimators for latent class models for binary data are developed finally to compare the efficiency and robustness of these new estimators with that obtained through maximum likelihood when the sample size is not big enough to apply the asymptotic results we have carried out a simulation study

estimating model discrepancy a quantity 2 is defined as the discrepancy between an actual and an assumed statistical model an estimator is developed for the case in which data are grouped the estimator is based on pearson

scaling limits and generic bounds for exploration processes we consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial poisson processes at each step a vertex of the graph becomes active and its neighboring nodes become blocked given an initial number of vertices n growing to infinity we study statistical properties of the proportion of explored active or blocked nodes in time using scaling limits we obtain exact limits for homogeneous graphs and prove an explicit central limit theorem for the final proportion of active nodes known as the jamming constant through a diffusion approximation for the exploration process which can be described as a unidimensional process we then focus on bounding the trajectories of such exploration processes on random geometric graphs i e random sequential adsorption as opposed to exploration processes on homogeneous random graphs these do not allow for such a dimensional reduction instead we derive a fundamental relationship between the number of explored nodes and the discovered volume in the spatial process and we obtain generic bounds for the fluid limit and jamming constant bounds that are independent of the dimension of space and the detailed shape of the volume associated to the discovered node lastly using coupling techinques we give trajectorial interpretations of the generic bounds

modelling trends in ordered correspondence analysis using orthogonal polynomials the core of the paper consists of the treatment of two special decompositions for correspondence analysis of two way ordered contingency tables the bivariate moment decomposition and the hybrid decomposition both using orthogonal polynomials rather than the commonly used singular vectors to this end we will detail and explain the basic characteristics of a particular set of orthogonal polynomials called emerson polynomials it is shown that such polynomials when used as bases for the row and or column spaces can enhance the interpretations via linear quadratic and higher order moments of the ordered categories to aid such interpretations we propose a new type of graphical display the polynomial biplot