This paper presents a statistical model for explaining why skewed-associativity removes conflicts better than setassociativity. We show that, with a high probability, 2-way skewed associativity emulates full associativity for workingsets up to half the cache size, and we show that 3-way skewed-associativity is almost equivalent to full associativity.