Abstract | ||
---|---|---|
The closure of a discrete exponential family is described by a finite set of equations corresponding to the circuits of an underlying oriented matroid. These equations are similar to the equations used in algebraic statistics, although they need not be polynomial in the general case. This description allows for a combinatorial study of the possible support sets in the closure of an exponential family. If two exponential families induce the same oriented matroid, then their closures have the same support sets. Furthermore, the positive cocircuits give a parameterization of the closure of the exponential family. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1016/j.ijar.2011.01.013 | Int. J. Approx. Reasoning |
Keywords | Field | DocType |
combinatorial study,62b05,14p15,exponential family,finite set,52c40,support sets,oriented matroid,polytopes,general case,oriented matroid theory,exponential families,oriented matroids,underlying oriented matroid,discrete exponential family,support set,possible support set,algebraic statistic,algebraic statistics,moment map | Matroid,Discrete mathematics,Combinatorics,Exponential polynomial,Oriented matroid,Exponential family,Matroid partitioning,Graphic matroid,Algebraic statistics,Mathematics,Exponential formula | Journal |
Volume | Issue | ISSN |
52 | 5 | International Journal of Approximate Reasoning |
Citations | PageRank | References |
6 | 0.72 | 7 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Johannes Rauh | 1 | 152 | 16.63 |
Thomas Kahle | 2 | 26 | 6.39 |
Nihat Ay | 3 | 358 | 47.47 |