Super-logarithmic cliques in dense inhomogeneous random graphs

11 Mar 2019 McKinley Gweneth

In the theory of dense graph limits, a graphon is a symmetric measurable function $W:[0,1]^2\to [0,1]$. Each graphon gives rise naturally to a random graph distribution, denoted $\mathbb{G}(n,W)$, that can be viewed as a generalization of the Erd\H{o}s-R\'enyi random graph... (read more)

PDF Abstract
No code implementations yet. Submit your code now