Details

RANGE-BASED GRAPH CLUSTERING

by LUO, YONGFENG

Abstract (Summary)
Small-world networks received more and more attention in different research areas. The research of this phenomenon affects the study of biology, computer networks and many other disciplines due to the good characteristics such as short path length between nodes and robust connectivity. In the paper, a survey on the research of small-world network is given and shortcuts - long range edges ยจC are specially focused. Based on the analysis of this, a range-based graph clustering method, which would nicely show the center, the backbone and infrastructure of large-scaled, complex network in terms of path length and connectivity, is proposed. The case study of uc.edu and oz.uc.edu networks at web page level, which was as a snapshot of each virtual network in March 2000, shows that the range-based graph clustering works well and achieves reasonable results and is helpful in understanding the structure of the web world.
Bibliographical Information:

Advisor:

School:University of Cincinnati

School Location:USA - Ohio

Source Type:Master's Thesis

Keywords:small world networks graph clustering range shortcut

ISBN:

Date of Publication:01/01/2002

© 2009 OpenThesis.org. All Rights Reserved.