Searchability of Central Nodes in Networks

Konstantin Klemm

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

Social networks are discrete systems with a large amount of heterogeneity among nodes (individuals). Measures of centrality aim at a quantification of nodes' importance for structure and function. Here we ask to which extent the most central nodes can be found by purely local search. We find that many networks have close-to-optimal searchability under eigenvector centrality, outperforming searches for degree and betweenness. Searchability of the strongest spreaders in epidemic dynamics tends to be substantially larger for supercritical than for subcritical spreading.

Original languageEnglish
Pages (from-to)707-719
Number of pages13
JournalJournal of Statistical Physics
Volume151
Issue number3-4
DOIs
Publication statusPublished - 2013

Keywords

  • Frustration
  • Markov chain
  • Network centrality
  • Social network

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Mathematical Physics

Fingerprint Dive into the research topics of 'Searchability of Central Nodes in Networks'. Together they form a unique fingerprint.

Cite this