title: Community detection with InfoMap algorithm producing one massive module
body: <p>I am using the InfoMap algorithm in the <code>igraph</code> package to perform community detection on a directed and non-weighted graph (34943 vertices, 206366 edges). In the graph, vertices represent websites and edges represent the existence of a hyperlink between websites.</p>
  
  <p>A problem I have encountered after running the algorithm is that the majority of vertices have a membership in a single massive community (32920 or 94%). The rest of the vertices are dispersed into hundreds of other tiny communities.</p>
  
  <p>I have tried different settings with the <code>nb.trials</code> parameter (i.e. 50, 100, and now running 500). However, this doesn't seem to change the result much.</p>
  
  <p>I am feeling rather exasperated because the run-time on the algorithm is quite high, so I have to wait each time for the results (with no luck yet!!).</p>
  
  <p>Many thanks.</p>