On the total variation distance between the binomial random graph and the random intersection graph

DOI10.1002/rsa.20750zbMath1441.05203arXiv1506.03389OpenAlexW2963048268MaRDI QIDQ4584914

Sang June Lee, Joohan Na, Jeong Han Kim

Publication date: 5 September 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.03389

zbMATH Keywords

intersection graphtotal variation distancebinomial random graphrandom intersection graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (5)

Central limit theorem for the largest component of random intersection graph ⋮ MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems ⋮ Selected combinatorial problems through the prism of random intersection graphs models ⋮ The number of triangles in random intersection graphs ⋮ Phase transitions for detecting latent geometry in random graphs

This page was built for publication: On the total variation distance between the binomial random graph and the random intersection graph