Registro de evidencia del método

Directed Closeness Centrality

Directed closeness centrality extends the classical closeness measure to directed networks by separately quantifying how quickly a node can be reached by others (in-closeness) and how quickly it can reach all others (out-closeness). It is a foundational node-level metric in social network analysis and graph theory, used wherever link direction conveys meaningful asymmetry such as citation flows, information cascades, or authority hierarchies.

Sources recorded, not reviewed

Registro de origen

Citas copiadas textualmente del registro de origen del método. No se infiere ninguna verificación a nivel de afirmación de ellas.

Directed Closeness Centrality (In-closeness and Out-closeness on Directed Graphs)

Registro del método taxonómico · ml-model / network-analysis

Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. · ISBN 978-0-521-38269-4
Freeman, L. C. (1979). Centrality in social networks conceptual clarification. Social Networks, 1(3), 215–239. · DOI 10.1016/0378-8733(78)90021-7

Abrir método completo

Afirmaciones curadas

Afirmaciones persistidas en el libro mayor de evidencia, cada una con su propia evaluación.

Aún no hay afirmaciones curadas

Esta vista no inventa una evaluación de afirmación si el libro mayor no tiene ninguna.

Métodos relacionados

Generado a partir del grafo de métodos y mostrado como relaciones sugeridas por la máquina; no se infiere ninguna afirmación de evidencia.

Taxonomic bucketCloseness Centralitymachine-suggested · Relational suggestion, not evidence.Taxonomic bucketDirected Betweenness Centralitymachine-suggested · Relational suggestion, not evidence.Taxonomic bucketDirected Eigenvector Centralitymachine-suggested · Relational suggestion, not evidence.Taxonomic bucketDirected PageRankmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketDirected Social Network Analysismachine-suggested · Relational suggestion, not evidence.