{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T07:40:40Z","timestamp":1693554040357},"reference-count":18,"publisher":"Wiley","issue":"2-3","license":[{"start":{"date-parts":[[2007,7,5]],"date-time":"2007-07-05T00:00:00Z","timestamp":1183593600000},"content-version":"vor","delay-in-days":4509,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1995,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The random graph order <jats:italic>P<jats:sub>n<\/jats:sub> <jats:sub>p<\/jats:sub><\/jats:italic> is defined by taking a random graph <jats:italic>G<jats:sub>n<\/jats:sub> <jats:sub>p<\/jats:sub><\/jats:italic> on vertex set [n], interpreting an edge between vertices <jats:italic>i and j<\/jats:italic>, with <jats:italic>i &lt;j<\/jats:italic> in <jats:italic>[n]<\/jats:italic>, as a relation <jats:italic>i &lt;j<\/jats:italic>, and taking the transitive closure. We present a first\u2014order property <jats:italic>\ud835\udcc1<\/jats:italic> of <jats:italic>P<jats:sub>n<\/jats:sub> <jats:sub>p<\/jats:sub><\/jats:italic> such that the limiting probability of <jats:italic>\ud835\udcc1.<\/jats:italic> is bounded away from both 0 and 1 as <jats:italic>n<\/jats:italic> \u2192 \u221e, whenever <jats:italic>pn<\/jats:italic> is bounded away from 0 and <jats:italic>p<\/jats:italic> is bounded away from 1. \u00a9 1995 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/rsa.3240060211","type":"journal-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T06:15:42Z","timestamp":1278915342000},"page":"231-238","source":"Crossref","is-referenced-by-count":0,"title":["Random graph orders do not satisfy a 0\u20131 law"],"prefix":"10.1002","volume":"6","author":[{"given":"Graham","family":"Brightwell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,7,5]]},"reference":[{"key":"e_1_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00341633"},{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005202"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0605049"},{"key":"e_1_2_1_4_2","first-page":"xv","volume-title":"Random Graphs","author":"Bollob\u00e1s B.","year":"1985"},{"key":"e_1_2_1_5_2","unstructured":"B.Bollob\u00e1sandG.Brightwell The width of random graph orders submitted."},{"key":"e_1_2_1_6_2","author":"Bollob\u00e1s B.","journal-title":"The dimension of random graph orders"},{"key":"e_1_2_1_7_2","unstructured":"B.Bollob\u00e1sandG.Brightwell The structure of random graph orders submitted."},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"K.Compton 0\u20131 laws in logic and combinatorics inProc. NATO Advanced Study Institute on Algorithms and Order I. Rival Ed. Dordrecht 1988 pp.353\u2013383.","DOI":"10.1007\/978-94-009-2639-4_10"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020306"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.2307\/2272945"},{"key":"e_1_2_1_11_2","first-page":"17","article-title":"Range and degree of realizability of formulas in the restricted predicate calculus","volume":"2","author":"Glebskii Y. V.","year":"1969","journal-title":"Kibernetika (Kiev)"},{"key":"e_1_2_1_11_3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01071084"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00383450"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030304"},{"key":"e_1_2_1_14_2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1090\/S0894-0347-1988-0924703-8","article-title":"Zero\u2010one laws for sparse random graphs","volume":"1","author":"Shelah S.","year":"1988","journal-title":"J. Am. Math. Soc."},{"key":"e_1_2_1_15_2","article-title":"Random sparse unary predicates","author":"Shelah S.","journal-title":"Random Struct. Alg."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(91)90048-2"},{"key":"e_1_2_1_17_2","series-title":"NATO Advanced Science Institutes Series","volume-title":"Random structures and 0\u20101 laws, in Finite and Infinite Combinatorics of Sets and Logic","author":"Winkler P. M."}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240060211","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240060211","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240060211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T04:08:28Z","timestamp":1693454908000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240060211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["10.1002\/rsa.3240060211"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240060211","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}