SPSonja Petrović

Sonja Petrović

*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


Sonja Petrović has a total of 48 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Asymptotic Properties of Random Monomial Ideals

    by Fatemeh Mohammadi, Sonja Petrović, Eduardo Sáenz de Cabezón

    This paper focuses on asymptotic properties of random monomial ideals through a statistical viewpoint. It extends the study of redundancy in monomial ideals by analyzing the poset density of the LCM-lattice. We explore how this density behaves across random algebraic models and structured networks. Experimental data reveal that the LCM-lattice exhibits sharp threshold behavior rather than changing smoothly. We observe a strong negative correlation between the number of generators and LCM-lattice density, abruptly separating three distinct regimes: a low-density Taylor-like regime, a high-density redundant regime, and a narrow transition window. We show that increasing the generator degree causes this density drop to occur at lower probability thresholds. We conclude by conjecturing that for equigenerated squarefree ideals, the LCM-lattice density undergoes a sharp phase transition, analogous to the emergence of giant components in hypergraphs. This suggests that the classical, ideal-by-ideal role of the LCM-lattice as a combinatorial invariant also admits a statistical/asymptotic counterpart: in natural random families, redundancy and resolution-complexity indicators concentrate into distinct typical regimes separated by a narrow transition window.

  • Open Access

    Computation of dominant ideals

    by Anna Maria Bigatti, Nursel Erey, Selvi Kara, Augustine O'Keefe, Sonja Petrović, Pierpaola Santarsiero, Janet Striuli

    We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common multiple of generators using combinatorial methods. Then, we adopt a probabilistic approach via the \er\ type model, examining both homogeneous and non-homogeneous cases. This model offers an efficient alternative to exhaustive enumeration, allowing the study of dominance through small random samples, even in high-dimensional settings.

  • Open Access

    My Academic Life -- A Poem

    by Sonja Petrovic

    By Sonja Petrovic, Published on 01/31/25

  • Open Access

    The Weak Lefschetz property and unimodality of Hilbert functions of random monomial algebras

    by Uwe Nagel, Sonja Petrović

    In this work, we investigate the presence of the weak Lefschetz property (WLP) and Hilbert functions for various types of random standard graded Artinian algebras. If an algebra has the WLP then its Hilbert function is unimodal. Using probabilistic models for random monomial algebras, our results and simulations suggest that in each considered regime the Hilbert functions of the produced algebras are unimodal with high probability. The WLP appears to be present with high probability most of the time. However, we propose that there is one scenario where the generated algebras fail to have the WLP with high probability.

  • Open Access

    New directions in algebraic statistics: Three challenges from 2023

    by Yulia Alexandr, Miles Bakenhus, Mark Curiel, Sameer K. Deshpande, Elizabeth Gross, Yuqi Gu, Max Hill, Joseph Johnson, Bryson Kagy, Vishesh Karwa, et al.

    In the last quarter of a century, algebraic statistics has established itself as an expanding field which uses multilinear algebra, commutative algebra, computational algebra, geometry, and combinatorics to tackle problems in mathematical statistics. These developments have found applications in a growing number of areas, including biology, neuroscience, economics, and social sciences. Naturally, new connections continue to be made with other areas of mathematics and statistics. This paper outlines three such connections: to statistical models used in educational testing, to a classification problem for a family of nonparametric regression models, and to phase transition phenomena under uniform sampling of contingency tables. We illustrate the motivating problems, each of which is for algebraic statistics a new direction, and demonstrate an enhancement of related methodologies.

  • Open Access

    Learning a performance metric of Buchberger's algorithm

    by Jelena Mojsilović, Dylan Peifer, Sonja Petrović

    What can be (machine) learned about the complexity of Buchberger's algorithm? Given a system of polynomials, Buchberger's algorithm computes a Gr\"obner basis of the ideal these polynomials generate using an iterative procedure based on multivariate long division. The runtime of each step of the algorithm is typically dominated by a series of polynomial additions, and the total number of these additions is a hardware independent performance metric that is often used to evaluate and optimize various implementation choices. In this work we attempt to predict, using just the starting input, the number of polynomial additions that take place during one run of Buchberger's algorithm. Good predictions are useful for quickly estimating difficulty and understanding what features make Gr\"obner basis computation hard. Our features and methods could also be used for value models in the reinforcement learning approach to optimize Buchberger's algorithm introduced in [Peifer, Stillman, and Halpern-Leistner, 2020]. We show that a multiple linear regression model built from a set of easy-to-compute ideal generator statistics can predict the number of polynomial additions somewhat well, better than an uninformed model, and better than regression models built on some intuitive commutative algebra invariants that are more difficult to compute. We also train a simple recursive neural network that outperforms these linear models. Our work serves as a proof of concept, demonstrating that predicting the number of polynomial additions in Buchberger's algorithm is a feasible problem from the point of view of machine learning.

  • DERGMs: Degeneracy-restricted exponential family random graph models

    by Vishesh Karwa, Sonja Petrović, Denis Bajić

    Exponential random graph models, or ERGMs, are a flexible and general class of models for modeling dependent data. While the early literature has shown them to be powerful in capturing many network features of interest, recent work highlights difficulties related to the models’ ill behavior, such as most of the probability mass being concentrated on a very small subset of the parameter space. This behavior limits both the applicability of an ERGM as a model for real data and inference and parameter estimation via the usual Markov chain Monte Carlo algorithms. To address this problem, we propose a new exponential family of models for random graphs that build on the standard ERGM framework. Specifically, we solve the problem of computational intractability and “degenerate” model behavior by an interpretable support restriction. We introduce a new parameter based on the graph-theoretic notion of degeneracy, a measure of sparsity whose value is commonly low in real-world networks. The new model family is supported on the sample space of graphs with bounded degeneracy and is called degeneracy-restricted ERGMs, or DERGMs for short. Since DERGMs generalize ERGMs—the latter is obtained from the former by setting the degeneracy parameter to be maximal—they inherit good theoretical properties, while at the same time place their mass more uniformly over realistic graphs. The support restriction allows the use of new (and fast) Monte Carlo methods for inference, thus making the models scalable and computationally tractable. We study various theoretical properties of DERGMs and illustrate how the support restriction improves the model behavior. We also present a fast Monte Carlo algorithm for parameter estimation that avoids many issues faced by Markov Chain Monte Carlo algorithms used for inference in ERGMs.


  • Open Access

    Editorial: A new beginning

    by Thomas Kahle, Sonja Petrović

    Algebraic statistics and Algebraic Statistics The creation of a field that bridges two disparate areas takes both ingenuity and the ability to generate excitement about new interdisciplinary ideas. For that field to continuously evolve over two decades, expanding to include virtually every aspect of the ground fields, as well as a growing number of neighboring research areas, takes a continued and dedicated community effort. Algebraic Statistics (AStat) is being established as a journal to be run by and devoted to such a community, representing interdisciplinary researchers in the field coming from all backgrounds. While algebra has always played a prominent role in statistics, the publication of a couple of seminal works in the late 1990s defined the new direction by connecting modern computational algebraic geometry and commutative algebra to two critical problems in statistics: sampling from discrete conditional distributions [3] and experimental design [7]. With the onset of the 2000s, the use of these techniques in statistics really took off, generating a large body of research papers and several textbooks [1; 2; 4; 5; 6; 8; 9]. In the last decade, the field has seen a massive influx of new people bringing new ideas and perspectives to problems at the intersection of nonlinear algebra, interpreted in broadest possible sense, and statistics. The term "algebraic statistics" has thus evolved in meaning to include an ever-expanding list of topics. We understand it as an umbrella term for using algebra (multilinear algebra, commutative algebra, and computational algebra), geometry and combinatorics to obtain insights in mathematical statistics as well as for diverse applications of these tools to data science. The community of algebraic statisticians is quite an active one, organizing many conferences, symposia, seminars, and special sessions at regional and international meetings, and striving for involvement and representation within both nonlinear algebra and statistics. The predecessor community-run journal, which existed for a decade and published ten volumes, has now been discontinued due to a dispute in ownership with a third party interested in a profit oriented future for the journal. The core of the algebraic statistics community strongly supports the establishment of this new journal. It is a leap forward, a fresh start that takes into account historical lessons learned and seeks to grow and expand the research scope. For this endeavor, we are happy to team up with MSP as a publishing partner that is committed to support academic scholarship and to ensuring the long-term success of our research community.