A Note on Log-Concave Random Graphs

  • Alan Frieze
  • Tomasz Tkocz

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.

Published
2019-08-30
Article Number
P3.36