17 citations · 22 across the 8 of their papers we have counts for
11 papers
Goodness of fit for log-linear ERGMs
Elizabeth Gross, Sonja Petrović, Despina Stasi
Many popular models from the networks literature can be viewed through a common lens of contingency tables on network dyads, resulting in \emph{log-linear ERGMs}: exponential famil…
Random Monomial Ideals Macaulay2 Package
Sonja Petrović, Despina Stasi, Dane Wilburne
The {\tt Macaulay2} package {\tt RandomMonomialIdeals} provides users with a set of tools that allow for the systematic generation and study of random monomial ideals. It also intr…
The Multiple Roots Phenomenon in Maximum Likelihood Estimation for Factor Analysis
Elizabeth Gross, Sonja Petrović, Donald Richards +1
Multiple root estimation problems in statistical inference arise in many contexts in the literature. In the context of maximum likelihood estimation, the existence of multiple root…
Random Monomial Ideals
Jesus A. De Loera, Sonja Petrovic, Lily Silverstein +2
Inspired by the study of random graphs and simplicial complexes, and motivated by the need to understand average behavior of ideals, we propose and study probabilistic models of ra…
Hydras: Directed Hypergraphs and Horn Formulas
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 is the m…
Random Sampling in Computational Algebra: Helly Numbers and Violator Spaces
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…
Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals
Jesús A. De Loera, Susan Margulies, Michael Pernpeintner +5
We revisit a well-known family of polynomial ideals encoding the problem of graph--colorability. Our paper describes how the inherent combinatorial structure of the ideals impli…
Statistical models for cores decomposition of an undirected random graph
Vishesh Karwa, Michael J. Pelsmajer, Sonja Petrović +2
The -core decomposition is a widely studied summary statistic that describes a graph's global connectivity structure. In this paper, we move beyond using -core decomposition…
models for random hypergraphs with a given degree sequence
Despina Stasi, Kayvan Sadeghi, Alessandro Rinaldo +2
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 gener…
Goodness-of-fit for log-linear network models: Dynamic Markov bases using hypergraphs
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 applicabl…
Toric algebra of hypergraphs
Sonja Petrović, Despina Stasi
The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their genera…