Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
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 2021-09-08 10:30
Random Walk on Graphs with Vicinity Avoidance
Keita Kitaura, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-16
Abstract (in Japanese) (See Japanese page) 
(in English) A random walk on a graph is a mathematical mobility model that extends a random walk on a line or a plane to a graph. In recent years, several researches on random walks on a graph have been actively conducted, such as analyses of mathematical properties of a discrete random walk on a graph and its application to large-scale network exploration. The random walk on a graph has strong locality such that a mobile agent is likely to visit the same node multiple times in a short period of time. If the locality of the random walk on a graph can be mitigated, it is expected that the properties of the random walk (e.g., the average first passage time and the average cover time) can be improved. In this paper, we propose the Vicinity-Avoiding Random Walk, a mobility model based on the random walk with less locality without requiring a large amount of storage in the mobile agent. In addition, we investigate how much the Vicinity-Avoiding Random Walk reduces the average first passage time and the average cover time, which are typical measures of random walks, compared to the simple random walk and the non-backtracking random walk, through simulation experiments. We also analiticaliy investigate the effectiveness of Vicinity-Avoiding Random Walk in comparison with a similar method, non-backtracking random walk in terms of the average first passage time in graphs with community structure. Furthermore, we will also investigate the impact of the community structure of a graph on random walks through a numerical example as well as the validity of our analysis.
Keyword (in Japanese) (See Japanese page) 
(in English) Random Walk / Locality / Average first passage time / Average cover time / / / /  
Reference Info. IEICE Tech. Rep., vol. 121, no. 167, IA2021-16, pp. 7-13, Sept. 2021.
Paper # IA2021-16 
Date of Issue 2021-09-01 (IA) 
ISSN Online edition: ISSN 2432-6380
Copyright
and
reproduction		 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 IA2021-16

Conference Information
Committee IA  
Conference Date 2021-09-08 - 2021-09-08 
Place (in Japanese) (See Japanese page) 
Place (in English) Online 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Internet Operation and Management, etc. 
Paper Information
Registration To IA 
Conference Code 2021-09-IA 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Random Walk on Graphs with Vicinity Avoidance 
Sub Title (in English)  
Keyword(1) Random Walk  
Keyword(2) Locality  
Keyword(3) Average first passage time  
Keyword(4) Average cover time  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Keita Kitaura  
1st Author's Affiliation Kwansei Gakuin University (Kwansei Gakuin Univ.)
2nd Author's Name Ryotaro Matsuo  
2nd Author's Affiliation Kwansei Gakuin University (Kwansei Gakuin Univ.)
3rd Author's Name Hiroyuki Ohsaki  
3rd Author's Affiliation Kwansei Gakuin University (Kwansei Gakuin Univ.)
4th Author's Name  
4th Author's Affiliation ()
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2021-09-08 10:30:00 
Presentation Time 25 minutes 
Registration for IA 
Paper # IA2021-16 
Volume (vol) vol.121 
Number (no) no.167 
Page pp.7-13 
#Pages 7 
Date of Issue 2021-09-01 (IA) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan