2020
DOI: 10.48550/arxiv.2007.08869
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Edge ideals of Erdös-Rényi random graphs : Linear resolution, unmixedness and regularity

Abstract: We study the homological algebra of edge ideals of Erdös-Rényi random graphs. These random graphs are generated by deleting edges of a complete graph on n vertices independently of each other with probability 1 − p. We focus on three aspects of these random edge ideals -linear resolution, unmixedness and Castelnuovo-Mumford regularity. We first show a double phase transition for existence of linear presentation and resolution and determine the critical windows as well. As a consequence, we obtain that except f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…Their construction is similar to that of Erdős-Rényi random graphs, and under certain parameters can recover our model. In a recent paper of Banerjee and Yogeshwaran [7] it is shown that the threshold for a coedge ideal to have a linear resolution coincides with the threshold for the ideal to have a linear presentation. They also establish precise threshold results regarding regularity for the case that reg(I G ) = 2.…”
Section: Introductionmentioning
confidence: 94%
See 1 more Smart Citation
“…Their construction is similar to that of Erdős-Rényi random graphs, and under certain parameters can recover our model. In a recent paper of Banerjee and Yogeshwaran [7] it is shown that the threshold for a coedge ideal to have a linear resolution coincides with the threshold for the ideal to have a linear presentation. They also establish precise threshold results regarding regularity for the case that reg(I G ) = 2.…”
Section: Introductionmentioning
confidence: 94%
“…This implies that, unlike the sparse regime we consider here, R/I G will have more than one extremal Betti number when G ∼ G(n, p) and p is a constant. In addition, the regime p = 1 − λ/n for λ constant is considered in [7], where they establish results about the regularity of R/I G and prove it is order Θ(n).…”
Section: Now Let S Be a Fixed Set Ofmentioning
confidence: 99%
“…There are more recent interesting results on resolutions of ideals of random graphs, see for example [2,4,5,13,9,8,20].…”
Section: Relation To Papers On Edge Ideals Of Random Graphsmentioning
confidence: 99%