General Method to Build Deterministic Small-World Networks Based on Cayley Graph

Many real-life networks, such as the WWW, biological realms, and social networks are small-world networks. Most previous researches on small-world networks have been based on probabilistic methods. In this paper, we present a general method by using Cayley graph to build deterministic small-world ne...

Full description

Saved in:
Bibliographic Details
Published in2009 Second International Workshop on Computer Science and Engineering Vol. 1; pp. 493 - 496
Main Authors Zhen Zhang, Wenjun Xiao, Xiaoming Wang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2009
Subjects
Biology
Cayley graph
Clustering
Computer science
Coset Graph
Eigenvalues and eigenfunctions
Integrated circuit interconnections
Interconnection networks
Joining processes
Multiprocessor interconnection networks
Network topology
Power generation
Small-world networks
Social network services
World Wide Web
Online AccessGet full text

Cover

More Information
Summary:Many real-life networks, such as the WWW, biological realms, and social networks are small-world networks. Most previous researches on small-world networks have been based on probabilistic methods. In this paper, we present a general method by using Cayley graph to build deterministic small-world networks. We also analyze the cluster topology of the Cayley graph with small world properties by constructing its left Coset graph. This method has great value in constructing interconnection networks model and analyzing many other real network models.
ISBN:9781424452859
9780769538815
0769538819
1424452856
DOI:10.1109/WCSE.2009.717