IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2009-05-26 10:05
A Tight Upper Bound on the Hitting and the Cover times of Metropolis Walks
Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ) COMP2009-10
Abstract (in Japanese) (See Japanese page) 
(in English) andom walks on finite graphs are random token circulation on graphs. Random walks such that token moves to adjacent vertices with uniformprobability are called standard random walk. For any graph with $n$ vertices, the hitting time and the cover times of standard random walk are bounded by $O(n^3)$. In this report, we would like to show the hitting and the cover times of Metropolis walks are bounded by $O(fn^2)$ and $O(fn^2\log n)$ respectively. Where, $f$ is the maximum ratio of stationary distribution.
Keyword (in Japanese) (See Japanese page) 
(in English) random walk / hitting time / cover time / Metropolis-Hastings algorithm / Markov chain / / /  
Reference Info. IEICE Tech. Rep., vol. 109, no. 54, COMP2009-10, pp. 9-12, May 2009.
Paper # COMP2009-10 
Date of Issue 2009-05-19 (COMP) 
ISSN Print edition: ISSN 0913-5685  Online edition: ISSN 2432-6380
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2009-10

Conference Information
Committee COMP  
Conference Date 2009-05-26 - 2009-05-26 
Place (in Japanese) (See Japanese page) 
Place (in English) Saitama Univ. 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2009-05-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A Tight Upper Bound on the Hitting and the Cover times of Metropolis Walks 
Sub Title (in English)  
Keyword(1) random walk  
Keyword(2) hitting time  
Keyword(3) cover time  
Keyword(4) Metropolis-Hastings algorithm  
Keyword(5) Markov chain  
1st Author's Name Yoshiaki Nonaka  
1st Author's Affiliation Kyushu University (Kyushu Univ)
2nd Author's Name Hirotaka Ono  
2nd Author's Affiliation Kyushu University (Kyushu Univ)
3rd Author's Name Kunihiko Sadakane  
3rd Author's Affiliation Kyushu University (Kyushu Univ)
4th Author's Name Masafumi Yamashita  
4th Author's Affiliation Kyushu University (Kyushu Univ)
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Date Time 2009-05-26 10:05:00 
Presentation Time 35 
Registration for COMP 
Paper # IEICE-COMP2009-10 
Volume (vol) IEICE-109 
Number (no) no.54 
Page pp.9-12 
#Pages IEICE-4 
Date of Issue IEICE-COMP-2009-05-19 

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan