I have a graph G of N nodes and M edges.

To create a random subgraph, I choose randomly (uniformly) n nodes (n < N), where two nodes are connected if they are connected in the original graph.

Should I expect the subgraph to have some properties of the Erdos-Ranyi graphs? And what is the expected number of edges of the subgraph? Thank you