670 citations · 5.2k across the 132 of their papers we have counts for
4 papers · 2 filters
Opinion control in complex networks
Naoki Masuda
In many instances of election, the electorate appears to be a composite of partisan and independent voters. Given that partisans are not likely to convert to a different party, a m…
Steady state and mean recurrence time for random walks on stochastic temporal networks
Leo Speidel, Renaud Lambiotte, Kazuyuki Aihara +1
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the imp…
Voter model on the two-clique graph
Naoki Masuda
I examine the mean consensus time (i.e., exit time) of the voter model in the so-called two-clique graph. The two-clique graph is composed of two cliques interconnected by some lin…
Random walk centrality for temporal networks
Luis Enrique Correa Rocha, Naoki Masuda
Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and…