Next: Major Findings
Up: Index
Previous: Introduction
Plotting the eigenvalues of a random
permutation matrix can be compared with
plotting
points chosen independently and uniformly from the set of all points on the unit
circle. When points are chosen at random according to the uniform distribution on the circle,
the probability of picking any particular point
is 0. The eigenvalues of permutation matrices,
however, occur only at certain values of
, so the probability of choosing one of
these points is positive, while the probability for any other point is 0.
In particular, if
is an eigenvalue of an
permutation matrix, then
must be a rational number with denominator no greater than
.
It is known (see, for example, Goncharov [2], or Shepp and Lloyd [4])
that the average number of eigenvalues at a point
on the unit circle
(where
and
are relatively prime integers) grows as
.
(It will be useful to keep these facts in mind for some of
the discussions in the following sections.) This behavior is quite different from the
uniform case, which must be interpreted in terms of some interval on the circle rather
than at individual points.
When
points are chosen independently and uniformly, the fraction of points landing in a
given interval will, on average, equal the ratio of the length of the interval to the
circumference of the circle. By defining
(as in the introduction) to have a length
of
, the average number of points landing in the interval
, if picked
independently, would have the constant value
, regardless of the value of
. In
fact, the number of points landing in the interval has a binomial distribution with
parameters
, and the distribution converges to Poisson with parameter
as
. One goal of this project was to investigate how the
distribution of eigenvalues landing in
might compare with the distribution of points in this simpler situation.
Next: Major Findings
Up: Index
Previous: Introduction
Nathaniel Blair-Stahn
2003-08-29