EVOLUTION-MANAGER
Edit File: harmonic_centrality.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><title>R: Harmonic centrality of vertices</title> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="stylesheet" type="text/css" href="R.css" /> </head><body> <table width="100%" summary="page for harmonic_centrality {igraph}"><tr><td>harmonic_centrality {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Harmonic centrality of vertices</h2> <h3>Description</h3> <p>The harmonic centrality of a vertex is the mean inverse distance to all other vertices. The inverse distance to an unreachable vertex is considered to be zero. </p> <h3>Usage</h3> <pre> harmonic_centrality( graph, vids = V(graph), mode = c("out", "in", "all", "total"), weights = NULL, normalized = FALSE, cutoff = -1 ) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>graph</code></td> <td> <p>The graph to analyze.</p> </td></tr> <tr valign="top"><td><code>vids</code></td> <td> <p>The vertices for which harmonic centrality will be calculated.</p> </td></tr> <tr valign="top"><td><code>mode</code></td> <td> <p>Character string, defining the types of the paths used for measuring the distance in directed graphs. “out” follows paths along the edge directions only, “in” traverses the edges in reverse, while “all” ignores edge directions. This argument is ignored for undirected graphs.</p> </td></tr> <tr valign="top"><td><code>weights</code></td> <td> <p>Optional positive weight vector for calculating weighted harmonic centrality. If the graph has a <code>weight</code> edge attribute, then this is used by default. Weights are used for calculating weighted shortest paths, so they are interpreted as distances.</p> </td></tr> <tr valign="top"><td><code>normalized</code></td> <td> <p>Logical scalar, whether to calculate the normalized harmonic centrality. If true, the result is the mean inverse path length to other vertices, i.e. it is normalized by the number of vertices minus one. If false, the result is the sum of inverse path lengths to other vertices.</p> </td></tr> <tr valign="top"><td><code>cutoff</code></td> <td> <p>The maximum path length to consider when calculating the harmonic centrality. There is no such limit when the cutoff is negative. Note that zero cutoff means that only paths of at most length 0 are considered.</p> </td></tr> </table> <h3>Details</h3> <p>The <code>cutoff</code> argument can be used to restrict the calculation to paths of length <code>cutoff</code> or smaller only; this can be used for larger graphs to speed up the calculation. If <code>cutoff</code> is negative (which is the default), then the function calculates the exact harmonic centrality scores. </p> <h3>Value</h3> <p>Numeric vector with the harmonic centrality scores of all the vertices in <code>v</code>. </p> <h3>References</h3> <p>M. Marchiori and V. Latora, Harmony in the small-world, <em>Physica A</em> 285, pp. 539-546 (2000). </p> <h3>See Also</h3> <p><code><a href="betweenness.html">betweenness</a></code>, <code><a href="closeness.html">closeness</a></code> </p> <h3>Examples</h3> <pre> g <- make_ring(10) g2 <- make_star(10) harmonic_centrality(g) harmonic_centrality(g2, mode="in") harmonic_centrality(g2, mode="out") harmonic_centrality(g %du% make_full_graph(5), mode="all") </pre> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>