Expected Linear time Minimum Spanning Tree algorithm I am trying to understand the proposed "Randomized Linear-Time Algorithm to Find MST".

My findings:
I have read and search almost every available resource( main paper, wiki, reports on paper, lecture on paper ) but not getting any clue regarding my confusion.

Question: 
In the original paper Section 3: The Algorithm "Step 2" says "In the contracted graph, choose a subgraph H by selecting each edge independently with probability 1/2." 

If I have 6 vertexes with 14 edges. And if I choose 7 edges with probability 1/2 then there might be some isolated vertex. In that case, what will happen to that isolated vertex?
Nothing in particular happens if there is an isolated vertex. The algorithm is correct even if $H$ consists of no edges, or if it consists of all edges. The algorithm proceeds by finding a minimum spanning forest on $H$, and using it to prune the contracted graph. IF $H$ consists of no edges, then nothing is pruned, but the algorithm remains correct - this only affects the running time.

Note also that the algorithm is for the more general minimum spanning forest problem. Hence there is absolutely no problem if the graph is not connected. The algorithm will find a minimum spanning tree in each connected component.