title: Infomap community detection understanding
body: <p>i need a understandable description of the Infomap Community Detection Algorithm. I read the papers, but it was not clear for me. My questions:</p>
  
  <ol>
  <li>How does the algorithm basically work?</li>
  <li>What has random walks to do with it?</li>
  <li>What is the map equation and what is (clearly) the difference to modularity optimization? (There was an example given in the paper in Fig. 3 , but i didn't get that)</li>
  <li>On their homepage, there are 2 improvements given. The first one is Submodule movements and the second one is Single-node movements. Why are they used and why are merged modules not seperateable?</li>
  </ol>
  
  <p>The homepage:
  <a href="http://www.mapequation.org/code.html" rel="noreferrer">http://www.mapequation.org/code.html</a></p>
  
  <p>The paper:
  <a href="http://www.mapequation.org/assets/publications/EurPhysJ2010Rosvall.pdf" rel="noreferrer">http://www.mapequation.org/assets/publications/EurPhysJ2010Rosvall.pdf</a></p>