Consider the following situation: I have a set $A$ of $n$ vertices and a set $B$ of $N = n^2$vertices. I consider the bipartite graph $(A, B)$ and put at random $M = n^{1 + \varepsilon}$ edges (or I could put each edge independently with probability $p$ such that $pnN = M$, this shouldn't make a big difference). Then I remove the isolated vertices from $B$, so effectively I get vertex sets of size $n$ and $\Theta(n^{1 + \varepsilon})$.

Are there any references on how in general such bipartite random graphs look like (their degree sequence, connectivity etc.)? The model considered above is rather specific, however, I'd be happy with any references on bipartite graphs on $(n, N)$ vertices, where $N$ depends on $n$ (or information on how can one tackle them with techniques similar to ordinary random graphs; in this context it isn't clear to me whether we should treat the graph as a "sparse" or a "dense" one).

Ultimately I'm interested in spectral properties of such a graph (or rather a slight modification of it). What can be said about the second largest eigenvalue of its adjacency matrix or Laplacian? Now suppose that we take a union of this graph and a "good" graph (possibly also random) on the set $A$ only (by "good" I mean it has good spectral properties, I'm not trying to be very specific here). What can be said about eigenvalues of this graph?