k i is the degree of vertex i, so 2m is the expected number of edges between i and j in a random graph.
for instance, when multiple puzzle-composers write crossword puzzle clues for the same word, they will try to write creative, unique clues to make the puzzle interesting and challenging; clues for "star" could be "Paparazzi's target" or "Sky light."