title: What are the differences between community detection algorithms in igraph?
body: <p>I have a list of about 100 igraph objects with a typical object having about 700 vertices and 3500 edges.</p>
  
  <p>I would like to identify groups of vertices within which ties are more likely.  My plan is to then use a mixed model to predict how many within-group ties vertices have using vertex and group attributes.</p>
  
  <p>Some people may want to respond to other aspects of my project, which would be great, but the thing I'm most interested in is information about functions in igraph for grouping vertices.  I've come across these <a href="http://igraph.sourceforge.net/doc/R/community.structure.html" rel="noreferrer">community detection algorithms</a> but I'm not sure of their advantages and disadvantages, or whether some other function would be better for my case.  I saw the links <a href="https://stackoverflow.com/a/5823371/303400">here</a> as well, but they aren't specific to igraph.  Thanks for your advice.</p>