Ấn phẩm:
Random walks on the dihedral group and abelian groups
Đang tải...
Xem mô tả
126
Xem & Tải
2
Nhan đề khác
Tóm tắt
In 1988 Persi Diaconis considered the following random walk on Zn. Pick k values from Zitand then repeatedly choose one of these values at random. This choice determines a random walk starting at 0 and the natural question that arises is, how long does it take the walk to get close to uniformly distributed on Zn for "most" choices of the k values. In 1989 A. Greenhalgh, in his thesis, gave a lower bound for a random walk on Zn. A paper written by J. Dai and M. Hildebrand in 1997 considered random walks on Zn without restrictions on n and in the case where k is a constant. It is important to note that the set of k values were chosen at random but were subject to certain divisibility restrictions. With these restrictions, it will take slightly over n2/('-') steps for the position of the typical random walk to be close to uniformly distributed on Z n. Using the same divisibility restriction this thesis will find a similar bound for a random walk on Zp x Z where p is a constant.
In 1992 C. Dou considered some cases of the random walk on an abelian group of order n where n is not prime, but instead n = pi...pt where t is no more than a constant. The pi, , pt are all prime, with pi > .. > pt and pi < Apt for some constant A. We will show that if you relax some of the conditions that Dou had on G, in, and A then we can extend his work to include more examples that Dou's restrictions could not.
In 1997 Farid Bassiri in his thesis proved some bounds on a random walk on the dihedral group. This thesis will give a comprehensive study of the random walks on the dihedral group generated by a k-subset.
Tác giả
McCollum, Joseph P.
Người hướng dẫn
Nơi xuất bản
Nhà xuất bản
State University of New York
Năm xuất bản
2006
ISSN tạp chí
Nhan đề tập
Từ khóa chủ đề
Tập hợp (Toán học) , Dihedral Group , Abelian Groups