Name
Abstract | ||
|---|---|---|
Many real life networks, including the World Wide Web, electric power grids, and social networks, are small-world networks. The two distinguishing characteristics of small-world networks are strong local clustering (nodes have many mutual neighbors), and small average distance between two nodes. Small-world networks are promising candidates for communication networks since typical data-flow patterns in communication networks show a large amount of clustering with a small number of "long- distance" communications that need to be completed quickly. Most previous research on small-world networks has used simulations, probabilistic techniques, and random replacements of edges to study the limiting behaviour of these networks. In this paper, we initiate the study of small-world networks as communication networks using graph-theoretic methods to obtain exact results. We construct networks with strong local clustering and small diameter (instead of average distance). Our networks have the additional property that they are regular. © 2000 Elsevier Science B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0020-0190(00)00118-6 | Inf. Process. Lett. |
Keywords | DocType | Volume |
deterministic small-world communication network,interconnection networks,communication networks,small-world networks,distributed systems,small world networks,world wide web,distributed system,small world network,social network,data flow,electric power | Journal | 76 |
Issue | ISSN | Citations |
1-2 | 0020-0190 | 29 |
PageRank | References | Authors |
4.90 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francesc Comellas | 1 | 155 | 25.07 |
| Javier Ozón | 2 | 34 | 6.06 |
| Joseph G. Peters | 3 | 347 | 38.88 |