A graph model for generating simulated web domains

Modeling web connectivity using web graphs has attracted a lot of commercial and research interests for many years. A realistic and accurate web graph model that captures not only the main features and the underlying structure of the web or a portion of the web has yet to be proven to exist. Such a model is essential and important for designing and testing more effective web search, crawling, and community discovery algorithms. Our p-clique decomposition algorithm supports a new graph model that simulates web domains. The experimental results show that the resulting graph model captures the underlying structure and the main features of web domains. Our p-clique algorithm is shown to be more effective than other widely used pclique decomposition functions.