36,257 research outputs found
WHEN IS EXPENDITURE "EXOGENOUS" IN SEPARABLE DEMAND MODELS?
The separability hypothesis and expenditure as an exogenous variable in a system of conditional demands are analyzed. Expenditure cannot be weakly exogenous in a system of conditional demands specified as functions of the prices of the separable goods and total expenditure on those goods. Furthermore, expenditure is uncorrelated with the residuals of the conditional demand equations only when severe restrictions are satisfied. Therefore, expenditure will seldom be strictly exogenous. Econometric methods are presented for the consistent and efficient estimation of the unknown parameters when expenditures is correlated with the residuals and when it is not.Demand and Price Analysis,
Inconsistency of Pitman-Yor process mixtures for the number of components
In many applications, a finite mixture is a natural model, but it can be
difficult to choose an appropriate number of components. To circumvent this
choice, investigators are increasingly turning to Dirichlet process mixtures
(DPMs), and Pitman-Yor process mixtures (PYMs), more generally. While these
models may be well-suited for Bayesian density estimation, many investigators
are using them for inferences about the number of components, by considering
the posterior on the number of components represented in the observed data. We
show that this posterior is not consistent --- that is, on data from a finite
mixture, it does not concentrate at the true number of components. This result
applies to a large class of nonparametric mixtures, including DPMs and PYMs,
over a wide variety of families of component distributions, including
essentially all discrete families, as well as continuous exponential families
satisfying mild regularity conditions (such as multivariate Gaussians).Comment: This is a general treatment of the problem discussed in our related
article, "A simple example of Dirichlet process mixture inconsistency for the
number of components", Miller and Harrison (2013) arXiv:1301.270
Descent c-Wilf Equivalence
Let denote the symmetric group. For any , we let
denote the number of descents of ,
denote the number of inversions of , and
denote the number of left-to-right minima of .
For any sequence of statistics on
permutations, we say two permutations and in are
-c-Wilf equivalent if the generating
function of over all permutations which
have no consecutive occurrences of equals the generating function of
over all permutations which have no
consecutive occurrences of . We give many examples of pairs of
permutations and in which are -c-Wilf
equivalent, -c-Wilf equivalent, and
-c-Wilf equivalent. For example, we
will show that if and are minimally overlapping permutations
in which start with 1 and end with the same element and
and , then and are
-c-Wilf equivalent.Comment: arXiv admin note: text overlap with arXiv:1510.0431
Exact Enumeration and Sampling of Matrices with Specified Margins
We describe a dynamic programming algorithm for exact counting and exact
uniform sampling of matrices with specified row and column sums. The algorithm
runs in polynomial time when the column sums are bounded. Binary or
non-negative integer matrices are handled. The method is distinguished by
applicability to non-regular margins, tractability on large matrices, and the
capacity for exact sampling
- …