Binary Apollonian networks

Abstract

There is a well-known relationship between the binary Pascal's triangle and Sierpinski triangle in which the latter obtained from the former by successive modulo 2 additions on one of its corners. Inspired by that, we define a binary Apollonian network and obtain two structures featuring a kind of dendritic growth. They are found to inherit the small-world and scale-free property from the original network but display no clustering. Other key network properties are explored as well. Our results reveal that the structure contained in the Apollonian network may be employed to model an even wider class of real-world systems.

References in corpus (3)

• Coherent transport on Apollonian networks and continuous-time quantum walks
• Ising model on the Apollonian network with node dependent interactions
• Localization properties of a tight-binding electronic model on the Apollonian network

Cited by in corpus (1)

• Random Apollonian networks with tailored clustering coefficient