Dynamics-based centrality for directed networks

Naoki Masuda*, Hiroshi Kori

*この研究の対応する著者

研究成果: Article査読

18 被引用数 (Scopus)

抄録

Determining the relative importance of nodes in directed networks is important in, for example, ranking websites, publications, and sports teams, and for understanding signal flows in systems biology. A prevailing centrality measure in this respect is the PageRank. In this work, we focus on another class of centrality derived from the Laplacian of the network. We extend the Laplacian-based centrality, which has mainly been applied to strongly connected networks, to the case of general directed networks such that we can quantitatively compare arbitrary nodes. Toward this end, we adopt the idea used in the PageRank to introduce global connectivity between all the pairs of nodes with a certain strength. Numerical simulations are carried out on some networks. We also offer interpretations of the Laplacian-based centrality for general directed networks in terms of various dynamical and structural properties of networks. Importantly, the Laplacian-based centrality defined as the stationary density of the continuous-time random walk with random jumps is shown to be equivalent to the absorption probability of the random walk with sinks at each node but without random jumps. Similarly, the proposed centrality represents the importance of nodes in dynamics on the original network supplied with sinks but not with random jumps.

本文言語English
論文番号056107
ジャーナルPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
82
5
DOI
出版ステータスPublished - 2010 11 8
外部発表はい

ASJC Scopus subject areas

  • 統計物理学および非線形物理学
  • 統計学および確率
  • 凝縮系物理学

フィンガープリント

「Dynamics-based centrality for directed networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル