17 citations · 22 across the 8 of their papers we have counts for
4 papers · 1 filter
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…