Random walk centrality for temporal networks
Nodes can be ranked according to their relative importance within a network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, for example the PageRank, have focused on st...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
IOP Publishing
2014-01-01
|
| Seri Bilgileri: | New Journal of Physics |
| Konular: | |
| Online Erişim: | https://doi.org/10.1088/1367-2630/16/6/063023 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|