This paper studies the expansion properties of randomly perturbed graphs. These graphs are formed by, for example, adding a random 1-out or very sparse Erdos-Renyi to an arbitrary connected graph. It is shown that when any connected n-vertex base graph
» Full text »
