A note on log-concave random graphs
Combinatorics
2020-12-03 v1
Abstract
We establish a threshold for the connectivity of certain random graphs whose (dependent) edges are determined by the uniform distributions on generalized Orlicz balls, crucially using their negative correlation properties. We also show the existence of a unique giant component for such random graphs.
Cite
@article{arxiv.1806.08201,
title = {A note on log-concave random graphs},
author = {Alan Frieze and Tomasz Tkocz},
journal= {arXiv preprint arXiv:1806.08201},
year = {2020}
}