1,720,994 research outputs found
Triangulations of cosmological polytopes
Full text linkA cosmological polytope is defined for a given Feynman diagram, and its canonical form may be used to compute the contribution of the Feynman diagram to the wavefunction of certain cosmological models. Given a subdivision of a polytope, its canonical form is obtained as a sum of the canonical forms of the facets of the subdivision. In this paper, we identify such formulas for the canonical form via algebraic techniques. It is shown that the toric ideal of every cosmological polytope admits a Gröbner basis with a squarefree initial ideal, yielding a regular unimodular triangulation of the polytope. In specific instances, including trees and cycles, we recover graphical characterizations of the facets of such triangulations that may be used to compute the desired canonical form. For paths and cycles, these characterizations admit simple enumeration. Hence, we obtain formulas for the normalized volume of these polytopes, extending previous observations of Kühne and Monin
Normal and Δ-Normal Configurations in Toric Algebra
Full text linkToric algebra is a field of study that lies at the intersection of algebra, geometry, and combinatorics. Thus, the algebraic properties of the toric ideal IA defined by the vector configuration A are often characterizable via the geometric and combinatorial properties of its corresponding toric variety and A, respectively. Here, we focus on the property of normality of A. A normal vector configuration defines the toric ideal of a normal toric variety. However, the definition of normality of A is based entirely on the algebraic structures associated with A without regard to any of its combinatorial properties. In this paper, we discuss two attempts to provide a combinatorial characterization of normality of A. Particularly, we show that the properties the convex hull of A possesses a unimodular covering and A is a Δ-normal configuration are both sufficient conditions for normality of A, but neither is necessary. This suggests that another combinatorial property is required to provide the desired characterization of normality of A
Polyhedral Problems in Combinatorial Convex Geometry
Full text linkIn this dissertation, we exhibit two instances of polyhedra in combinatorial convex geometry. The first instance arises in the context of Ehrhart theory, and the polyhedra are the central objects of study. The second instance arises in algebraic statistics, and the polyhedra act as a conduit through which we study a nonpolyhedral problem.
In the first case, we examine combinatorial and algebraic properties of the Ehrhart h*-polynomial of the r-stable (n,k)-hypersimplices. These are a family of polytopes which form a nested chain of subpolytopes within the (n,k)-hypersimplex. We show that a well-studied unimodular triangulation of the (n,k)-hypersimplex restricts to a triangulation of each r-stable (n,k)-hypersimplex within. We then use this triangulation to compute the facet-defining inequalities of these polytopes. In the k=2 case, we use shelling techniques to devise a combinatorial interpretation of the coefficients of the h*-polynomials in terms of independent sets of certain graphs. From this, we then extract some results on unimodality. We also characterize the Gorenstein r-stable (n,k)-hypersimplices, and we conclude that these also have unimodal h*-polynomials.
In the second case, for a graph G on p vertices we consider the closure of the cone of concentration matrices of G. The extreme rays of this cone, and their associated ranks, have applications in maximum likelihood estimation for the undirected Gaussian graphical model associated to G. Consequently, the extreme ranks of this cone have been well-studied. Yet, there are few graph classes for which all the possible extreme ranks are known. We show that the facet-normals of the cut polytope of G can serve to identify extreme rays of this nonpolyhedral cone. We see that for graphs without K5 minors each facet-normal of the cut polytope identifies an extreme ray in the cone, and we determine the rank of this extreme ray. When the graph is also series-parallel, we find that all possible extreme ranks arise in this fashion, thereby extending the collection of graph classes for which all the possible extreme ranks are known
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Algebraic geometry of discrete interventional models
Full text linkWe investigate the algebra and geometry of general interventions in discrete
DAG models. To this end, we introduce a theory for modeling soft interventions
in the more general family of staged tree models and develop the formalism to
study these models as parametrized subvarieties of a product of probability
simplices. We then consider the problem of finding their defining equations,
and we derive a combinatorial criterion for identifying interventional staged
tree models for which the defining ideal is toric. We apply these results to
the class of discrete interventional DAG models and establish a criteria to
determine when these models are toric varieties.Comment: This version includes some minors revision to examples, intro and
statistical/algebraic outloo
- …
