DSDespina Stasi

Despina Stasi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Despina Stasi has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Random Sampling in Computational Algebra: Helly Numbers and Violator Spaces

    by Jesús A. De Loera, Sonja Petrović, Despina Stasi

    This paper transfers a randomized algorithm, originally used in geometric optimization, to computational problems in commutative algebra. We show that Clarkson's sampling algorithm can be applied to two problems in computational algebra: solving large-scale polynomial systems and finding small generating sets of graded ideals. The cornerstone of our work is showing that the theory of violator spaces of G\"artner et al.\ applies to polynomial ideal problems. To show this, one utilizes a Helly-type result for algebraic varieties. The resulting algorithms have expected runtime linear in the number of input polynomials, making the ideas interesting for handling systems with very large numbers of polynomials, but whose rank in the vector space of polynomials is small (e.g., when the number of variables and degree is constant).

  • Open Access

    Hydras: Directed Hypergraphs and Horn Formulas

    by Robert H. Sloan, Despina Stasi, Gyorgy Turan

    We introduce a new graph parameter, the hydra number, arising from the minimization problem for Horn formulas in propositional logic. The hydra number of a graph $G=(V,E)$ is the minimal number of hyperarcs of the form $u,v\rightarrow w$ required in a directed hypergraph $H=(V,F)$, such that for every pair $(u, v)$, the set of vertices reachable in $H$ from $\{u, v\}$ is the entire vertex set $V$ if $(u, v) \in E$, and it is $\{u, v\}$ otherwise. Here reachability is defined by forward chaining, a standard marking algorithm. Various bounds are given for the hydra number. We show that the hydra number of a graph can be upper bounded by the number of edges plus the path cover number of the line graph of a spanning subgraph, which is a sharp bound in several cases. On the other hand, we construct single-headed graphs for which that bound is off by a constant factor. Furthermore, we characterize trees with low hydra number, and give a lower bound for the hydra number of trees based on the number of vertices that are leaves in the tree obtained from $T$ by deleting its leaves. This bound is sharp for some families of trees. We give bounds for the hydra number of complete binary trees and also discuss a related minimization problem.

  • Open Access

    $β$ models for random hypergraphs with a given degree sequence

    by Despina Stasi, Kayvan Sadeghi, Alessandro Rinaldo, Sonja Petrović, Stephen E. Fienberg

    We introduce the beta model for random hypergraphs in order to represent the occurrence of multi-way interactions among agents in a social network. This model builds upon and generalizes the well-studied beta model for random graphs, which instead only considers pairwise interactions. We provide two algorithms for fitting the model parameters, IPS (iterative proportional scaling) and fixed point algorithm, prove that both algorithms converge if maximum likelihood estimator (MLE) exists, and provide algorithmic and geometric ways of dealing the issue of MLE existence.


  • Open Access

    Goodness-of-fit for log-linear network models: Dynamic Markov bases using hypergraphs

    by Elizabeth Gross, Sonja Petrović, Despina Stasi

    Social networks and other large sparse data sets pose significant challenges for statistical inference, as many standard statistical methods for testing model fit are not applicable in such settings. Algebraic statistics offers a theoretically justified approach to goodness-of-fit testing that relies on the theory of Markov bases and is intimately connected with the geometry of the model as described by its fibers. Most current practices require the computation of the entire basis, which is infeasible in many practical settings. We present a dynamic approach to explore the fiber of a model, which bypasses this issue, and is based on the combinatorics of hypergraphs arising from the toric algebra structure of log-linear models. We demonstrate the approach on the Holland-Leinhardt $p_1$ model for random directed graphs that allows for reciprocated edges.