On the density of triangles and squares in regular finite and unimodular random graphs (Q485502): Difference between revisions

The authors explicitly describe the possible pairs of triangle and square densities for \(r\)-regular finite simple graphs. Further, they also prove that every \(r\)-regular unimodular random graph can be approximated by \(r\)-regular finite graphs with respect to these densities. As a corollary, one gets an explicit description of the possible pairs of the third and fourth moments of the spectral measure of \(r\)-regular unimodular random graphs. The study of unimodular random graphs was initiated by \textit{D. Aldous} and \textit{R. Lyons} [Electron. J. Probab. 12, 1454-1508 (2007; Zbl 1131.60003)].