Random Algebraic Graphs and Their Convergence to Erdos-Renyi

Kiril Bangachev, Guy Bresler

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma :G⟶[0,1]$ with expectation $p,$ satisfying $\sigma (g)=\sigma (g^{-1}).$…