Given two partite sets of vertices $U$ and $V$ of size $n$. Each vertex in $U$ randomly selects $K$ ($K$ is a constant and $K\ll n$) vertices in $V$ without replacement and connects a bidirectional edge to each of the vertices it selects. My question is, what is the expected diameter of the bipartite graph generated this way? Thank you!