Characterization of max-min fair performance in large networks via Szemeredis Regularity Lemma

In this work, we provide asymptotically almost sure lower and upper bounds on the max-min fair performance in large single-hop networks with arbitrary channel fading. Our results are asymptotic in nature and we consider two cases of the limiting regime where the number of links (users) tends to infinity. The provided bounds apply to orthogonal networks as well as to a special class of nonorthogonal networks.