Search results

Title: Tying Up Loose Strands: Defining Equations of the Strand Symmetric Model
Creator: Long, Colby, Sullivant, Seth
Date: 2015, 2015-06-11
Description: The strand symmetric model is a phylogenetic model designed to reflect the symmetry inherent in the double-stranded structure of DNA. We show...
Show moreThe strand symmetric model is a phylogenetic model designed to reflect the symmetry inherent in the double-stranded structure of DNA. We show that the set of known phylogenetic invariants for the general strand symmetric model of the three leaf claw tree entirely defines the ideal. This knowledge allows one to determine the vanishing ideal of the general strand symmetric model of any trivalent tree. Our proof of the main result is computational. We use the fact that the Zariski closure of the strand symmetric model is the secant variety of a toric variety to compute the dimension of the variety. We then show that the known equations generate a prime ideal of the correct dimension using elimination theory.
Show less
Collection: Journal of Algebraic Statistics

Title: On Exchangeability in Network Models, Special Volume in honor of memory of S.E.Fienberg
Creator: Lauritzen, Steffen, Rinaldo, Alessandro, Sadeghi, Kayvan
Date: 2019, 2019-04-12
Description: We derive representation theorems for exchangeable distributions on finite and infinite graphs using elementary arguments based on geometric...
Show moreWe derive representation theorems for exchangeable distributions on finite and infinite graphs using elementary arguments based on geometric and graph-theoretic concepts. Our results elucidate some of the key differences, and their implications, between statistical network models that are finitely exchangeable and models that define a consistent sequence of probability distributions on graphs of increasing size.
Show less
Collection: Journal of Algebraic Statistics

Title: Maximum Likelihood Estimation of the Latent Class Model through Model Boundary Decomposition, Special Volume in honor of memory of S.E.Fienberg
Creator: Elizabeth S. Allman, Baños Cervantes, Hector, Evans, Robin, Hosten, Serkan, Kubjas, Kaie, Lemke, Daniel, Rhodes, John, Zwiernik, Piotr
Date: 2019, 2019-04-12
Description: The Expectation-Maximization (EM) algorithm is routinely used for maximum likelihood estimation in latent class analysis. However, the EM...
Show moreThe Expectation-Maximization (EM) algorithm is routinely used for maximum likelihood estimation in latent class analysis. However, the EM algorithm comes with no global guarantees of reaching the global optimum. We study the geometry of the latent class model in order to understand the behavior of the maximum likelihood estimator. In particular, we characterize the boundary stratification of the binary latent class model with a binary hidden variable. For small models, such as for three binary observed variables, we show that this stratification allows exact computation of the maximum likelihood estimator. In this case we use simulations to study the maximum likelihood estimation attraction basins of the various strata and performance of the EM algorithm. Our theoretical study is complemented with a careful analysis of the EM fixed point ideal which provides an alternative method of studying the boundary stratification and maximizing the likelihood function. In particular, we compute the minimal primes of this ideal in the case of a binary latent class model with a binary or ternary hidden random variable.
Show less
Collection: Journal of Algebraic Statistics

Title: Inference for Ordinal Log-Linear Models Based on Algebraic Statistics, Special Volume in honor of memory of S.E.Fienberg
Creator: Pham, Thi Mui, Kateri, Maria
Date: 2019, 2019-04-12
Description: Tools of algebraic statistics combined with MCMC algorithms have been used in contingency table analysis for model selection and model fit...
Show moreTools of algebraic statistics combined with MCMC algorithms have been used in contingency table analysis for model selection and model fit testing of log-linear models. However, this approach has not been considered so far for association models, which are special log-linear models for tables with ordinal classification variables. The simplest association model for two-way tables, the uniform (U) association model, has just one parameter more than the independence model and is applicable when both classification variables are ordinal. Less parsimonious are the row (R) and column (C) effect association models, appropriate when at least one of the classification variables is ordinal. Association models have been extended for multidimensional contingency tables as well. Here, we adjust algebraic methods for association models analysis and investigate their eligibility, focusing mainly on two-way tables. They are implemented in the statistical software R and illustrated on real data tables. Finally the algebraic model fit and selection procedure is assessed and compared to the asymptotic approach in terms of a simulation study.
Show less
Collection: Journal of Algebraic Statistics

