Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |

AI, JSAI-SAI, JSAI-DOCMAS, IPSJ-ICS, JSAI-KBS (Joint) |
2024-03-03 18:30 |
Hokkaido |
(Primary: On-site, Secondary: Online) |
Method for Generating Paths with Arbitrary Termination Probabilities Based on Pre-Executed Random Walk Paths Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) AI2023-48 |
In graph analysis, random walks can be sped up by using indices. A random walk is a sequence of transitions from a sourc... [more] |
AI2023-48 pp.24-29 |

NS, IN (Joint) |
2024-03-01 09:20 |
Okinawa |
Okinawa Convention Center |
Asynchronous UDP Random Walk method with path reuse for geo-distributed graph analysis Shun Takizawa, Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2023-88 |
Random Walk (RW) is widely used in graph analysis. Graph data for analysis has been getting larger and larger in recent ... [more] |
IN2023-88 pp.136-141 |

AP |
2023-09-01 10:00 |
Tokyo |
KOZO KEIKAKU ENGINEERING Inc. (Primary: On-site, Secondary: Online) |
Historical visit to three Nakagami distributions: Part 3: m distribution Yoshio Karasawa AP2023-72 |
The three probability distributions, namely, n distribution, q distribution, and m distribution devised by Minoru Nakaga... [more] |
AP2023-72 pp.31-36 |

IMQ, IE, MVE, CQ (Joint) [detail] |
2023-03-15 09:45 |
Okinawa |
Okinawaken Seinenkaikan (Naha-shi) (Primary: On-site, Secondary: Online) |
A Preliminary Study on Random Walk based Similar-Contents Discovery Ryo Nakamura (Fukuoka Univ.) CQ2022-80 |
As we know, the contents discovery is one of fundamental research topics in the field of communication networks such as ... [more] |
CQ2022-80 pp.1-6 |

IN, NS (Joint) |
2023-03-03 14:30 |
Okinawa |
Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
Top-k Personalized PageRank Computation without Re-indexing for Graph Updates Tsuyoshi Yamashita, Naoki Matsumoto, Kunitake Kaneko (Keio Univ.) IN2022-117 |
Top-k Personalized PageRank (PPR) is graph analysis method to determine k important nodes with respect to a source node.... [more] |
IN2022-117 pp.305-310 |

IN |
2023-01-20 09:50 |
Aichi |
Aichi Industry & Labor Center (Primary: On-site, Secondary: Online) |
Community Detection in Multi-Layer Networks with Controlled Reflection of Layers Shuhei Nakano, Tsuyoshi Yamashita, Naoki Matsumoto, Kunitake Kaneko (Keio Univ.) IN2022-62 |
Community detection in multi-layer networks has put an emphasis on identifying the idel reflection of layers. However, t... [more] |
IN2022-62 pp.64-71 |

IN, IA (Joint) |
2022-12-13 10:40 |
Hiroshima |
Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
On the Impact of Random Walk Laziness on Efficiency of Graph Exploration in Dynamic Graphs Daiki Nakagawa, Takeaki Iwata, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2022-57 |
Graph exploration with a random walk has a wide range of engineering applications, and its mathematical properties have ... [more] |
IA2022-57 pp.50-55 |

IN, IA (Joint) |
2022-12-13 11:30 |
Hiroshima |
Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
For Understanding the First Meeting Time of Multiple Random Walks with Different Transition Probabilities Nanami Tsuji, Yusuke Sakumoto, Hiroyuki Osaki (Kwansei Gakuin Univ.) IA2022-59 |
Random walks on graphs have been used in various graph algorithms, and its understanding is important to design an effic... [more] |
IA2022-59 pp.60-63 |

IN, IA (Joint) |
2022-12-13 11:45 |
Hiroshima |
Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
On the Study of the Effectiveness of the Random Walk-Based Rendezvous for Real Social Networks Toma Yoshinari, Nanami Tsuji, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2022-60 |
Rendezvous searches on networks discuss the meeting of multiple searchers existing on different nodes. Especially, a bli... [more] |
IA2022-60 pp.64-66 |

IN, CCS (Joint) |
2022-08-05 09:00 |
Hokkaido |
Hokkaido University(Centennial Hall) (Primary: On-site, Secondary: Online) |
Autonomous Congestion Control Mechanism Using Random Early Detection in Asynchronous Random Walker Processing Shun Takizawa, Kunitake Kaneko (Keio Univ.) IN2022-18 |
In large-scale graph analysis, Random Walk (RW) is useful and has been implemented in both synchronous and asynchronous ... [more] |
IN2022-18 pp.15-20 |

