{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T15:22:30Z","timestamp":1751124150514},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853626"},{"type":"electronic","value":"9783540853633"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85363-3_42","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T19:29:28Z","timestamp":1219865368000},"page":"535-548","source":"Crossref","is-referenced-by-count":6,"title":["Sampling Hypersurfaces through Diffusion"],"prefix":"10.1007","author":[{"given":"Hariharan","family":"Narayanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha","family":"Niyogi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","series-title":"Mathematical Sciences Research Institute Publications","first-page":"1","volume-title":"An Elementary Introduction to Modern Convex Geometry","author":"K. Ball","year":"1997","unstructured":"Ball, K.: An Elementary Introduction to Modern Convex Geometry. Mathematical Sciences Research Institute Publications, vol.\u00a031, pp. 1\u201358. Cambridge Univ. Press, Cambridge (1997)"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01425510","volume":"30","author":"C. Borell","year":"1975","unstructured":"Borell, C.: The Brunn-Minkowski inequality in Gauss space. Inventiones Math.\u00a030, 205\u2013216 (1975)","journal-title":"Inventiones Math."},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Belkin, M., Narayanan, H., Niyogi, P.: Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body. In: Proc. of the 44th IEEE Foundations of Computer Science (FOCS 2006) (2006)","DOI":"10.1109\/FOCS.2006.34"},{"issue":"4","key":"42_CR4","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1145\/1008731.1008733","volume":"51","author":"D. Bertsimas","year":"2004","unstructured":"Bertsimas, D., Vempala, S.: Solving convex programs by random walks. Journal of the ACM (JACM)\u00a051(4), 540\u2013556 (2004); Proc. of the 34th ACM Symposium on the Theory of Computing (STOC 2002), Montreal (2002)","journal-title":"Journal of the ACM (JACM)"},{"key":"42_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.acha.2006.04.006","volume":"21","author":"R.R. Coifman","year":"2006","unstructured":"Coifman, R.R., Lafon, S.: \u201cDiffusion maps\u201d. Applied and Computational Harmonic Analysis: Special issue on Diffusion Maps and Wavelets\u00a021, 5\u201330 (2006)","journal-title":"Applied and Computational Harmonic Analysis: Special issue on Diffusion Maps and Wavelets"},{"key":"42_CR6","unstructured":"Diaconis, P.: Generating random points on a Manifold, Berkeley Probability Seminar (Talk based on joint work with S. Holmes and M. Shahshahani)"},{"key":"42_CR7","unstructured":"Diaconis, P.: Personal Communication"},{"key":"42_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"M. Dyer","year":"1991","unstructured":"Dyer, M., Frieze, A., Kannan, R.: A random polynomial time algorithm for approximating the volume of convex sets. Journal of the Association for Computing Machinary\u00a038, 1\u201317 (1991)","journal-title":"Journal of the Association for Computing Machinary"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Vempala, S.: Hit-and-run from a corner. In: Proc. of the 36th ACM Symposium on the Theory of Computing, Chicago (2004)","DOI":"10.1145\/1007352.1007403"},{"key":"42_CR10","unstructured":"Lov\u00e1sz, L., Vempala, S.: Simulated annealing in convex bodies and an O *(n 4) volume algorithm. In: Proc. of the 44th IEEE Foundations of Computer Science (FOCS 2003), Boston (2003)"},{"issue":"2","key":"42_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/3214645","volume":"27","author":"P. Matthews","year":"1990","unstructured":"Matthews, P.: Mixing Rates for Brownian Motion in a Convex Polyhedron. Journal of Applied Probability\u00a027(2), 259\u2013268 (1990)","journal-title":"Journal of Applied Probability"},{"issue":"1","key":"42_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1214\/aop\/1176991894","volume":"16","author":"P. Matthews","year":"1988","unstructured":"Matthews, P.: Covering Problems for Brownian Motion on Spheres. Annals of Probability\u00a016(1), 189\u2013199 (1988)","journal-title":"Annals of Probability"},{"key":"42_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/b97315","volume-title":"Computational Homology","author":"T. Kaczynski","year":"2004","unstructured":"Kaczynski, T., Mischaikov, K., Mrozek, M.: Computational Homology. Springer, New York (2004); (Applied Math. Sci. 157)"},{"key":"42_CR14","unstructured":"Niyogi, P., Weinberger, S., Smale, S.: Finding the Homology of Submanifolds with High Confidence from Random Samples. Discrete and Computational Geometry (2004)"},{"key":"42_CR15","volume-title":"MSRI","author":"V.Y. Pan","year":"1998","unstructured":"Pan, V.Y., Chen, Z., Zheng, A.: The Complexity of the Algebraic Eigenproblem. Mathematical Sciences Research Institute, Berkeley (1998) (MSRI Preprint, 1998-71)"},{"issue":"1","key":"42_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1006\/jfan.1998.3384","volume":"164","author":"M. Rudelson","year":"1999","unstructured":"Rudelson, M.: Random vectors in the isotropic position. J. of Functional Analysis\u00a0164(1), 60\u201372 (1999); Encyclopedia of Mathematics and its Applications. Cambridge University Press (1993)","journal-title":"J. of Functional Analysis"},{"key":"42_CR17","unstructured":"Vempala, S.: Personal Communication"},{"issue":"2","key":"42_CR18","first-page":"247","volume":"33","author":"A. Zomorodian","year":"2004","unstructured":"Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete and Computational Geometry\u00a033(2), 247 (2004)","journal-title":"Discrete and Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85363-3_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:24:22Z","timestamp":1606184662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85363-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540853626","9783540853633"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85363-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}