Title: Exact tests to compare contingency tables under quasi-independence and quasi-symmetry, Special Volume in honor of memory of S.E.Fienberg
Creator: Bocci, Christiano, Rapallo, Fabio
Date: 2019, 2019-04-12
Description: In this work we define log-linear models to compare several square contingency tables under the quasi-independence or the quasi-symmetry model...
Show moreIn this work we define log-linear models to compare several square contingency tables under the quasi-independence or the quasi-symmetry model, and the relevant Markov bases are theoretically characterized. Through Markov bases, an exact test to evaluate if two or more tables fit a common model is introduced. Two real-data examples illustrate the use of tehse models in different fields of applications.
Show less
Collection: Journal of Algebraic Statistics

Title: Detecting epistasis via Markov bases
Creator: Malaspinas, Anna-Sapfo, Uhler, Caroline
Date: 2011, 2011
Description: Rapid research progress in genotyping techniques have allowed large genome-wide association studies. Existing methods often focus on...
Show moreRapid research progress in genotyping techniques have allowed large genome-wide association studies. Existing methods often focus on determining associations between single loci and a specific phenotype. However, a particular phenotype is usually the result of complex relationships between multiple loci and the environment. In this paper, we describe a two-stage method for detecting epistasis by combining the traditionally used single-locus search with a search for multiway interactions. Our method is based on an extended version of Fisher’s exact test. To perform this test, a Markov chain is constructed on the space of multidimensional contingency tables using the elements of a Markov basis as moves. We test our method on simulated data and compare it to a two-stage logistic regression method and to a fully Bayesian method, showing that we are able to detect the interacting loci when other methods fail to do so. Finally, we apply our method to a genome-wide data set consisting of 685 dogs and identify epistasis associated with canine hair length for four pairs of single nucleotide polymorphisms (SNPs).
Show less
Collection: Journal of Algebraic Statistics

Title: Open Problems on Connectivity of Fibers with Positive Margins in Multi-dimensional Contingency Tables
Creator: Yoshida, Ruriko
Date: 2010, 2010
Description: Diaconis-Sturmfels developed an algorithm for sampling from conditional distributions for a statistical model of discrete exponential families...
Show moreDiaconis-Sturmfels developed an algorithm for sampling from conditional distributions for a statistical model of discrete exponential families, based on the algebraic theory of toric ideals. This algorithm is applied to categorical data analysis through the notion of Markov bases. Initiated with its application to Markov chain Monte Carlo approach for testing statistical fitting of the given model, many researchers have extensively studied the structure of Markov bases for models in computational algebraic statistics. In the Markov chain Monte Carlo approach for testing statistical fitting of the given model, a Markov basis is a set of moves connecting all contingency tables satisfying the given margins. Despite the computational advances, there are applied problems where one may never be able to compute a Markov basis. In general, the number of elements in a minimal Markov basis for a model can be exponentially many. Thus, it is important to compute a reduced number of moves which connect all tables instead of computing a Markov basis. In some cases, such as logistic regression, positive margins are shown to allow a set of Markov connecting moves that are much simpler than the full Markov basis. Such a set is called a Markov subbasis with assumption of positive margins. In this paper we summarize some computations of and open problems on Markov subbases for contingency tables with assumption of positive margins under specific models as well as develop algebraic methods for studying connectivity of Markov moves with margin positivity to develop Markov sampling methods for exact conditional inference in statistical models where the Markov basis is hard to compute.
Show less
Collection: Journal of Algebraic Statistics

Title: An Euclidean norm based criterion to assess robots’ 2D path-following performance, AS2015 Special Issue articles: This issue includes a series of papers from talks, posters and collaborations resulting from and inspired by the Algebraic Statistics Conference held in Genoa, Italy, in June 2015. Special issue guest editors: Piotr Zwiernik and Fabio Rapallo.
Creator: Saggini, Eleonora, Torrente, Maria-Laura
Date: 2016, 2016-07-12
Description: A current need in the robotics field is the definition of methodologies for quantitatively evaluating the results of experiments. This paper...
Show moreA current need in the robotics field is the definition of methodologies for quantitatively evaluating the results of experiments. This paper contributes to this by defining a new criterion for assessing path-following tasks in the planar case, that is, evaluating the performance of robots that are required to follow a desired reference path. Such criterion comes from the study of the local differential geometry of the problem. New conditions for deciding whether or not the zero locus of a given polynomial intersects the neighbourhood of a point are defined. Based on this, new algorithms are presented and tested on both simulated data and experiments conducted at sea employing an Unmanned Surface Vehicle.
Show less
Collection: Journal of Algebraic Statistics

