{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:44:18Z","timestamp":1648536258745},"reference-count":4,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"unspecified","delay-in-days":5855,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[1992,9]]},"abstract":"<jats:p>We consider a random digraph <jats:italic>D<jats:sub>in, out<\/jats:sub><\/jats:italic>(<jats:italic>n<\/jats:italic>) on vertices 1, \u2026, <jats:italic>n<\/jats:italic>, where, for each vertex <jats:italic>v<\/jats:italic>, we choose at random one of the <jats:italic>n<\/jats:italic> possible arcs with head <jats:italic>v<\/jats:italic> and one of the <jats:italic>n<\/jats:italic> possible arcs with tail <jats:italic>v<\/jats:italic>. We show that the expected size of the largest component of <jats:italic>D<jats:sub>in, out<\/jats:sub><\/jats:italic> is <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S0963548300000298inline1\" \/>.<\/jats:p>","DOI":"10.1017\/s0963548300000298","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T11:19:03Z","timestamp":1221218343000},"page":"265-274","source":"Crossref","is-referenced-by-count":1,"title":["The Strongly Connected Components of 1-in, 1-out"],"prefix":"10.1017","volume":"1","author":[{"given":"B.","family":"Reed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"McDiarmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"S0963548300000298_ref004","volume-title":"Surveys in Combinatorics 1989","author":"McDiarmid","year":"1989"},{"key":"S0963548300000298_ref002","volume-title":"Introduction to Probability Theory and its Applications","volume":"1","author":"Feller","year":"1968"},{"key":"S0963548300000298_ref001","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90134-L"},{"key":"S0963548300000298_ref003","volume-title":"Random Mappings","author":"Kolchin","year":"1986"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548300000298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T20:51:36Z","timestamp":1558039896000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548300000298\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["S0963548300000298"],"URL":"https:\/\/doi.org\/10.1017\/s0963548300000298","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}