title: Why find the Hamming Distance in Dynamical Networks?
body: <p>In dynamical networks, one may calculate the Hamming distance to compare the similarity between two graphs, can anyone explain how?</p>
  
  <p>Assuming that the Hamming distance of two graphs have equal edge density, what is the difference between Hamming distance and expected Hamming distance between two independent Erdos-Renyi random graphs? How does the later arise?</p>