2009/05/31 by Zhongzhi Zhang, Jihong Guan, Bailu Ding +2 · 10 citations
Computer Science · Engineering · Physics and Astronomy · #Cluster analysis #Complex network #Degree (music) #Interconnection Networks and Systems #Path (computing) #Planar #Robustness (evolution) #Slime Mold and Myxomycetes Research #Topology (electrical circuits) #VLSI and FPGA Design Techniques #cond-mat.stat-mech
paper · pdf · open access · doi:10.1088/1367-2630/11/8/083007
published in New Journal of Physics 11(8), 083007 (IOP Publishing) · 12 pages, 7 figures. Definitive version accepted for publication in New Journal of Physics
arxiv created 2009/07/19 · openalex publication_date 2009/08/04 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
Spatially constrained planar networks are frequently encountered in real-life systems. In this paper, based on a space-filling disk packing we propose a minimal model for spatial maximal planar networks, which is similar to but different from the model for Apollonian networks [J. S. Andrade, Jr. et al., Phys. Rev. Lett. \bf 94, 018702 (2005)]. We present an exhaustive analysis of various properties of our model, and obtain the analytic solutions for most of the features, including degree distribution, clustering coefficient, average path length, and degree correlations. The model recovers some striking generic characteristics observed in most real networks. To address the robustness of the relevant network properties, we compare the structural features between the investigated network and the Apollonian networks. We show that topological properties of the two networks are encoded in the way of disk packing. We argue that spatial constrains of nodes are relevant to the structure of the networks.