Title: Uncovering Proximity of Chromosome Territories using Classical Algebraic Statistics
Creator: Arsuaga, Javier, Heskia, Ido, Hosten, Serkan, Maskalevich, Tatiana
Date: 2015, 2015-11-09
Description: Exchange type chromosome aberrations (ETCAs) are rearrangements of the genome that occur when chromosomes break and the resulting fragments...
Show moreExchange type chromosome aberrations (ETCAs) are rearrangements of the genome that occur when chromosomes break and the resulting fragments rejoin with fragments from other chromosomes or from other regions within the same chromosome. ETCAs are commonly observed in cancer cells and in cells exposed to radiation. The frequency of these chromosome rearrangements is correlated with their spatial proximity, therefore it can be used to infer the three dimensional organization of the genome. Extracting statistical significance of spatial proximity from cancer and radiation data has remained somewhat elusive because of the sparsity of the data. We here propose a new approach to study the three dimensional organization of the genome using algebraic statistics. We test our method on a published data set of irradiated human blood lymphocyte cells. We provide a rigorous method for testing the overall organization of the genome, and in agreement with previous results we find a random relative positioning of chromosomes with the exception of the chromosome pairs {1,22} and {13,14} that have a significantly larger number of ETCAs than the rest of the chromosome pairs suggesting their spatial proximity. We conclude that algebraic methods can successfully be used to analyze genetic data and have potential applications to larger and more complex data sets.
Show less
Collection: Journal of Algebraic Statistics

Title: Markov degree of configurations defined by fibers of a configuration
Creator: Koyama, Takayuki, Ogawa, Mitsunori, Takemura, Akimichi
Date: 2015, 2015-11-09
Description: We consider a series of configurations defined by fibers of a given base configuration. We prove that Markov degree of the configurations is...
Show moreWe consider a series of configurations defined by fibers of a given base configuration. We prove that Markov degree of the configurations is bounded from above by the Markov complexity of the base configuration. As important examples of base configurations we consider incidence matrices of graphs and study the maximum Markov degree of configurations defined by fibers of the incidence matrices. In particular we give a proof that the Markov degree for two-way transportation polytopes is three.
Show less
Collection: Journal of Algebraic Statistics

Title: The maximum likelihood degree of Fermat hypersurfaces
Creator: Agostini, Daniele, Alberelli, Davide, Grande, Francesco, Lella, Paolo
Date: 2015, 2015-11-09
Description: We study the critical points of the likelihood function over the Fermat hypersurface. This problem is related to one of the main problems in...
Show moreWe study the critical points of the likelihood function over the Fermat hypersurface. This problem is related to one of the main problems in statistical optimization: maximum likelihood estimation. The number of critical points over a projective variety is a topological invariant of the variety and is called maximum likelihood degree. We provide closed formulas for the maximum likelihood degree of any Fermat curve in the projective plane and of Fermat hypersurfaces of degree 2 in any projective space. Algorithmic methods to compute the ML degree of a generic Fermat hypersurface are developed throughout the paper. Such algorithms heavily exploit the symmetries of the varieties we are considering. A computational comparison of the different methods and a list of the maximum likelihood degrees of several Fermat hypersurfaces are available in the last section.
Show less
Collection: Journal of Algebraic Statistics

Title: Moment Varieties of Gaussian Mixtures, AS2015 Special Issue articles: This issue includes a series of papers from talks, posters and collaborations resulting from and inspired by the Algebraic Statistics Conference held in Genoa, Italy, in June 2015. Special issue guest editors: Piotr Zwiernik and Fabio Rapallo.
Creator: Améndola, Carlos, Faugère, Jean-Charles, Sturmfels, Bernd
Date: 2016, 2016-07-12
Description: The points of a moment variety are the vectors of all moments up to some order, for a given family of probability distributions. We study the...
Show moreThe points of a moment variety are the vectors of all moments up to some order, for a given family of probability distributions. We study the moment varieties for mixtures of multivariate Gaussians. Following up on Pearson’s classical work from 1894, we apply current tools from computational algebra to recover the parameters from the moments. Our moment varieties extend objects familiar to algebraic geometers. For instance, the secant varieties of Veronese varieties are the loci obtained by setting all covariance matrices to zero. We compute the ideals of the 5-dimensional moment varieties representing mixtures of two univariate Gaussians, and we offer a comparison to the maximum likelihood approach.
Show less
Collection: Journal of Algebraic Statistics

