Hierarchical deposition and scale-free networks: a visibility algorithm approach

Abstract

The growth of an interface formed by the hierarchical deposition of particles of unequal size is studied in the framework of a dynamical network generated by a horizontal visibility algorithm. For a deterministic model of the deposition process, the resulting network is scale-free with dominant degree exponent ${\gamma }_e=\ln 3/\ln 2$ and transient exponent ${\gamma }_o=1$. An exact calculation of the network diameter and clustering coefficient reveals that the network is scale invariant and inherits the modular hierarchical nature of the deposition process. For the random process, the network remains scale free, where the degree exponent asymptotically converges to $\gamma =3$, independent of the system parameters. This result shows that the model is in the class of fractional Gaussian noise (fGn) through the relation between the degree exponent and the series' Hurst exponent $H$. Finally, we show through the degree-dependent clustering coefficient $C(k)$ that the modularity remains present in the system.

v2: expanded to include random model; removed Supplemental Material

References in corpus (5)

• Power-law distributions in empirical data
• From time series to complex networks: the visibility graph
• The Kardar-Parisi-Zhang exponents for the $2+1$ dimensions
• Revisiting random deposition with surface relaxation: approaches from growth rules to Edwards-Wilkinson equation
• Coastlines and percolation in a model for hierarchical random deposition