
Queuing Theory
Glynn and Whitt (1991) consider a series of n single-
server queues each with unlimited waiting space
with a first-in and first-out service. Service times are
i.i.d. with mean one and variance
2
with distribu-
tion V. The quantity of interest is D(k, n), the
departure time of customer k (the last customer to
be served) from the last queue n. For a fixed number
of customers, k, they prove that
Dðk; nÞn
ffiffiffi
n
p
converges in distribution to a certain functional
^
D
k
of k-dimensional Brownian motion. They show that
^
D
k
is independent of the service time distribution V.
It was shown in, for example, Gravner et al. (2002)
that
^
D
k
is equal in distribution to the largest
eigenvalue of a k k GUE random matrix. This
fascinating connection has been greatly clarified in
recent work of O’Connell and Yor (2002).
From Johansson (2002), it follows for V Poisson that
P
Dðbxnc; nÞc
1
n
c
2
n
1=3
< s
! F
2
ðsÞ
as n !1 for some explicitly known constants c
1
and c
2
(depending upon x).
Superconductors
Vavilov et al. (2001) have conjectured (based upon
certain physical assumptions supported by numer-
ical work) that the fluctuation of the excitation gap
in a metal grain or quantum dot induced by the
proximity to a superconductor is described by F
1
for
zero magnetic field and by F
2
for nonzero magnetic
field. They conclude their paper with the remark:
The universality of our prediction should offer ample
opportunities for experimental observation.
Acknowledgments
This work was supported by the National Science
Foundation through grants DMS-9802122 and
DMS-9732687.
See also: Determinantal Random Fields; Growth
Processes in Random Matrix Theory; Integrable Systems
and Algebraic Geometry; Integrable Systems and the
Inverse Scattering Method; Integrable Systems:
Overview; Quantum Calogero–Moser Systems; Random
Partitions; Random Matrix Theory in Physics; Symmetry
Classes in Random Matrix Theory; Toeplitz Determinants
and Statistical Mechanics.
Further Reading
Aldous D and Diaconis P (1999) Longest increasing subsequences:
from patience sorting to the Baik–Deift–Johansson theory.
Bulletin of American Mathematical Society 36: 413–432.
Baik J, Deift P, and Johansson K (2000) On the distribution of the
length of the second row of a Young diagram under Plancherel
measure. Geometry of Functional Analysis 10: 702–731.
Baik J and Rains EM (2000) Limiting distributions for a polynuclear
growth model. Journal of Statistical Physics 100: 523–541.
Baik J and Rains EM (2001) Symmetrized random permutations.
In: Bleher P and Its A (eds.) Random Matrix Models and Their
Applications, Math. Sci. Res. Inst. Publications, vol. 40, pp.
1–19. Cambridge: Cambridge University Press.
Bleher P and Its A (1999) Semiclassical asymptotics of orthogonal
polynomials, Riemann–Hilbert problem, and universality in
the matrix model. Annals of Mathematics 150: 185–266.
Deift P, Kriecherbauer T, McLauglin K.T-R, Venakides S, and
Zhou X (1999) Uniform asymptotics for polynomials orthogo-
nal with respect to varying exponential weight and applications
to universality questions in random matrix theory. Commu-
nications on Pure and Applied Mathematics 52: 1335–1425.
Glynn PW and Whitt W (1991) Departure times from many
queues. Annals of Applied Probability 1: 546–572.
Gravner J, Tracy CA, and Widom H (2002) A growth model in a
random environment. Annals of Probability 30: 1340–1368.
Jimbo M, Miwa T, Moˆ ri Y, and Sato M (1980) Density matrix of
an impenetrable Bose gas and the fifth Painleve´ transcendent.
Physica D 1: 80–158.
Johansson K (2000) Shape fluctuations and random matrices.
Communications in Mathematical Physics 209: 437–476.
Johansson K (2001) Discrete orthogonal polynomial ensembles and
the Plancherel measure. Annals of Mathematics 153: 259–296.
Johansson K (2002a) Non-intersecting paths, random tilings and
random matrices. Probability Theory and Related Fields 123:
225–280.
Johansson K (2002b) Toeplitz determinants, random growth and
determinantal processes. In: Proceedings of the ICM, Beijing,
ICM vol. 3, pp. 53–62.
Johnstone I (2001) On the distribution of the largest principal
component. Annals of Statistics 29: 295–327.
Kardar M, Parisi G, and Zhang Y-C (1986) Dynamical scaling of
growing interfaces. Physical Review Letters 56: 889–892.
Meakin P (1998) Fractals, Scaling and Growth Far from
Equilibrium. Cambridge: Cambridge University Press.
Mehta ML (1991) Random Matrices, 2nd edn. Academic Press.
Myllys M, Maunuksela J, Alava M, Ala-Nissila T, Merikoski J,
and Timonen J Kinetic roughening in slow combustion of
paper. Physical Review E 64: 036101-1–036101-12.
Odlyzko AM and Rains EM On the longest increasing subse-
quences in random permutations. In: Grinberg EL, Berhanu S,
Knopp M, Mendoza G, and Quinto ET (eds.) Analysis,
Geometry, Number Theory: The Mathematics of Leon Ehren-
preis, American Mathematical Society. pp. 439–451.
O’Connell N and Yor M (2002) A representation for non-colliding
random walks. Electronic Communications in Probability 7: 1–12.
Okounkov A (2000) Random matrices and random permutations.
International Mathematics Research Notices 20: 1043–1095.
Porter CE (1965) Statistical Theories of Spectra: Fluctuations.
Academic Press.
Pra
¨hofer M and Spohn H (2000) Universal distributions for
growth processes in 1 þ 1 dimensions and random matrices.
Physical Review Letters 84: 4882–4885.
Soshnikov A (1999) Universality at the edge of the spectrum in
Wigner random matrices. Communications in Mathematical
Physics 207: 697–733.
Integrable Systems in Random Matrix Theory 105