CCS, NLP |
2022-06-10 14:25 |
Osaka |
(Primary: On-site, Secondary: Online) |
The skeletal structure of transition probabilities on quantum-walk-replicating random walks Tomoki Yamagami (UTokyo), Etsuo Segawa (YNU), Ken'ichiro Tanaka, Takatomo Mihana, Andre Roehm, Ryoichi Horisaki, Makoto Naruse (UTokyo) NLP2022-19 CCS2022-19 |
In this report, we analyze the transition probabilities of random walk replicating the probability distribution of quant... [more] |
NLP2022-19 CCS2022-19 pp.94-99 |

NS, IN (Joint) |
2022-03-11 14:20 |
Online |
Online |
A Method for Generating Random Walk Paths Focusing Only on Updates Near A Source Node in Dynamic Distributed Graphs Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2021-48 |
In graph calculations with a lot of random walks (RWs), some long RWs become bottlenecks, and thus pre-execution of RWs ... [more] |
IN2021-48 pp.103-108 |

CQ, CBE (Joint) |
2022-01-27 16:55 |
Ishikawa |
Kanazawa（Ishikawa Pref.） (Primary: On-site, Secondary: Online) |
An experimental study to clarify the characteristics of multiple random walks with different transition probabilities Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) CQ2021-85 |
Random walks on graphs have been used in various graph algorithms. The first meeting time is defined by the time it take... [more] |
CQ2021-85 pp.50-55 |

CQ, CBE (Joint) |
2022-01-28 11:45 |
Ishikawa |
Kanazawa（Ishikawa Pref.） (Primary: On-site, Secondary: Online) |
A Study on Parameter Tuning of a Rendezvous Search Utilizing Random Walks Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ) CQ2021-92 |
Many studies proposed a rendezvous search that multiple searchers existing on different nodes on a network try to find o... [more] |
CQ2021-92 pp.88-93 |

NS, NWS (Joint) |
2022-01-28 10:50 |
Online |
Online |
[Encouragement Talk]
Degree Based Vertex Replication Method for Random Walk in Autonomous Distributed Graphs Ozaki Yoichi, Kaneko Kunitake (Keio Univ.) NS2021-116 |
In autonomously distributed graphs, the vertex set placed on a server does not always follow the community structure of ... [more] |
NS2021-116 pp.36-41 |

IN, IA (Joint) |
2021-12-17 12:40 |
Hiroshima |
Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
A Study on First Passage Time and Cover Time of Non-backtracking Random Walk on a Graph Tetsuya Kawagishi, Jo Hagikura, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-41 |
Recently, mathematical properties of random walks on a graph have been studied.
Also, several extended models of a simp... [more] |
IA2021-41 pp.56-59 |

IN, IA (Joint) |
2021-12-17 18:10 |
Hiroshima |
Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
Study on Improving the Characteristics of Random Walk on Graph using Q-learning Tomoyuki Miyashita, Taisei Suzuki, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-51 |
In recent years, modeling mobile agent on unknown graphs, such as random walks on graphs and understanding its mathemati... [more] |
IA2021-51 pp.100-103 |

CAS, NLP |
2021-10-15 10:00 |
Online |
Online |
A Binary Discrete-Time Model-Based Discussion on the Quantum Counterpart of Electric Circuits Hisato Fujisaka (Hiroshima City Univ.) CAS2021-30 NLP2021-28 |
Electric networks consisting of LCR elements are dissipative wave systems while quantum energy-conservative systems are ... [more] |
CAS2021-30 NLP2021-28 pp.74-77 |

IA |
2021-09-08 10:30 |
Online |
Online |
Random Walk on Graphs with Vicinity Avoidance Keita Kitaura, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-16 |
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... [more] |
IA2021-16 pp.7-13 |

IA |
2021-09-08 10:55 |
Online |
Online |
Analysis of Diverse Random Walks with Different Transition Probabilities and Different Moving Frequencies Using Spectral Graph Theory Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-17 |
The first meeting time is defined by the time it takes for multiple mobile agents starting random walks from different n... [more] |
IA2021-17 pp.14-21 |