Random Apollonian networks with tailored clustering coefficient

Abstract

We introduce a family of complex networks that interpolates between the Apollonian network and its binary version, recently introduced in [Phys. Rev. E \textbf{107}, 024305 (2023)], via random removal of nodes. The dilution process allows the clustering coefficient to vary from $C=0.828$ to $C=0$ while maintaining the behavior of average path length and other relevant quantities as in the deterministic Apollonian network. Robustness against the random deletion of nodes is also reported on spectral quantities such as the ground-state localization degree and its energy gap to the first excited state. The loss of the $2\pi /3$ rotation symmetry as a tree-like network emerges is investigated in the light of the hub wavefunction amplitude. Our findings expose the interplay between the small-world property and other distinctive traits exhibited by Apollonian networks, as well as their resilience against random attacks.

arXiv comment6 pages, 7 figures

References in corpus (16)

• Emergence of scaling in random networks
• Resilience of the Internet to random breakdowns
• Attack vulnerability of complex networks
• Pseudofractal Scale-free Web
• Is the Boston subway a small-world network ?
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Spectra and eigenvectors of scale-free networks
• Complex Networks from Classical to Quantum
• Magnetic models on Apollonian networks
• Coherent transport on Apollonian networks and continuous-time quantum walks
• Small worlds and clustering in spatial networks
• Localization properties of a tight-binding electronic model on the Apollonian network
• Quantum transport with coupled cavities on the Apollonian network
• How the site degree influences quantum probability on inhomogeneous substrates
• Phase transitions and gaps in quantum random energy models
• Binary Apollonian networks