Hampson, Christian Paul, authorAchter, Jeff, advisor2024-03-132024-03-132009https://hdl.handle.net/10217/237770Many random network models can be expressed as the product space of the probability space of the individual edges. In these cases, the model can be expressed using a matrix of the probabilities of each edge. I then analyze these models using their respective probability matrices. Degree distribution and the larger eigenvalues are among the attributes whose values can be bound by examining the same attributes of the probability matrix. I also bound the difference between the eigenvalues of the adjacency matrix of a member of a random graph model and the eigenvalues of the probability matrix for the model. In addition I find the neighborhood expansion properties for three separate edge-product models.born digitaldoctoral dissertationsengCopyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright.edge productsprobability matricesrandom graphsmathematicsTextPer the terms of a contractual agreement, all use of this item is limited to the non-commercial use of Colorado State University and its authorized users.