Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new user$A$-Hypergeometric Distributions and Newton Polytopes
223
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We give a bijection between a quotient space of the parameters and the space of moments for any $A$-hypergeometric distribution. An algorithmic method to compute the inverse image of the map is proposed utilizing the holonomic gradient method and an asymptotic equivalence of the map and the iterative proportional scaling. The algorithm gives a method to solve a conditional maximum likelihood estimation problem in statistics. Our interplay between the theory of hypergeometric functions and statistics gives some new formulas of $A$-hypergeometric polynomials.
rate research
Read More
We propose new generalized multivariate hypergeometric distributions, which extremely resemble the classical multivariate hypergeometric distributions. The proposed distributions are derived based on an urn model approach. In contrast to existing methods, this approach does not involve hypergeometric series.
A neighborliness property of marginal polytopes of hierarchical models, depending on the cardinality of the smallest non-face of the underlying simplicial complex, is shown. The case of binary variables is studied explicitly, then the general case is reduced to the binary case. A Markov basis for binary hierarchical models whose simplicial complexes is the complement of an interval is given.
We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn out and balls of different colors can be simultaneously added. More precisely, at each time-step, the conditional distribution of the number of extracted balls of a certain color given the past is assumed to be hypergeometric. We prove some central limit theorems in the sense of stable convergence and of almost sure conditional convergence, which are stronger than convergence in distribution. The proven results provide asymptotic confidence intervals for the limit proportion, whose distribution is generally unknown. Moreover, we also consider the case of more urns subjected to some random common factors.
We present an efficient method of calculating exact confidence intervals for the hypergeometric parameter. The method inverts minimum-width acceptance intervals after shifting them to make their endpoints nondecreasing while preserving their level. The resulting set of confidence intervals achieves minimum possible average width, and even in comparison with confidence sets not required to be intervals it attains the minimum possible cardinality most of the time, and always within 1. The method compares favorably with existing methods not only in the size of the intervals but also in the time required to compute them. The available R package hyperMCI implements the proposed method.
We show that the problem of finding the measure supported on a compact subset K of the complex plane such that the variance of the least squares predictor by polynomials of degree at most n at a point exterior to K is a minimum, is equivalent to the problem of finding the polynomial of degree at most n, bounded by 1 on K with extremal growth at this external point. We use this to find the polynomials of extremal growth for the interval [-1,1] at a purely imaginary point. The related problem on the extremal growth of real polynomials was studied by ErdH{o}s in 1947.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
