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.
Publié le : 1986-04-14
Classification:
Central-limit theorem,
semi-Markov process,
series of queues,
infinite particle process,
tagged particle,
60K35
@article{1176992523,
author = {Kipnis, Claude},
title = {Central Limit Theorems for Infinite Series of Queues and Applications to Simple Exclusion},
journal = {Ann. Probab.},
volume = {14},
number = {4},
year = {1986},
pages = { 397-408},
language = {en},
url = {http://dml.mathdoc.fr/item/1176992523}
}
Kipnis, Claude. Central Limit Theorems for Infinite Series of Queues and Applications to Simple Exclusion. Ann. Probab., Tome 14 (1986) no. 4, pp. 397-408. http://gdmltest.u-ga.fr/item/1176992523/