Piotr Zwiernik
University of California, Berkeley
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Piotr Zwiernik.
Electronic Journal of Statistics | 2011
Piotr Zwiernik; Jim Q. Smith
In this paper we investigate the geometry of a discrete Bayesian network whose graph is a tree all of whose variables are binary and the only observed variables are those labeling its leaves. We provide the full geometric description of these models which is given by a set of polynomial equations together with a set of complementary implied inequalities induced by the positivity of probabilities on hidden variables. The phylogenetic invariants given by the equations can be useful in the construction of simple diagnostic tests. However, in this paper we point out the importance of also incorporating the associated inequalities into any statistical analysis. The full characterization of these inequality constraints derived in this paper helps us determine how and why routine statistical methods can break down for this model class.
Bernoulli | 2012
Piotr Zwiernik; Jim Q. Smith
In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on the theory of partially ordered sets allows us to obtain a convenient parametrization of this model class. The construction of the proposed coordinate system mirrors the combinatorial definition of cumulants. A simple product-like form of the resulting parametrization gives insight into identifiability issues associated with this model class. In particular, we provide necessary and sufficient conditions for such a model to be identified up to the switching of labels of the inner nodes. When these conditions hold, we give explicit formulas for the parameters of the model. Whenever the model fails to be identified, we use the new parametrization to describe the geometry of the unidentified parameter space. We illustrate these results using a simple example.In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on the theory of partially ordered sets allows us to obtain a convenient parametrization of this model class. The construction of the proposed coordinate system mirrors the combinatorial definition of cumulants. A simple product-like form of the resulting parametrization gives insight into identifiability issues associated with this model class. In particular, we provide necessary and sufficient conditions for such a model to be identified up to the switching of labels of the inner nodes. When these conditions hold, we give explicit formulas for the parameters of the model. Whenever the model fails to be identified, we use the new parametrization to describe the geometry of the unidentified parameter space. We illustrate these results using a simple example.
Annals of Combinatorics | 2013
Bernd Sturmfels; Piotr Zwiernik
Algebraic statistics for binary random variables is concerned with highly structured algebraic varieties in the space of 2×2×···×2-tensors. We demonstrate the advantages of representing such varieties in the coordinate system of binary cumulants. Our primary focus lies on hidden subset models. Parametrizations and implicit equations in cumulants are derived for hyperdeterminants, for secant and tangential varieties of Segre varieties, and for certain context-specific independence models. Extending work of Rota and collaborators, we explore the polynomial inequalities satisfied by cumulants.
International Mathematics Research Notices | 2014
Mateusz Michałek; Luke Oeding; Piotr Zwiernik
We study the secant line variety of the Segre product of projective spaces using special cumulant coordinates adapted for secant varieties. We show that the secant variety is covered by open normal toric varieties. We prove that in cumulant coordinates its ideal is generated by binomial quadrics. We present new results on the local structure of the secant variety. In particular, we show that it has rational singularities and we give a description of the singular locus. We also classify all secant varieties that are Gorenstein. Moreover, generalizing [SZ12], we obtain analogous results for the tangential variety.
Annals of Statistics | 2017
Shaun Fallat; Steffen L. Lauritzen; Kayvan Sadeghi; Caroline Uhler; Nanny Wermuth; Piotr Zwiernik
We discuss properties of distributions that are multivariate totally positive of order two (MTP2) related to conditional independence. In particular, we show that any independence model generated by an MTP2 distribution is a compositional semigraphoid which is upward-stable and singleton-transitive. In addition, we prove that any MTP2 distribution satisfying an appropriate support condition is faithful to its concentration graph. Finally, we analyze factorization properties of MTP2 distributions and discuss ways of constructing MTP2 distributions; in particular we give conditions on the log-linear parameters of a discrete distribution which ensure MTP2 and characterize conditional Gaussian distributions which satisfy MTP2.
arXiv: Algebraic Geometry | 2016
Ciro Ciliberto; Maria Angelica Cueto; Massimiliano Mella; Kristian Ranestad; Piotr Zwiernik
In this paper we present an effective method for linearizing rational varieties of codimension at least two under Cremona transformations, starting from a given parametrization. Using these linearizing Cremonas, we simplify the equations of secant and tangential varieties of some classical examples, including Veronese, Segre and Grassmann varieties. We end the paper by treating the special case of the Segre embedding of the n-fold product of projective spaces, where cumulant Cremonas, arising from algebraic statistics, appear as specific cases of our general construction.
Journal of Multivariate Analysis | 2014
Nanny Wermuth; Giovanni M. Marchetti; Piotr Zwiernik
We introduce families of jointly symmetric, binary distributions that are generated over directed star graphs whose nodes represent variables and whose edges indicate positive dependences. The families are parametrized in terms of a single parameter. It is an outstanding feature of these distributions that joint probabilities relate to evenly spaced concentric rings. Kronecker product characterizations make them computationally attractive for a large number of variables. We study the behavior of different measures of dependence and derive maximum likelihood estimates when all nodes are observed and when the inner node is hidden.
Bernoulli | 2017
Mathias Drton; Shaowei Lin; Luca Weihs; Piotr Zwiernik
Gaussian latent tree models, or more generally, Gaussian latent forest models have Fisher-information matrices that become singular along interesting submodels, namely, models that correspond to subforests. For these singularities, we compute the real log-canonical thresholds (also known as stochastic complexities or learning coefficients) that quantify the large-sample behavior of the marginal likelihood in Bayesian inference. This provides the information needed for a recently introduced generalization of the Bayesian information criterion. Our mathematical developments treat the general setting of Laplace integrals whose phase functions are sums of squared differences between monomials and constants. We clarify how in this case real log-canonical thresholds can be computed using polyhedral geometry, and we show how to apply the general theory to the Laplace integrals associated with Gaussian latent tree and forest models. In simulations and a data example, we demonstrate how the mathematical knowledge can be applied in model selection.
Prace i Materiały Instytutu Rozwoju Gospodarczego / Szkoła Główna Handlowa | 2011
Piotr Białowolski; Dawid Żochowski; Piotr Zwiernik
We investigate inflation in Poland in the period of economic transition by examining the potential application of Markov Switching Models to model the inflation generating process in Poland. The time horizon of analysis was limited to the period between March 1992 and October 2005 defined as the process of disinflation, i.e. the process of continued decrease in inflation rates following the economic transition period in early 1990s which was accompanied by a high level of inflation. According to the Ball-Friedman hypothesis, variation of inflation during periods of high inflation can be unstable. Indeed, the results show that non-linear models significantly improve the description of inflation generating process in Poland. Apart from univariate Markov Models, we also use a model that incorporates inflation expectations measured by Future Inflation Indicator (FII). We find that the model, where lagged values of FII are included as exogenous variables is significantly better in modelling inflation than simple univariate Markov Model.
Annals of Statistics | 2013
Jan Draisma; Sonja Kuhnt; Piotr Zwiernik
Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite exponential transformation families. We reveal this structure by explicitly describing, for any undirected graph, the (maximal) matrix group acting on the space of concentration matrices in the model. The continuous part of this group is captured by a poset naturally associated to the graph, while automorphisms of the graph account for the discrete part of the group. We compute the dimension of the space of orbits of this group on concentration matrices, in terms of the combinatorics of the graph; and for dimension zero we recover the characterization by Letac and Massam of models that are transformation families. Furthermore, we describe the maximal invariant of this group on the sample space, and we give a sharp lower bound on the sample size needed for the existence of equivariant estimators of the concentration matrix. Finally, we address the issue of robustness of these estimators by computing upper bounds on finite sample breakdown points.