Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/1404803.1404828acmconferencesArticle/Chapter ViewAbstractPublication PagesspringsimConference Proceedingsconference-collections
research-article

Understanding the structure of power law networks

Published: 25 March 2007 Publication History

Abstract

The degree distribution of scale-free networks follow power laws. There continues to be disagreement, however, as to what additional properties these networks share. A wide range of techniques useful as aids in understanding common structure as well as in differentiating between elements of this class of networks are explored. First, the utility of a polar coordinate plot for power law distributions is explained. Second, computational experience with two procedures to uncover shortest paths in scale-free networks based solely on locally available data is provided. Next, a tabu search is developed to find high quality solutions for two bi-objective models. For specific objective weights, networks whose degree distributions follow a power law are shown to arise. Lastly, links between the clustering coefficient distribution and modularity are described. Computational experiments supporting the connection between the first nontrivial eigenvalue of a Laplacian matrix and network synchrony are conducted.

References

[1]
Albert, R. and A.-L. Barabási, "Statistical Mechanics of Complex Networks," Rev. Modern Physics, 74:42--47 (2002).
[2]
Atay, F. M. and J. Jost, "Delays, Connection Topology, and Synchronization of Coupled Chaotic Maps," Physical Review Ltrs., 92(14):144101(4) (2004).
[3]
Atay, F. M., T. Biyikoglu and J. Jost, "Synchronization of Networks with Prescribed Degree Distributions," arXiv:nlin.AO/0407024 v2, May (2005).
[4]
Barabási, A.-L., Linked: The New Science of Networks, Perseus, Cambridge, MA, 2002
[5]
Barabási, A.-L., Z. Dezsó, E. Ravasz, S-H. Yook, and Z. Oltvai, "Scale-free and hierarchical structures in complex networks," to appear in Sitges Proceedings on Complex Networks, (2004).
[6]
Barahona, M. and L. M. Pecora, "Synchronization in Small-World Networks," Physical Review Letters, 89, no. 5 (2002).
[7]
Dorogovtsev, S. N. and J. F. F. Mendes, "Evolution of Networks," Advances in Phys., 51:1079--1187 (2002).
[8]
Ferrer-Cancho, R. and R. V. Solé, "Optimization in Complex Networks," Preprint 0111222 (2001) available from http://arxiv.org/abs/cond-mat/.
[9]
Fiedler, M., "Algebraic connectivity of graphs," Czech. Math. Journal, 23, 298--305 (1973).
[10]
Glover, F. "Tabu Search, Part I," ORSA J. on Computing, 1:190--206 (1989).
[11]
Glover, F. and M. Laguna Tabu Search, Kluwer Academic Publishers, Norwell, MA, 1998.
[12]
Gong, P. and C. Van Leeuwen, "Emergence of Scale-Free Network Structure with Chaotic Units," Preprint, Laboratory for Perceptual Dynamics, Japan (2002).
[13]
Holme, P. and B. J. Kim "Growing Scale-free Networks with Tunable Clustering," Physical Review E, 65 (026107) (2002).
[14]
Kincaid, R. K., M. J. Holroyd, and N. Alexandrov "Synchrony and Networks," em NASA TM, (2006).
[15]
Kleinberg, J., "The Small-World Phenomenom: An Algorithmic Perspective," in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM, New York (2000) 163--170.
[16]
Li, L., D. Alderson, R. Tanaka, J. C. Doyle and W. Willinger, "Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications," Preprint 0501169v1 (2005) available at http://arXiv:cond-mat/.
[17]
Li, L., D. Alderson, J. C. Doyle and W. Willinger, "A First-Principles Approach to Understanding the Internet's Router-level Topology" Proc. ACM SIGCOMM (2004).
[18]
Manna, S. S. and A. Kabakcioglu, "Scale-free network on Euclidean space optimized by rewiring of links," J. Phys. A: Math. Gen., 36:279--285 (2003).
[19]
Mathias, N. and V. Gopal, "Small-worlds: How and why," Phys. Rev. E,63:1--20 (2001).
[20]
Milgram, S., Psych. Today, 2:60 (1967).
[21]
Newman, M. E. J., "The Structure and Function of Complex Networks," SIAM Review, 45:167--256 (2003).
[22]
Newman, M. E. J., "Modularity and community structure in networks," PNAS, 103, No. 3, 8577--8582 (2006).
[23]
Solé, R. V., R. Ferrier-Cancho, J. Montoya and S. Valverde, "Selection, Tinkering and Emergence in Complex Networks," Complexity, 8:1--32 (2003).
[24]
Strogatz, S. H., "Exploring Complex Networks," Nature, 410:268--276, March (2001).
[25]
Tadić, B., "Exploring Complex Graphs by Random Walks," in Modeling Complex Systems, P. L. Garrido and J. Marro (eds.), AIP Conference Proceedings, 661, 24 (2002).
[26]
Wang, W-X., B. Hu, B-H. Wang, and G. Yan arXiv: cond-mat/0505419 v1, May (2005).
[27]
Wu, C. W., "Perturbation of Coupling Matrices and Its Effect on the Synchronizability in Arrays of Coupled Chaotic Systems," Preprint 0307052 (2006) available at http://arXiv/pdf/nlin.CD/.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SpringSim '07: Proceedings of the 2007 spring simulation multiconference - Volume 3
March 2007
351 pages
ISBN:1565553144

Sponsors

Publisher

Society for Computer Simulation International

San Diego, CA, United States

Publication History

Published: 25 March 2007

Check for updates

Author Tags

  1. complex system
  2. degree distribution
  3. networks
  4. optimization
  5. scale-free
  6. tabu search

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 158
    Total Downloads
  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media