Can isolated subgraphs appear and with what probability?

This a question of graph theory that is beyond my reach. I don't understand, intuitively, why the algorithms to add and delete nodes strongly guarantee a connected graph. I understand how it is unlikely due to the multi-layered architecture and I understand how we can decrease the probability of isolation by increasing M.