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.
@article{10_37236_7952,
author = {Alan Frieze and Tomasz Tkocz},
title = {A note on log-concave random graphs},
journal = {The electronic journal of combinatorics},
year = {2019},
volume = {26},
number = {3},
doi = {10.37236/7952},
zbl = {1419.05193},
url = {http://geodesic.mathdoc.fr/articles/10.37236/7952/}
}
TY - JOUR
AU - Alan Frieze
AU - Tomasz Tkocz
TI - A note on log-concave random graphs
JO - The electronic journal of combinatorics
PY - 2019
VL - 26
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/7952/
DO - 10.37236/7952
ID - 10_37236_7952
ER -
%0 Journal Article
%A Alan Frieze
%A Tomasz Tkocz
%T A note on log-concave random graphs
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/7952/
%R 10.37236/7952
%F 10_37236_7952
Alan Frieze; Tomasz Tkocz. A note on log-concave random graphs. The electronic journal of combinatorics, Tome 26 (2019) no. 3. doi: 10.37236/7952