{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:29:38Z","timestamp":1767007778357},"reference-count":6,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"unspecified","delay-in-days":4669,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[1995,12]]},"abstract":"<jats:p>Model 1. Consider the complete graph <jats:italic>K<jats:sub>n<\/jats:sub><\/jats:italic>, with vertex set [n] = {1, 2,\u2026, <jats:italic>n<\/jats:italic>}, in which each edge <jats:italic>e<\/jats:italic> is assigned a length <jats:italic>X<\/jats:italic><jats:sub>e<\/jats:sub>. Colour the <jats:italic>k<\/jats:italic> shortest edges incident with each vertex green and the remaining edges blue. The graph made up of the green edges only, will be referred to as the <jats:italic>k-th nearest neighbour graph<\/jats:italic>. This graph has been studied in a variety of contexts both computational and statistical.<\/jats:p>","DOI":"10.1017\/s0963548300001711","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T07:13:24Z","timestamp":1221203604000},"page":"343-362","source":"Crossref","is-referenced-by-count":10,"title":["On the Connectivity of Random <i>k<\/i>-th Nearest Neighbour Graphs"],"prefix":"10.1017","volume":"4","author":[{"given":"Colin","family":"Cooper","sequence":"first","affiliation":[]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"S0963548300001711_ref004","first-page":"91","volume-title":"Random Graphs","volume":"2","author":"Holst","year":"1992"},{"key":"S0963548300001711_ref002","volume-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"S0963548300001711_ref005","first-page":"148","volume-title":"LMS Surveys in Combinatorics","author":"McDiarmid","year":"1989"},{"key":"S0963548300001711_ref006","doi-asserted-by":"publisher","DOI":"10.1017\/S0001867800021583"},{"key":"S0963548300001711_ref001","volume-title":"The Probabilistic Method","author":"Alon","year":"1991"},{"key":"S0963548300001711_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/BF02066689"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548300001711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:06:58Z","timestamp":1557763618000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548300001711\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["S0963548300001711"],"URL":"https:\/\/doi.org\/10.1017\/s0963548300001711","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}