Central Limit Theorems for Infinite Series of Queues and Applications to Simple Exclusion

We prove that a tagged particle in asymmetric simple exclusion satisfies a central limit theorem when properly rescaled. To obtain this result we derive several results of positive (or negative) correlation for occupation times of a server in a series of queues which imply various central limit theorems.