Random flag complexes and asymptotic syzygies (Q1755591)

Let \(G \sim G(n,p)\) denote an Erdős-Rényi random graph on \(n\) vertices, where each edge is attached with probability \(p\). We turn \(G\) into a flag complex by adjoining a \(q\)-simplex to every \((q+1)\)-clique in the graph, and \(\Delta \sim \Delta(n,p)\) denotes a flag complex chosen with respect to this distribution. From \(\Delta\) Stanley-Reisner theory yields a squarefree monomial ideal \(I_{\Delta} \subseteq K[x_{1},x_{2},\ldots,x_{n}]\). By using probabilistic techniques to analyze the syzygies of \(I_{\Delta}\), the authors produce examples of \textit{L. Ein} and \textit{R. Lazarsfeld}'s [Invent. Math. 190, No. 3, 603--646 (2012; Zbl 1262.13018)] nonvanishing for asymptotic syzygies and of Ein, Erman, and Lazarsfeld's conjecture on how asymptotic Betti numbers behave like binomial coefficients [\textit{L. Ein} et al., J. Reine Angew. Math. 702, 55--75 (2015; Zbl 1338.13023)].