Quantum transport in randomized quantum graphs

This work deals with quantum transport in open quantum graphs. We consider the case of complete graphs on n vertices with an edge removed and attached to two leads to represent the entrance and exit channels, from where we calculate the transmission coefficient. We include the possibility of several vertices being connected or not and associate it with a randomization parameter p. To implement the calculation, we had to introduce the transmission coefficient of randomized quantum graphs, and we also proposed a procedure to obtain the exact and approximate but reliable results for such transmission coefficients. The main results show that transport is significantly affected by the removal of connections between pairs of vertices, but they also indicate the presence of a region where the transmission is fully suppressed, even when the number of edge removals is not too small.