Igor Rivin
Published 2019-10-18Version 1
We use the order complex corresponding to a symmetric matrix (defined by Giusti et al in 2015). In this note, we use it to define a class of models of random graphs, and show some surprising experimental results, showing sharp phase transitions.
On the modularity of 3-regular random graphs and random graphs with given degree sequences
Thresholds for contagious sets in random graphs
Epidemics on random graphs with tunable clustering
![QR code for arXiv:1910.08253 [math.PR]](http://oss.arxitics.com/images/favicon.svg)