Probabilities of random monomial ideals associated to large graphs

Abstract

Inspired by the Erdős Rényi model, we propose a new model for freesquare random monomial ideals generated by edges and covers of a graph. This permit us to investigate the conditions of normality for which we obtain asymptotic results. We also elaborate on asymptotic results for other invariants such as the Krull dimension (for which we obtain threshold function), the regularity and the $v$-number.

24 pages, 6 figures