Title: Connectivity Properties and Structure of Random Graphs Obtained by Vertex Percolation on Erdős-Rényi Binomial Random Graph
Assigned To: Bhaskar Ray and Dibyendu Saha (joint project)
Goal:Let G be a random graph obtained by erasing vertices of the complete graph Kn independently with probability 0 < q < 1 and edges with probability 0 < p < 1. The main goal of the project is to study theoretically or through simulations the connectivity properties and structure of such random graphs for large n. Note that p and q may depend on n and need not be equal.
Remarks: This is an working project. The question is about the connectivity threshold, is it defined, if yes then what is it?