Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a bipartite graph of degree $d$). This construction is much simpler than all known explicit constructions of expanders and gives graphs with good mixing properties (small second largest eigenvalue) with high probability. However, from the practical viewpoint, it uses too many random bits, so it is difficult to generate and store these bits for large graphs. The natural idea is to restrict the class of the bijections that we use. For example, if both sides are linear spaces $\mathbb{F}_q^k$ over a finite field $\mathbb{F}_q$, we may consider only \emph{linear} bijections, making the number of random bits polynomial in $k$ (and not $q^k$). In this paper we provide some experimental data that shows that this approach conserves the mixing properties (the second eigenvalue) for several types of graphs (undirected regular and biregular bipartite graphs). We also prove some upper bounds for the second eigenvalue (though they are quite weak compared with the experimental results). Finally, we discuss the possibility to decrease the number of random bits further by using Toeplitz matrices; our experiments show that this change makes the mixing properties only marginally worse while the number of random bits decreases significantly.