Deterministic small-world network model based on minimal Cayley graph
CSTR:
Author:
Affiliation:

(1. School of Software Engineering,South China University of Technology,510006 Guangzhou, China; 2. School of Computer Science and Engineering,South China University of Technology,510006 Guangzhou,China)

Clc Number:

TP393.0

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The research on deterministic small-world network model is an important branch of complex network modeling. This paper analyzes the small-world property of the minimal Cayley graph and proposes a deterministic small-world network model based on minimal Cayley graph. The model constructs a class of small-world networks with high symmetry by selecting a minimal Cayley graph, and appropriately expands its generating set. Compared with the existing models, this model can be used flexibly to get small-world networks with const degree or variable degree, which is adaptable for the disign and analysis of the real networks such as communication network and P2P overlay network.

    Reference
    Related
    Cited by
Get Citation
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 17,2013
  • Revised:
  • Adopted:
  • Online: July 30,2014
  • Published:
Article QR Code