Scaling laws for diffusion on (trans)fractal scale-free networks

Abstract

Fractal (or transfractal) features are common in real-life networks and are known to influence the dynamic processes taking place in the network itself. Here we consider a class of scale-free deterministic networks, called $(u,v)$-flowers, whose topological properties can be controlled by tuning the parameters $u$ and $v$; in particular, for $u>1$, they are fractals endowed with a fractal dimension $d_f$, while for $u=1$, they are transfractal endowed with a transfractal dimension ${\tilde{d}}_f$. In this work we investigate dynamic processes (i.e., random walks) and topological properties (i.e., the Laplacian spectrum) and we show that, under proper conditions, the same scalings (ruled by the related dimensions), emerge for both fractal and transfractal.

15 pages, 7 figures

References in corpus (7)

• First-passage times in complex scale-invariant media
• Fractal and Transfractal Recursive Scale-Free Nets
• Return interval distribution of extreme events and long term memory
• Enumeration of spanning trees in a pseudofractal scale-free web
• Exact calculations of first-passage properties on the pseudofractal scale-free web
• Anomalous behavior of trapping on a fractal scale-free network
• Origin of the hub spectral dimension in scale-free networks

Cited by in corpus (1)

• Exact results for the first-passage properties in a class of fractal networks