Title: On multivariable cumulant polynomial sequences with applications, AS2015 Special Issue articles: This issue includes a series of papers from talks, posters and collaborations resulting from and inspired by the Algebraic Statistics Conference held in Genoa, Italy, in June 2015. Special issue guest editors: Piotr Zwiernik and Fabio Rapallo.
Creator: Di Nardo, Elvira
Date: 2016, 2016-07-12
Description: A new family of polynomials, called cumulant polynomial sequence, and its extension to the multivariate case is introduced relying on a purely...
Show moreA new family of polynomials, called cumulant polynomial sequence, and its extension to the multivariate case is introduced relying on a purely symbolic combinatorial method. The coefficients are cumulants, but depending on what is plugged in the indeterminates, moment sequences can be recovered as well. The main tool is a formal generalization of random sums, when a not necessarily integer-valued multivariate random index is considered. Applications are given within parameter estimations, L ?evy processes and random matrices and, more generally, problems involving multivariate functions. The connection between exponential models and multivariable Sheffer polynomial sequences offers a different viewpoint in employing the method. Some open problems end the paper.
Show less
Collection: Journal of Algebraic Statistics

Title: Algebraic geometry of Poisson regression, AS2015 Special Issue articles: This issue includes a series of papers from talks, posters and collaborations resulting from and inspired by the Algebraic Statistics Conference held in Genoa, Italy, in June 2015. Special issue guest editors: Piotr Zwiernik and Fabio Rapallo.
Creator: Kahle, Thomas, Oelbermann, Kai-Friederike, Schwabe, Rainer
Date: 2016, 2016-07-12
Description: Designing experiments for generalized linear models is difficult because optimal designs depend on unknown parameters. Here we investigate...
Show moreDesigning experiments for generalized linear models is difficult because optimal designs depend on unknown parameters. Here we investigate local optimality. We propose to study for a given design its region of optimality in parameter space. Often these regions are semi-algebraic and feature interesting symmetries. We demonstrate this with the Rasch Poisson counts model. For any given interaction order between the explanatory variables we give a characterization of the regions of optimality of a special saturated design. This extends known results from the case of no interaction. We also give an algebraic and geometric perspective on optimality of experimental designs for the Rasch Poisson counts model using polyhedral and spectrahedral geometry.
Show less
Collection: Journal of Algebraic Statistics

Title: A linear-algebraic tool for conditional independence inference
Creator: Tanaka, Kentaro, Studeny, Milan, Takemura, Akimichi, Sei, Tomonari
Date: 2015, 2015-11-09
Description: In this note, we propose a new linear-algebraic method for the implication problem among conditional independence statements, which is...
Show moreIn this note, we propose a new linear-algebraic method for the implication problem among conditional independence statements, which is inspired by the factorization characterization of conditional independence. First, we give a criterion in the case of a discrete strictly positive density and relate it to an earlier linear-algebraic approach. Then, we extend the method to the case of a discrete density that need not be strictly positive. Finally, we provide a computational result in the case of six variables.
Show less
Collection: Journal of Algebraic Statistics

Title: Mode Poset Probability Polytopes, AS2015 Special Issue articles: This issue includes a series of papers from talks, posters and collaborations resulting from and inspired by the Algebraic Statistics Conference held in Genoa, Italy, in June 2015. Special issue guest editors: Piotr Zwiernik and Fabio Rapallo.
Creator: Montúfar, Guido, Rauh, Johannes
Date: 2016, 2016-07-12
Description: A mode of a probability distribution is an elementary event that has more probability mass than each of its direct neighbors, with respect to...
Show moreA mode of a probability distribution is an elementary event that has more probability mass than each of its direct neighbors, with respect to some vicinity structure on the set of elementary events. The mode inequalities cut out a polytope from the simplex of probability distributions. Related to this is the concept of strong modes. A strong mode is an elementary event that has more probability mass than all its direct neighbors together. The set of probability distributions with a given set of strong modes is again a polytope. We study the vertices, the facets, and the volume of such polytopes depending on the sets of (strong) modes and the vicinity structures.
Show less
Collection: Journal of Algebraic Statistics

Title: Technology News, April 01, 1949
Creator: Illinois Institute of Technology
Date: 1949-04-01, 1949-04-01
Collection: Technology News Microfilm collection, 1928-1981

Title: New Bauhaus scrapbook, 1936-1938
Date: 1936-1938
Description: Thirty-seven page scrapbook with hand made fabric covered box with lower case letter b (for Bauhaus) on font in silver metal. Scrapbook (16 x...
Show moreThirty-seven page scrapbook with hand made fabric covered box with lower case letter b (for Bauhaus) on font in silver metal. Scrapbook (16 x 16”) has black plastic covers, spiral bound with manila card stock pages. Includes news clippings and tear sheets from periodicals about the opening of The New Bauhaus as well as the academic catalogue and program announcements, and a letter from Walter Gropius (5/18/1937) recommending Laszlo Moholy-Nagy as director. Creator unknown, assumed to be affiliated with the New Bauhaus.
Show less
Collection: Institute of Design records, 1937-ca. 1962