Buradasınız

L-cumulants, L-cumulant embeddings and algebraic statistics

Journal Name:

Publication Year:

Author Name
Abstract (2. Language): 
Focusing on the discrete probabilistic setting we generalize the combinatorial de nition of cumulants to L-cumulants. This generalization keeps all the desired properties of the classical cumulants like semi-invariance and vanishing for independent blocks of random variables. These properties make L-cumulants useful for the algebraic analysis of statistical models. We illustrate this for general Markov models and hidden Markov processes in the case when the hidden process is binary. The main motivation of this work is to understand cumulant-like coordinates in algebraic statistics and to give a more insightful explanation why tree cumulants give such an elegant description of binary hidden tree models. Moreover, we argue that L-cumulants can be used in the analysis of certain classical algebraic varieties.
11-43

REFERENCES

References: 

[1] David R. Brillinger. The calculation of cumulants via conditioning. Annals of the
Institute of Statistical Mathematics, 21(1):215{218, 1969.
[2] Anthony C. Davison. Statistical models, volume 11 of Cambridge Series in Statistical
and Probabilistic Mathematics. Cambridge University Press, Cambridge, 2003.
[3] Mathias Drton, Bernd Sturmfels, and Seth Sullivant. Lectures on Algebraic Statistics.
Oberwolfach Seminars Series. Birkhauser Verlag AG, 2009.
[4] William Feller. An Introduction to Probability Theory and Applications, volume 2.
John Wiley & Sons, New York, second edition, 1971.
[5] Dan Geiger, David Heckerman, Henry King, and Christopher Meek. Stratied exponential
families: graphical models and model selection. Ann. Statist., 29(2):505{529,
2001.
[6] James D. Hamilton. A new approach to the economic analysis of nonstationary time
series and the business cycle. Econometrica: Journal of the Econometric Society,
57(2):357{384, 1989.
[7] Steen L. Lauritzen. Graphical models, volume 17 of Oxford Statistical Science Series.
The Clarendon Press Oxford University Press, New York, 1996. Oxford Science
Publications.
[8] Franz Lehner. Free cumulants and enumeration of connected partitions. European
Journal of Combinatorics, 23(8):1025{1031, 2002.
[9] Franz Lehner. Cumulants in noncommutative probability theory I. Noncommutative
exchangeability systems. Mathematische Zeitschrift, 248(1):67{100, 2004.
[10] Kishiko Maruyama and Fumiaki Shibata. From two-state jump to Gaussian stochastic
processes. Physica A: Statistical and Theoretical Physics, 149(3):447 { 471, 1988.
[11] Peter McCullagh. Tensor methods in statistics. Monographs on Statistics and Applied
Probability. Chapman & Hall, London, 1987.
[12] Giovanni Pistone and Henry P. Wynn. Cumulant varieties. Journal of Symbolic
Computation, 41(2):210{221, 2006.
[13] Gian-Carlo Rota. On the foundations of combinatorial theory I. Theory of Mobius
Functions. Probability Theory and Related Fields, 2(4):340{368, 1964.
[14] Gian-Carlo Rota, D. Kahaner, and A. Odlyzko. On the foundations of combinatorial
theory. VIII- Finite operator calculus(Umbral/nite operator/ calculus in combinatorial
theory of special polynomial sequences as technique for expressing one polynomial
set in terms of another). Journal of Mathematical Analysis and Applications, 42:684{
760, 1973.
[15] Gian-Carlo Rota and Jianhong Shen. On the combinatorics of cumulants. J. Combin.
Theory Ser. A, 91(1-2):283{304, 2000. In memory of Gian-Carlo Rota.
[16] Dmitry Rusakov and Dan Geiger. Asymptotic model selection for naive Bayesian
networks. J. Mach. Learn. Res., 6:1{35 (electronic), 2005.
[17] Charles Semple and Mike Steel. Phylogenetics, volume 24 of Oxford Lecture Series in
Mathematics and its Applications. Oxford University Press, Oxford, 2003.
[18] Raaella Settimi and Jim Q. Smith. Geometry, moments and conditional independence
trees with hidden variables. Ann. Statist., 28(4):1179{1205, 2000.
[19] Terence P. Speed. Cumulants and partition lattices. Austral. J. Statist, 25(2):378{388,
1983.
[20] Roland Speicher. Free probability theory and non-crossing partitions. Sem. Lothar.
Combin., 39:Art. B39c, 38 pp. (electronic), 1997.
[21] Roland Speicher and Reza Woroudi. Boolean convolution. In Free probability theory
(Waterloo, ON, 1995), volume 12 of Fields Inst. Commun., pages 267{279. Amer.
Math. Soc., Providence, RI, 1997.
[22] Richard P. Stanley. Enumerative combinatorics. Volume I. Number 49 in Cambridge
Studies in Advanced Mathematics. Cambridge University Press, 2002.
[23] Bernd Sturmfels and Piotr Zwiernik. Binary cumulant varieties. to appear in Annals
of Combinatorics, March 2011.
[24] Louis Weisner. Abstract theory of inversion of nite series. Trans. Amer. Math. Soc.,
38(3):474{484, 1935.
[25] Piotr Zwiernik. An asymptotic behaviour of the marginal likelihood for general
Markov models. J. Mach. Learn. Res., 12:3283{3310, 2011.
[26] Piotr Zwiernik and Jim Q. Smith. Implicit inequality constraints in a binary tree
model. Electron. J. Statist., 5:1276{1312, 2011.
[27] Piotr Zwiernik and Jim Q. Smith. Tree-cumulants and the geometry of binary tree
models. Bernoulli, 18(1):290{321, January 2012.

Thank you for copying data from http://www.arastirmax.com