{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:53Z","timestamp":1753893833170,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We propose the following model of a random graph on $n$ vertices. Let $F$ be a distribution in $R_+^{n(n-1)\/2}$ with a coordinate for every pair $ij$ with $1 \\le i,j \\le n$. Then $G_{F,p}$ is the distribution on graphs with $n$ vertices obtained by picking a random point $X$ from $F$ and defining a graph on $n$ vertices whose edges are pairs $ij$ for which $X_{ij} \\le p$. The standard Erd\u0151s-R\u00e9nyi model is the special case when $F$ is uniform on the $0$-$1$ unit cube.  We examine basic properties such as the connectivity threshold for quite general distributions. We also consider cases where the $X_{ij}$ are the edge weights in some random instance of a combinatorial optimization problem. By choosing suitable distributions, we can capture random graphs with interesting properties such as triangle-free random graphs and weighted random graphs with bounded total weight.<\/jats:p>","DOI":"10.37236\/380","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:10:56Z","timestamp":1578697856000},"source":"Crossref","is-referenced-by-count":1,"title":["Logconcave Random Graphs"],"prefix":"10.37236","volume":"17","author":[{"given":"Alan","family":"Frieze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Vera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2010,8,9]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1r108\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1r108\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T18:28:08Z","timestamp":1579285688000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v17i1r108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,9]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2010,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/380","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2010,8,9]]},"article-number":"R108"}}