Zhuang, Yan2009-01-082009-01-0820082009-01-08http://hdl.handle.net/1828/1327This thesis presents space-efficient algorithms to sample from random web graphs generated by two important stochastic graph models based on concept of copying: the linear copy model and the hostgraph model. The goal is to avoid constructing the entire random graph, and instead use an amount of space nearer to the desired (smaller) sample size. The efficiency of our algorithms is achieved by refraining from making unnecessary random decisions when constructing the sample. The construc- tion of a sample subgraph from a random graph with n nodes and k outgoing links on each node based on the linear copying model uses an expected O(klnn) words for each node in the sample subgraph. The construction of a sample subgraph from a random graph with n nodes based on the hostgraph model uses, for any small sample size, an expected n+o(n) words.enAvailable to the World Wide Webweb graphsamplinggraph modelalgorithmUVic Subject Index::Sciences and Engineering::Applied Sciences::Computer scienceThesisValerie King, Louis Lei Yu, and Yan Zhuang, Guanxi in the chinese web - a study of mutual linking, WWW, 2008, pp. 1161–1162.