{"id":102910,"updated":"2025-01-21T10:38:27.318347+00:00","links":{},"created":"2025-01-18T23:48:01.532520+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00102910","sets":["1164:2592:7425:7658"]},"path":["7658"],"owner":"11","recid":"102910","title":["多項式時間決定的サンプラーの頂点誤差解析"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-09-05"},"_buckets":{"deposit":"6974bbbb-b840-4fe5-a38f-e5a5f370541d"},"_deposit":{"id":"102910","pid":{"type":"depid","value":"102910","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"多項式時間決定的サンプラーの頂点誤差解析","author_link":["0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"多項式時間決定的サンプラーの頂点誤差解析"}]},"item_type_id":"4","publish_date":"2014-09-05","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学"},{"subitem_text_value":"九州大学"},{"subitem_text_value":"九州大学"},{"subitem_text_value":"九州大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Kyushu University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/102910/files/IPSJ-AL14149004.pdf"},"date":[{"dateType":"Available","dateValue":"2016-09-05"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL14149004.pdf","filesize":[{"value":"221.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"adbb3f5b-98b0-4077-a4e4-fcfe542a1756","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"白髪丈晴"},{"creatorName":"山内由紀子"},{"creatorName":"来嶋秀治"},{"creatorName":"山下雅史"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"マルコフ連鎖モンテカルロ法 (MCMC 法) とは，マルコフ連鎖をシミュレートすることで所望の分布からサンプリングを行う手法である．本稿ではロータールーターモデル (Propp 機械) など 「ランダムウォークの脱乱択化」 に関する研究を応用し，マルコフ連鎖を模倣する決定的サンプリングアルゴリズムを提案する．そして，決定的サンプリングアルゴリズムと対応するマルコフ連鎖の分布の頂点誤差 (L∞ 距離) の解析を行い，マルコフ連鎖の混交時間に関する上界を与える．この上界を用いて，0-1 ナップサック解，線形順序拡大，マッチングなどの一様分布に急速混交するマルコフ連鎖が知られるいくつかの #P 完全問題に対し，決定的サンプリングアルゴリズムが所望の分布と頂点誤差が ε 以下の分布を，入力と ε-1 の多項式時間で出力する事を示す．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2014-09-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"2014-AL-149"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}