Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
IN, IA (Joint) 
20221213 10:15 
Hiroshima 
HigashiSenda campus, Hiroshima Univ. (Primary: Onsite, Secondary: Online) 
[Short Paper]
Investigation of a Matrix Approximation Method for Analyzing the Information Amount Contained in the Specified Eigenvalues and Eigenvectors Eriko Segawa, Yusuke Sakumoto (Kwansei Gakuin Univ) IA202256 
(To be available after the conference date) [more] 
IA202256 pp.4749 
IN, IA (Joint) 
20221213 11:30 
Hiroshima 
HigashiSenda campus, Hiroshima Univ. (Primary: Onsite, 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.) IA202259 
(To be available after the conference date) [more] 
IA202259 pp.6063 
IN, IA (Joint) 
20221213 11:45 
Hiroshima 
HigashiSenda campus, Hiroshima Univ. (Primary: Onsite, Secondary: Online) 
[Short Paper]
On the Study of the Effectiveness of the Random WalkBased Rendezvous for Real Social Networks Toma Yoshinari, Nanami Tsuji, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA202260 
(To be available after the conference date) [more] 
IA202260 pp.6466 
CQ 
20220722 11:20 
Osaka 
Ritsumeikan Ibaraki Future Plaza Conference Hall (Primary: Onsite, Secondary: Online) 
[Invited Talk]
Spectral Graph Theory and Its Application Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ202225 
The spectral graph theory provides an algebraical approach to investigating the characteristics of networks using the ei... [more] 
CQ202225 p.43 
CQ, CS (Joint) 
20220512 16:10 
Fukui 
Fukui (Fuku Pref.) (Primary: Onsite, Secondary: Online) 
Why Do Small Eigenvalues of Laplacian Matrix Improve Anomaly Detection of Temporal Networks? Eriko Segawa, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ20229 
Many real networks are temporal networks in which the nodes and their relationships change over time, and technology to ... [more] 
CQ20229 pp.4449 
CQ, CS (Joint) 
20220512 16:35 
Fukui 
Fukui (Fuku Pref.) (Primary: Onsite, Secondary: Online) 
Study on an Autonomous Adaptive Mechanism for Robustness of the UserAware Resource Assignment against Demand Fluctuation Keita Tatebe, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ202210 
The assignment problem on networks is a fundamental problem associated with various methods such as distributed computin... [more] 
CQ202210 pp.5055 
CQ, CBE (Joint) 
20220127 16:55 
Ishikawa 
Kanazawa（Ishikawa Pref.） (Primary: Onsite, 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.) CQ202185 
Random walks on graphs have been used in various graph algorithms. The first meeting time is defined by the time it take... [more] 
CQ202185 pp.5055 
CQ, CBE (Joint) 
20220128 11:45 
Ishikawa 
Kanazawa（Ishikawa Pref.） (Primary: Onsite, Secondary: Online) 
A Study on Parameter Tuning of a Rendezvous Search Utilizing Random Walks Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ) CQ202192 
Many studies proposed a rendezvous search that multiple searchers existing on different nodes on a network try to find o... [more] 
CQ202192 pp.8893 
CQ, MIKA (Joint) 
20210909 10:55 
Online 
Online 
Proposal of an Improving Method for the Laplacian Anomaly Detection of Temporal Networks Eriko Segawa, Toyoaki Taniguchi, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ202140 
Many networks in the real world are dynamic and temporal wherein relationships among nodes change with time. Technologie... [more] 
CQ202140 pp.1722 
IA 
20210908 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.) IA202117 
The first meeting time is defined by the time it takes for multiple mobile agents starting random walks from different n... [more] 
IA202117 pp.1421 
CS, CQ (Joint) 
20210514 10:50 
Online 
Online 
A Study of the Effect of Agents' Diversities on the Running Time of the Random WalkBased Rendezvous Search Fumiya Toyoda, Yusuke Sakumoto (Kwansei Univ.) CQ202113 
A rendezvous search, which aims to efficiently meet multiple searchers existing different nodes on a network, is expecte... [more] 
CQ202113 pp.5358 
CQ (2nd) 
20210121 13:45 
Online 
Online 
[Invited Lecture]
For Statistical Analysis of LargeScale and Complex Network and its Application Yusuke Sakumoto (Kwansei Gakuin Univ.) 
[more] 

