About: Random walk closeness centrality

An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Random walk closeness centrality is a measure of centrality in a network, which describes the average speed with which randomly walking processes reach a node from other nodes of the network. It is similar to the closeness centrality except that the farness is measured by the expected length of a random walk rather than by the shortest path. The concept was first proposed by White and Smyth (2003) under the name Markov centrality.

Property Value
dbo:abstract
  • Random walk closeness centrality is a measure of centrality in a network, which describes the average speed with which randomly walking processes reach a node from other nodes of the network. It is similar to the closeness centrality except that the farness is measured by the expected length of a random walk rather than by the shortest path. The concept was first proposed by White and Smyth (2003) under the name Markov centrality. (en)
dbo:wikiPageID
  • 35889132 (xsd:integer)
dbo:wikiPageLength
  • 8450 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1104919559 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • Random walk closeness centrality is a measure of centrality in a network, which describes the average speed with which randomly walking processes reach a node from other nodes of the network. It is similar to the closeness centrality except that the farness is measured by the expected length of a random walk rather than by the shortest path. The concept was first proposed by White and Smyth (2003) under the name Markov centrality. (en)
rdfs:label
  • Random walk closeness centrality (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License