{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T23:44:43Z","timestamp":1743551083466},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403279"},{"type":"electronic","value":"9783642403286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_35","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T13:17:34Z","timestamp":1376659054000},"page":"497-512","source":"Crossref","is-referenced-by-count":1,"title":["Connectivity of Random High Dimensional Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Roee","family":"David","sequence":"first","affiliation":[]},{"given":"Uriel","family":"Feige","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Benjamini, I., Stacey, A.: Percolation on finite graphs and isoperimetric inequalities. Annals of Probability, 1727\u20131745 (2004)","DOI":"10.1214\/009117904000000414"},{"issue":"4","key":"35_CR2","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S0167-7152(02)00233-X","volume":"60","author":"M.J.B. Appel","year":"2002","unstructured":"Appel, M.J.B., Russo, R.P.: The connectivity of a graph on uniform points on [0, 1] d . Statistics & Probability Letters\u00a060(4), 351\u2013357 (2002)","journal-title":"Statistics & Probability Letters"},{"issue":"2","key":"35_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.ejc.2008.07.001","volume":"30","author":"S. Ben-Shimon","year":"2009","unstructured":"Ben-Shimon, S., Krivelevich, M.: Vertex percolation on expander graphs. European Journal of Combinatorics\u00a030(2), 339\u2013350 (2009)","journal-title":"European Journal of Combinatorics"},{"key":"35_CR4","unstructured":"David, R.: Finding planted k-coloring in vector k-colorable graphs. MSC Thesis, Weizmann Institute (2013), http:\/\/www.wisdom.weizmann.ac.il\/~feige\/TechnicalReports\/RoeeDavidThesis.pdf"},{"key":"35_CR5","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erdos","year":"1959","unstructured":"Erdos, P., Renyi, A.: On random graphs I. Publ. Math. Debrecen\u00a06, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Feige, Langberg, Schechtman: Graphs with tiny vector chromatic numbers and huge chromatic numbers. SICOMP: SIAM Journal on Computing 33 (2004)","DOI":"10.1137\/S0097539703431391"},{"issue":"3","key":"35_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1002\/rsa.10036","volume":"20","author":"U. Feige","year":"2002","unstructured":"Feige, U., Schechtman, G.: On the optimality of the random hyperplane rounding technique for max cut. Random Structures & Algorithms\u00a020(3), 403\u2013440 (2002)","journal-title":"Random Structures & Algorithms"},{"issue":"1-2","key":"35_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<137::AID-RSA9>3.0.CO;2-Y","volume":"9","author":"E. Godehardt","year":"1996","unstructured":"Godehardt, E., Jaworski, J.: On the connectivity of a random interval graph. Random Structures & Algorithms\u00a09(1-2), 137\u2013161 (1996)","journal-title":"Random Structures & Algorithms"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Goel, A., Rai, S., Krishnamachari, B.: Sharp thresholds for monotone properties in random geometric graphs. In: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, pp. 580\u2013586. ACM (2004)","DOI":"10.1145\/1007352.1007441"},{"issue":"6","key":"35_CR10","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM)\u00a042(6), 1115\u20131145 (1995)","journal-title":"Journal of the ACM (JACM)"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Grimmett, G.: What is Percolation? Springer (1999)","DOI":"10.1007\/978-3-662-03981-6"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: Stochastic Analysis, Control, Optimization and Applications, pp. 547\u2013566. Springer (1998)","DOI":"10.1007\/978-1-4612-1784-8_33"},{"issue":"2","key":"35_CR13","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/274787.274791","volume":"45","author":"D. Karger","year":"1998","unstructured":"Karger, D., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. Journal of the ACM (JACM)\u00a045(2), 246\u2013265 (1998)","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"35_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.3923\/ajms.2011.66.70","volume":"4","author":"S. Li","year":"2011","unstructured":"Li, S.: Concise formulas for the area and volume of a hyperspherical cap. Asian Journal of Mathematics and Statistics\u00a04(1), 66\u201370 (2011)","journal-title":"Asian Journal of Mathematics and Statistics"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Meester, R., Roy, R.: Continuum percolation. Cambridge tracts in mathematics, vol.\u00a0119 (1996)","DOI":"10.1017\/CBO9780511895357"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Penrose, M.D.: Random geometric graphs (2003)","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"issue":"2","key":"35_CR17","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1214\/aoap\/1034968142","volume":"6","author":"M.D. Penrose","year":"1996","unstructured":"Penrose, M.D.: Continuum percolation and euclidean minimal spanning trees in high dimensions. The Annals of Applied Probability\u00a06(2), 528\u2013544 (1996)","journal-title":"The Annals of Applied Probability"},{"issue":"4","key":"35_CR18","doi-asserted-by":"publisher","first-page":"1903","DOI":"10.1214\/aop\/1041903210","volume":"24","author":"M.D. Penrose","year":"1996","unstructured":"Penrose, M.D.: The random minimal spanning tree in high dimensions. The Annals of Probability\u00a024(4), 1903\u20131925 (1996)","journal-title":"The Annals of Probability"},{"issue":"2","key":"35_CR19","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1214\/aoap\/1034625335","volume":"7","author":"M.D. Penrose","year":"1997","unstructured":"Penrose, M.D.: The longest edge of the random minimal spanning tree. Ann. Appl. Probab.\u00a07(2), 340\u2013361 (1997)","journal-title":"Ann. Appl. Probab."}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40328-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T22:34:00Z","timestamp":1688423640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}