TitleRandom matrices and random boxes
NameTran, Linh V. (Linh Vinh) (author), Vu, Van (chair), Szemeredi, Endre (internal member), Komlos, Janos (internal member), McKay, Brendan (outside member), Rutgers University, Graduate School - New Brunswick,
DescriptionThis thesis concerns two questions on random structures: the semi-circular law for adjacency matrix of regular random graph and the piercing number for random boxes. Random matrices: We proved in full generality the semi-circular law for random d-regular graph model in the case d tends to infinity as n does. Our result complements the McKay law , which applied for the case d is an absolute constant. Random boxes. Take n random boxes with axis-parallel edges inside the unit cube [0; 1][superscript]d, the piercing number is the minimum number of points needed to pierce all boxes. Using hypergraph setting, we was able to prove a near sharp estimation for the piercing number. This thesis is based on two papers by the author  and  (joint work with Van Vu and Ke Wang).
NoteIncludes bibliographical references
Noteby Linh V. Tran
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.