ScholarGate
Assistent
Machine learningNetwork science

Rettet egenvektorcentralitet

Rettet egenvektorcentralitet udvider den klassiske egenvektorcentralitet til rettede grafer ved at score hver knude i henhold til centraliteten af de knuder, der peger på den (indgående retning) eller som den peger på (udgående retning). En knude opnår en høj score ikke blot ved at have mange forbindelser, men ved at være forbundet med andre stærkt centrale knuder, hvilket fanger asymmetrisk indflydelse i citationsnetværk, sociale hierarkier og informationsstrømme.

Åbn i MethodMindSnartVideoSnartDownload slides

Læs hele metoden

Kun for medlemmer

Log ind med en gratis konto for at læse dette afsnit.

Log ind

Method map

The neighbourhood of related methods — select a node to explore.

Kilder

  1. Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI: 10.1086/228631
  2. Eigenvector centrality. Wikipedia. link

Sådan citerer du denne side

ScholarGate. (2026, June 3). Directed Eigenvector Centrality (Asymmetric Influence Scoring on Directed Graphs). ScholarGate. https://scholargate.app/da/network-analysis/directed-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.

Compare side by side

Refereret af

ScholarGateDirected Eigenvector Centrality (Directed Eigenvector Centrality (Asymmetric Influence Scoring on Directed Graphs)). Hentet 2026-06-15 fra https://scholargate.app/da/network-analysis/directed-eigenvector-centrality · Datasæt: https://doi.org/10.5281/zenodo.20539026