2 citations · 2 across the 3 of their papers we have counts for
5 papers
How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?
Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga
Real networks are often dynamic. In response to it, analyses of algorithms on {\em dynamic networks} attract more and more attentions in network science and engineering. Random wal…
Quasi-majority Functional Voting on Expander Graphs
Nobutaka Shimizu, Takeharu Shiraga
Consider a distributed graph where each vertex holds one of two distinct opinions. In this paper, we are interested in synchronous voting processes where each vertex updates its op…
Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models
Nobutaka Shimizu, Takeharu Shiraga
This paper is concerned with voting processes on graphs where each vertex holds one of two different opinions. In particular, we study the \emph{Best-of-two} and the \emph{Best-of-…
Discrepancy Analysis of a New Randomized Diffusion Algorithm
Takeharu Shiraga
For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\em discrepancy} between the maximum and m…
Dispersion processes
Colin Cooper, Andrew McDowell, Tomasz Radzik +2
We study a synchronous dispersion process in which particles are initially placed at a distinguished origin vertex of a graph . At each time step, at each vertex occupie…