2 citations · 4 across the 5 of their papers we have counts for
8 papers
Asymptotic Degree of Random Monomial Ideals
Lily Silverstein, Dane Wilburne, Jay Yang
One of the fundamental invariants connecting algebra and geometry is the degree of an ideal. In this paper we derive the probabilistic behavior of degree with respect to the versat…
Wilf's conjecture in fixed multiplicity
Winfried Bruns, Pedro Garcia-Sanchez, Christopher O'Neill +1
We give an algorithm to determine whether Wilf's conjecture holds for all numerical semigroups with a given multiplicity , and use it to prove Wilf's conjecture holds whenever $…
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…
Random numerical semigroups and a simplicial complex of irreducible semigroups
Jesus De Loera, Christopher O'Neill, Dane Wilburne
We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofinitene…
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…
Monte Carlo goodness-of-fit tests for degree corrected and related stochastic blockmodels
Vishesh Karwa, Debdeep Pati, Sonja Petrović +6
We construct Bayesian and frequentist finite-sample goodness-of-fit tests for three different variants of the stochastic blockmodel for network data. Since all of the stochastic bl…
On the Geometry and Extremal Properties of the Edge-Degeneracy Model
Nicolas Kim, Dane Wilburne, Sonja Petrović +1
The edge-degeneracy model is an exponential random graph model that uses the graph degeneracy, a measure of the graph's connection density, and number of edges in a graph as its su…
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…