Topology of Cell-Aggregated Planar Graphs
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.
KeywordsShort Path Fractal Dimension Planar Graph Cellular Network Betweenness Centrality
- 4.Biely, C., Thurner, S.: Statistical Mechanics of Scale Free Networks at a Critical Point: Complexity Without Irreversibility. cond-mat/0506140Google Scholar
- 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
- 11.Šuvakov, M., et al.: (in preparation)Google Scholar
- 12.Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)Google Scholar