Eigenvector Centrality
Eigenvector centrality, introduced by Bonacich in 1972, measures a node's influence by considering not just how many neighbors it has, but how influential those neighbors are. A node scores highly if it is connected to other high-scoring nodes, making it a recursive, globally-aware measure of structural importance in a network.
Loe meetodi täielikku kirjeldust
Selle osa lugemiseks logi sisse tasuta kontoga.
Method map
The neighbourhood of related methods — select a node to explore.
+9 more
Allikad
- Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120. DOI: 10.1080/0022250X.1972.9989806 ↗
- Eigenvector centrality. Wikipedia. link ↗
Kuidas sellele lehele viidata
ScholarGate. (2026, June 3). Eigenvector Centrality (Bonacich Power Centrality). ScholarGate. https://scholargate.app/et/network-analysis/eigenvector-centrality
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Vahel asuvus (Betweenness Centrality)Võrgustikuanalüüs↔ compare
- LäheduskesksusVõrgustikuanalüüs↔ compare
- KraaditsentraalsusVõrgustikuanalüüs↔ compare
- Modulaarsuse analüüsVõrgustikuanalüüs↔ compare
- PageRanki keskuslikkusVõrgustikuanalüüs↔ compare
- Sotsiaalvõrgustike analüüsVõrgustikuanalüüs↔ compare
Sellele viitavad
Märkasid sellel lehel viga? Teata sellest või paku parandust →