Title: Typical Distance between Two Randomly Selected Vertices of a Erdős-Rényi Binomial Random Graph
Assigned To: Aditya Ghosh and Sayak Chatterjee (joint project)
Goal: Consider the Erdős-Rényi binomial random graph model. Study statistically (through simulations) the typical graph distance between two randomly selected vertice. You can consider p to be above the connectivity threshold and also sparse but super-critical regime.
Remarks: This is an working project. The main question is whether the typical distance is growing with n and if yes, in what rate?