Advertisement

Topology of Cell-Aggregated Planar Graphs

  • Milovan Šuvakov
  • Bosiljka Tadić
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3993)

Abstract

We present new algorithm for growth of non-clustered planar graphs by aggregation of cells with given distribution of size and constraint of connectivity k = 3 per node. The emergent graph structures are controlled by two parameters—chemical potential of the cell aggregation and the width of the cell size distribution. We compute several statistical properties of these graphs—fractal dimension of the perimeter, distribution of shortest paths between pairs of nodes and topological betweenness of nodes and links. We show how these topological properties depend on the control parameters of the aggregation process and discuss their relevance for the conduction of current in self-assembled nanopatterns.

Keywords

Short Path Fractal Dimension Planar Graph Cellular Network Betweenness Centrality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks. Oxford University Press, Oxford (2003)MATHCrossRefGoogle Scholar
  2. 2.
    Boccaleti, S., Latora, V., et al.: Complex Networks: Structure and Dynamics. Physics Reports 424, 175–308 (2006)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Bollobás, B.: Modern Graph Theory. Springer, New York (1998)MATHGoogle Scholar
  4. 4.
    Biely, C., Thurner, S.: Statistical Mechanics of Scale Free Networks at a Critical Point: Complexity Without Irreversibility. cond-mat/0506140Google Scholar
  5. 5.
    Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 46, 167–225 (2003)CrossRefGoogle Scholar
  6. 6.
    Witten, T.A., Sander, L.M.: Diffusion-Limited Aggregation, a Critical Phenomenon. Phys. Rev. Lett. 47, 1400–1403 (1981)CrossRefGoogle Scholar
  7. 7.
    Stavans, J.: Evolution of cellular structures. Rep. Prog. Phys. 56, 733–789 (1993)CrossRefGoogle Scholar
  8. 8.
    Tadić, B.: From Microscopic Rules to Emergent Cooperativity in Large-Scale Patterns. In: Krasnogor, N., Gustafson, S., Pelta, D., Verdegay, J.L. (eds.) Systems Self-Assembly: multidisciplinary snapshots. Elsevier, Amsterdam (2005)Google Scholar
  9. 9.
    Moriarty, P., Taylor, M.D.R., Brust, M.: Nanostructured Cellular Networks. Phys. Rev. Lett. 89, 248303 (2002)CrossRefGoogle Scholar
  10. 10.
    Moriarty, P.: Nanostructured materials. Pep. Prog. Phys. 64, 297–381 (2001)CrossRefGoogle Scholar
  11. 11.
    Šuvakov, M., et al.: (in preparation)Google Scholar
  12. 12.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)Google Scholar
  13. 13.
    Freeman, L.C.: A set of measures of centrality based on beetweenness. Sociometry 40, 35–41 (1977)CrossRefGoogle Scholar
  14. 14.
    Ferry, D.K., Goodnick, S.M.: Transport in Nanostructures. Cambridge University Press, Cambridge (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Milovan Šuvakov
    • 1
  • Bosiljka Tadić
    • 1
  1. 1.Department for Theoretical PhysicsJožef Stefan InstituteLjubljanaSlovenia

Personalised recommendations