The Annals of Probability

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

Claude Kipnis

Full-text: Open access

Abstract

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.

Article information

Source
Ann. Probab., Volume 14, Number 2 (1986), 397-408.

Dates
First available in Project Euclid: 19 April 2007

Permanent link to this document
https://projecteuclid.org/euclid.aop/1176992523

Digital Object Identifier
doi:10.1214/aop/1176992523

Mathematical Reviews number (MathSciNet)
MR832016

Zentralblatt MATH identifier
0601.60098

JSTOR
links.jstor.org

Subjects
Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43]

Keywords
Central-limit theorem semi-Markov process series of queues infinite particle process tagged particle

Citation

Kipnis, Claude. Central Limit Theorems for Infinite Series of Queues and Applications to Simple Exclusion. Ann. Probab. 14 (1986), no. 2, 397--408. doi:10.1214/aop/1176992523. https://projecteuclid.org/euclid.aop/1176992523


Export citation