对凸体中采样点程序的初步分析

Random Struct. Algorithms Pub Date : 1998-05-01 DOI:10.1002/(SICI)1098-2418(199805)12:3%3C213::AID-RSA1%3E3.0.CO;2-Y

Russ Bubley, M. Dyer, M. Jerrum

{"title":"对凸体中采样点程序的初步分析","authors":"Russ Bubley, M. Dyer, M. Jerrum","doi":"10.1002/(SICI)1098-2418(199805)12:3%3C213::AID-RSA1%3E3.0.CO;2-Y","DOIUrl":null,"url":null,"abstract":"In this paper we describe a new method for proving the polynomial-time convergence of an algorithm for sampling (almost) uniformly at random from a convex body in high dimension. Previous approaches have been based on estimating conductance via isoperimetric inequalities. We show that a more elementary coupling argument can be used to give a similar result. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 213–235, 1998","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"An elementary analysis of a procedure for sampling points in a convex body\",\"authors\":\"Russ Bubley, M. Dyer, M. Jerrum\",\"doi\":\"10.1002/(SICI)1098-2418(199805)12:3%3C213::AID-RSA1%3E3.0.CO;2-Y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we describe a new method for proving the polynomial-time convergence of an algorithm for sampling (almost) uniformly at random from a convex body in high dimension. Previous approaches have been based on estimating conductance via isoperimetric inequalities. We show that a more elementary coupling argument can be used to give a similar result. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 213–235, 1998\",\"PeriodicalId\":303496,\"journal\":{\"name\":\"Random Struct. Algorithms\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Struct. Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1098-2418(199805)12:3%3C213::AID-RSA1%3E3.0.CO;2-Y\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1098-2418(199805)12:3%3C213::AID-RSA1%3E3.0.CO;2-Y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 19

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

An elementary analysis of a procedure for sampling points in a convex body

In this paper we describe a new method for proving the polynomial-time convergence of an algorithm for sampling (almost) uniformly at random from a convex body in high dimension. Previous approaches have been based on estimating conductance via isoperimetric inequalities. We show that a more elementary coupling argument can be used to give a similar result. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 213–235, 1998

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Random Struct. Algorithms

自引率

0.00%

发文量

期刊最新文献

Monochromatic paths in random tournaments On Generalized Independent Subsets of Trees Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices On the effect of selection in genetic algorithms The Boyer-Moore-Horspool heuristic with Markovian input