EVOLUTION-MANAGER
Edit File: cluster_infomap.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: Infomap community finding</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 cluster_infomap {igraph}"><tr><td>cluster_infomap {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Infomap community finding</h2> <h3>Description</h3> <p>Find community structure that minimizes the expected description length of a random walker trajectory </p> <h3>Usage</h3> <pre> cluster_infomap( graph, e.weights = NULL, v.weights = NULL, nb.trials = 10, modularity = TRUE ) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>graph</code></td> <td> <p>The input graph.</p> </td></tr> <tr valign="top"><td><code>e.weights</code></td> <td> <p>If not <code>NULL</code>, then a numeric vector of edge weights. The length must match the number of edges in the graph. By default the ‘<code>weight</code>’ edge attribute is used as weights. If it is not present, then all edges are considered to have the same weight. Larger edge weights correspond to stronger connections.</p> </td></tr> <tr valign="top"><td><code>v.weights</code></td> <td> <p>If not <code>NULL</code>, then a numeric vector of vertex weights. The length must match the number of vertices in the graph. By default the ‘<code>weight</code>’ vertex attribute is used as weights. If it is not present, then all vertices are considered to have the same weight. A larger vertex weight means a larger probability that the random surfer jumps to that vertex.</p> </td></tr> <tr valign="top"><td><code>nb.trials</code></td> <td> <p>The number of attempts to partition the network (can be any integer value equal or larger than 1).</p> </td></tr> <tr valign="top"><td><code>modularity</code></td> <td> <p>Logical scalar, whether to calculate the modularity score of the detected community structure.</p> </td></tr> </table> <h3>Details</h3> <p>Please see the details of this method in the references given below. </p> <h3>Value</h3> <p><code>cluster_infomap</code> returns a <code><a href="communities.html">communities</a></code> object, please see the <code><a href="communities.html">communities</a></code> manual page for details. </p> <h3>Author(s)</h3> <p>Martin Rosvall wrote the original C++ code. This was ported to be more igraph-like by Emmanuel Navarro. The R interface and some cosmetics was done by Gabor Csardi <a href="mailto:csardi.gabor@gmail.com">csardi.gabor@gmail.com</a>. </p> <h3>References</h3> <p>The original paper: M. Rosvall and C. T. Bergstrom, Maps of information flow reveal community structure in complex networks, <em>PNAS</em> 105, 1118 (2008) doi: <a href="https://doi.org/10.1073/pnas.0706851105">10.1073/pnas.0706851105</a>, <a href="https://arxiv.org/abs/0707.0609">https://arxiv.org/abs/0707.0609</a> </p> <p>A more detailed paper: M. Rosvall, D. Axelsson, and C. T. Bergstrom, The map equation, <em>Eur. Phys. J. Special Topics</em> 178, 13 (2009). doi: <a href="https://doi.org/10.1140/epjst/e2010-01179-1">10.1140/epjst/e2010-01179-1</a>, <a href="https://arxiv.org/abs/0906.1405">https://arxiv.org/abs/0906.1405</a>. </p> <h3>See Also</h3> <p>Other community finding methods and <code><a href="communities.html">communities</a></code>. </p> <h3>Examples</h3> <pre> ## Zachary's karate club g <- make_graph("Zachary") imc <- cluster_infomap(g) membership(imc) communities(imc) </pre> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>