|
Title:
|
A CLIQUE BASED WEB GRAPH MODEL |
|
Author(s):
|
Zhiming Chen, András Faragó |
|
ISBN:
|
978-989-8533-09-8 |
|
Editors:
|
Bebo White and Pedro Isaías |
|
Year:
|
2012 |
|
Edition:
|
Single |
|
Keywords:
|
Web graph, Web mining, Stochastic Model |
|
Type:
|
Full Paper |
|
First Page:
|
331 |
|
Last Page:
|
338 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
The web graph has been the focus of much recent attention with several stochastic models proposed to account for its various properties. To design a model that resembles the complex nature of the web graph is always the aim. We experiment the emergence of cliques in web graph samples and models and a previously ignored nature of web graph is being revealed. Based on many experiments, we find that the clique of Web graph is power law distributed. We also present a clique rank model of the Web graph that can faithfully represent the power law clique distribution, in addition to other properties such as power-law degree distribution, small-world effect, and the existence of many bipartite cliques. |
|
|
|
|
|
|
