Title: Studying the Structure of the Local Neighborhood of a Randomly Selected Vertex of a Large but Sparse Erdős-Rényi Binomial Random Graph
Goal:The main goal of this project is to statistically study local neighborhood of a randomly selected vertex of a large but sparse Erdős-Rényi random graph. Given any d the project should try to identify the statistical/random properties of the d-depth neighborhood for large but sparse Erdős-Rényi random graph.
Remarks: This is an working project. For every fixed d find the number of triangles, squares, pentagon ... in d-depth neighborhood for large but sparse Erdős-Rényi random graph. What can you conclude from your observations? Also statistically study the number of neighbors, 1-depth neighbors, 2-depth neighbors ... what can you conclude?