| http://dbpedia.org/ontology/abstract
|
In a connected graph, closeness centrality … In a connected graph, closeness centrality (or closeness) of a node is a measure of centrality in a network, calculated as the reciprocal of the sum of the length of the shortest paths between the node and all other nodes in the graph. Thus, the more central a node is, the closer it is to all other nodes. Closeness was defined by Bavelas (1950) as the reciprocal of the farness, that is: where is the distance (length of the shortest path) between vertices and . This unnormalised version of closeness is sometimes known as status When speaking of closeness centrality, people usually refer to its normalized form which represents the average length of the shortest paths instead of their sum. It is generally given by the previous formula multiplied by , where is the number of nodes in the graph resulting in: The normalization of closeness simplifies the comparison of nodes in graphs of different sizes. For large graphs, the minus one in the normalisation becomes inconsequential and it is often dropped. As one of the oldest centrality measures, closeness is often given in general discussions of network centrality meaures in introductory texts or in articles comparing different centrality measures. The values produced by many centrality measaures can be highly correlated. In particular, closeness and degree have been shown to be related in many networks through an approximate relationship where is the degree of vertex while and β are parameters found by fitting closeness and degree to this formula. The z parameter represents the branching factor, the average degree of nodes (excluding the root node and leaves) of the shortest-path trees used to approximate networks when demonstrating this relationship. This is never an exact relationship but it captures a trend seen in many real-world networks. Closeness is related to other length scales used in network science. For instance, the average shortest path length , the average distance between vertices in a network, is simply the average of the inverse closeness values . Taking distances from or to all other nodes is irrelevant in undirected graphs, whereas it can produce totally different results in directed graphs (e.g. a website can have a high closeness centrality from outgoing links, but low closeness centrality from incoming links).closeness centrality from incoming links).
, Степень близости узла (к другим узлам) — это мера центральности в сети, вычисляемая как обратная величина суммы длин кратчайших путей между узлом и всеми другими узлами графа. Таким образом, чем более централен узел, тем ближе он ко всем другим узлам.
, En análisis de redes sociales, la centrali … En análisis de redes sociales, la centralidad de cercanía, o simplemente cercanía (en inglés, closeness), es una medida de centralidad basada en las ideas de , definida formalmente por y , con aplicaciones en redes de comunicación, y luego popularizada por . Es la más conocida y utilizada de las medidas radiales de longitud. Se basa en calcular la suma o bien el promedio de las distancias geodésicas (o longitudes de los caminos más cortos) desde un nodo hacia todos los demás. Note que mientras mayor sea la «distancia» entre dos vértices, menor será la «cercanía» entre estos. Por lo tanto, la cercanía se define como el inverso multiplicativo de la «lejanía» entre dos vértices.ativo de la «lejanía» entre dos vértices.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Pathdegreeclosenessexampleedit.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
19959657
|
| http://dbpedia.org/ontology/wikiPageLength
|
19655
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1102792230
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Average_shortest_path_length +
, http://dbpedia.org/resource/Random_walk_closeness_centrality +
, http://dbpedia.org/resource/Category:Graph_invariants +
, http://dbpedia.org/resource/Bibliometrics +
, http://dbpedia.org/resource/Distance_%28graph_theory%29 +
, http://dbpedia.org/resource/Hierarchical_closeness +
, http://dbpedia.org/resource/Shortest-path_tree +
, http://dbpedia.org/resource/Graph_%28discrete_mathematics%29 +
, http://dbpedia.org/resource/Category:Network_analysis +
, http://dbpedia.org/resource/Massimo_Marchiori +
, http://dbpedia.org/resource/Betweenness_centrality +
, http://dbpedia.org/resource/Connected_component_%28graph_theory%29 +
, http://dbpedia.org/resource/Degree_%28graph_theory%29 +
, http://dbpedia.org/resource/Strongly_connected_component +
, http://dbpedia.org/resource/Directed_graph +
, http://dbpedia.org/resource/Harmonic_mean +
, http://dbpedia.org/resource/Vito_Latora +
, http://dbpedia.org/resource/Centrality +
, http://dbpedia.org/resource/Multiplicative_inverse +
, http://dbpedia.org/resource/File:Pathdegreeclosenessexampleedit.svg +
, http://dbpedia.org/resource/Shortest_path_problem +
, http://dbpedia.org/resource/Arithmetic_mean +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Anchor +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Graph_invariants +
, http://dbpedia.org/resource/Category:Network_analysis +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Closeness_centrality?oldid=1102792230&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Pathdegreeclosenessexampleedit.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Closeness_centrality +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q28401153 +
, http://ru.dbpedia.org/resource/%D0%A1%D1%82%D0%B5%D0%BF%D0%B5%D0%BD%D1%8C_%D0%B1%D0%BB%D0%B8%D0%B7%D0%BE%D1%81%D1%82%D0%B8_%28%D1%82%D0%B5%D0%BE%D1%80%D0%B8%D1%8F_%D0%B3%D1%80%D0%B0%D1%84%D0%BE%D0%B2%29 +
, https://global.dbpedia.org/id/2dzCA +
, http://dbpedia.org/resource/Closeness_centrality +
, http://es.dbpedia.org/resource/Centralidad_de_cercan%C3%ADa +
|
| rdfs:comment |
Степень близости узла (к другим узлам) — это мера центральности в сети, вычисляемая как обратная величина суммы длин кратчайших путей между узлом и всеми другими узлами графа. Таким образом, чем более централен узел, тем ближе он ко всем другим узлам.
, In a connected graph, closeness centrality … In a connected graph, closeness centrality (or closeness) of a node is a measure of centrality in a network, calculated as the reciprocal of the sum of the length of the shortest paths between the node and all other nodes in the graph. Thus, the more central a node is, the closer it is to all other nodes. Closeness was defined by Bavelas (1950) as the reciprocal of the farness, that is: The normalization of closeness simplifies the comparison of nodes in graphs of different sizes. For large graphs, the minus one in the normalisation becomes inconsequential and it is often dropped. .inconsequential and it is often dropped. .
, En análisis de redes sociales, la centrali … En análisis de redes sociales, la centralidad de cercanía, o simplemente cercanía (en inglés, closeness), es una medida de centralidad basada en las ideas de , definida formalmente por y , con aplicaciones en redes de comunicación, y luego popularizada por . Es la más conocida y utilizada de las medidas radiales de longitud. Se basa en calcular la suma o bien el promedio de las distancias geodésicas (o longitudes de los caminos más cortos) desde un nodo hacia todos los demás. Note que mientras mayor sea la «distancia» entre dos vértices, menor será la «cercanía» entre estos. Por lo tanto, la cercanía se define como el inverso multiplicativo de la «lejanía» entre dos vértices.ativo de la «lejanía» entre dos vértices.
|
| rdfs:label |
Степень близости (теория графов)
, Closeness centrality
, Centralidad de cercanía
|
