{"id":86133,"updated":"2025-01-21T17:48:19.969753+00:00","links":{},"created":"2025-01-18T23:37:33.462171+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00086133","sets":["1164:2592:6670:6899"]},"path":["6899"],"owner":"11","recid":"86133","title":["無理数遷移確率ランダムウォークの脱乱択化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-10-26"},"_buckets":{"deposit":"7ab32e5d-8759-46f0-9361-777d3df6791d"},"_deposit":{"id":"86133","pid":{"type":"depid","value":"86133","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"無理数遷移確率ランダムウォークの脱乱択化","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"無理数遷移確率ランダムウォークの脱乱択化"},{"subitem_title":"Deterministic Random Walks for Irrational Transition Probabilities","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2012-10-26","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/86133/files/IPSJ-AL12142002.pdf"},"date":[{"dateType":"Available","dateValue":"2014-10-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL12142002.pdf","filesize":[{"value":"173.7 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":"576fefbc-7c81-465b-b38c-a81ebc09efd3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 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_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takeharu, Shiraga","creatorNameLang":"en"},{"creatorName":"Yukiko, Yamauchi","creatorNameLang":"en"},{"creatorName":"Shuji, Kijima","creatorNameLang":"en"},{"creatorName":"Masafumi, Yamashita","creatorNameLang":"en"}],"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":"ランダムウォークの脱乱択化とは，決定的な過程によってランダムウォークを模倣する試みであり，ロータールーターモデルと呼ばれるモデルが提案されている．グラフ上の頂点をトークンがランダムに隣接点へ移動するランダムウォークに対して，ロータールーターモデルでは，グラフの各頂点上にあらかじめ隣接点の順番を決め，その順番に従ってトークンを移動させる．従来のロータールーターモデルは有理数の遷移確率しか模倣することが出来なかったが，本稿では無理数の遷移確率をもつランダムウォークも模倣出来る新しいロータールーターモデルを提案する．さらに，ランダムウォークにおけるトークンの期待配置と提案モデルにおけるトークンの配置の誤差の上下界の解析を与える．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The rotor-router model, a.k.a. the deterministic random walk, is a deterministic process possibly emulating a random walk. In a random walk, tokens move to adjacent vertices at random. In the classical rotor-router model, every vertex launches tokens into adjacent vertices according do a prescribed order defined for each vertex, thus the rotor-router model cannot handle irrational transition probabilities. In this paper, we devise a new model, which can handle irrational transition probabilities. Then, we analyze the difference between the number of tokens in our rotor-router model and the expected number of tokens in a random walk.","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":"2012-10-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"2012-AL-142"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}