does every infinite group admit a generating set such that the corresponding cayley graph has infinite diameter? while there are examples of uncountable groups that fail to satisfy this property (e.g., the group of all permutations of the integers), the question for countable groups remains open. after reviewing the necessary background and some known results, i will discuss an attempt to solve this problem by choosing a random generating set. for a wide class of countable groups, this approach answers the question affirmatively and reveals a surprising phenomenon: random generating sets yield the same cayley graph, independent of the group. depending on the randomness model, this is either the familiar rado graph (which has diameter 2) or a certain mysterious graph of infinite diameter.