CQ, CBE (Joint) 
20210120 13:05 
Online 
Online 
A Study of a Method to Analyze Brain Network Using WSD(Weighted Spectral Distribution) Yuki Oishi, Toyoaki Taniguchi, Yusuke Sakumoto (Kwansei Gakuin Univ) CQ202066 
In order to understand the complex behavior of brains, many works have analyzed connectomes, which are the connection in... [more] 
CQ202066 pp.3237 
CQ 
20200903 11:20 
Osaka 
Osaka University Nakanoshima Center (Primary: Onsite, Secondary: Online) 
The Effect of ScaleFree Structure of Network on Autonomous Decentralized Allocation Control of Content Replicas Toshitaka Kashimoto, Yusuke Sakumoto (Kwansei Univ.) CQ202036 
Information centric network (ICN) aims to realize efficient content delivery by using innetwork caching. Some studies ... [more] 
CQ202036 pp.914 
CQ 
20200903 11:45 
Osaka 
Osaka University Nakanoshima Center (Primary: Onsite, Secondary: Online) 
Study on the Effectivity of Rendezvous Search Using Random Walk in LargeScale Unknown Networks Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Univ.) CQ202037 
Many studies proposed a rendezvous search method that multiple searchers starting from different nodes on a network try ... [more] 
CQ202037 pp.1520 
IA, SITE, IPSJIOT [detail] 
20200303 10:05 
Online 
Online 
A Study on Autonomous Decentralized Allocation Method for Content Replicas in ICN Toshitaka Kashimoto, Yusuke Sakumoto (Kwansei Gakuin Univ) SITE201995 IA201973 
The innetwork caching is discussed as a method to reduce the delivery time of contents in ICNs. The efficiency of the ... [more] 
SITE201995 IA201973 pp.9398 
IA, SITE, IPSJIOT [detail] 
20200303 10:30 
Online 
Online 
A Study on Efficient Blind Search Utilizing the Rendezvous of Random Walk Agents Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ) SITE201996 IA201974 
A blind search is a search method for a network, without using topology information of an entire network. While a blind... [more] 
SITE201996 IA201974 pp.99104 
CQ, CBE (Joint) 
20200116 10:50 
Tokyo 
NHK Science & Technology Research Laboratories 
A Study on the Effect of Triads on the Wigner's Semicircle Law of Weighted Random Networks Toyoaki Taniguchi, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2019112 
Spectral graph theory is widely used to analyze network characteristics. In spectral graph theory, the network structur... [more] 
CQ2019112 pp.2934 
IA 
20191114 15:30 
Tokyo 
Kwansei Gakuin University, Tokyo Marunouchi Campus (Sapia Tower) 
[Poster Presentation]
Investigation on the First Meeting Time of Random Walk Agents with Heterogeneous Transition Probability for Optimal Rendezvous Search Fumiya Toyoda, Yusuke Sakumoto (Kwansei Gakuin Univ.) IA201931 
In an unstructured network~(e.g., unstructured P2P network, social
network, and MANET), there is a restriction that eac... [more] 
IA201931 pp.4346 
IA 
20190906 10:30 
Hokkaido 
Hokkaido Univ. Humanities and Social Sciences Classroom Bldg, W102 
Analysis of Two Random Walks on the Basis of Graph Spectrum
 The Effect of Degree Heterogeneity on First Meeting Time on a Graph  Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA201918 
The first meeting time is defined as the time required until multiple random walks starting from different nodes in a gr... [more] 
IA201918 pp.3944 