講演抄録/キーワード |
講演名 |
2020-12-04 14:00
[招待講演]How many vertices does a random walk miss in a network with moderately increasing the number of vertices? Shuji Kijima(Kyushu Univ.)・Nobutaka Shimizu(The Univ. of Tokyo)・○Takeharu Shiraga(Chuo Univ.) COMP2020-23 |
抄録 |
(和) |
(まだ登録されていません) |
(英) |
Real networks are often dynamic. In response to it, analyses of algorithms on dynamic networks attract more and more attention in network science and engineering. Random walks on dynamic graphs also have been investigated actively in more than a decade, where in most cases the edge set changes but the vertex set is static. The vertex sets are also dynamic in many real networks. Motivated by a new technology of the analysis of random walks on dynamic graphs, this paper introduces a simple model of graphs with an increasing number of vertices and presents an analysis of random walks associated with the cover time on such graphs. In particular, we studied the number of unvisited vertices of a random walk on a growing graph where a new vertex is attached at an interval defined by some duration function. In this talk, I’d like to show some interesting relationship between duration functions and the number of unvisited vertices. |
キーワード |
(和) |
/ / / / / / / |
(英) |
Cover time / Dynamic graph / Evolving graph / Temporal graph / / / / |
文献情報 |
信学技報, vol. 120, no. 276, COMP2020-23, pp. 29-29, 2020年12月. |
資料番号 |
COMP2020-23 |
発行日 |
2020-11-27 (COMP) |
ISSN |
Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
COMP2020-23 |