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

Abstract

In this work we consider a class of recursively-grown fractal networks $G_n(t)$, whose topology is controlled by two integer parameters $t$ and $n$. We first analyse the structural properties of $G_n(t)$ (including fractal dimension, modularity and clustering coefficient) and then we move to its transport properties. The latter are studied in terms of first-passage quantities (including the mean trapping time, the global mean first-passage time and the Kemeny's constant) and we highlight that their asymptotic behavior is controlled by network's size and diameter. Remarkably, if we tune $n$ (or, analogously, $t$) while keeping the network size fixed, as $n$ increases ($t$ decreases) the network gets more and more clustered and modular, while its diameter is reduced, implying, ultimately, a better transport performance. The connection between this class of networks and models for polymer architectures is also discussed.

14 pages, 4 figures

References in corpus (11)

• Modularity and community structure in networks
• First-passage times in complex scale-invariant media
• Exact mean first-passage time on the T-graph
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• Trapping in dendrimers and regular hyperbranched polymers
• Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
• Exact calculations of first-passage properties on the pseudofractal scale-free web
• Anomalous behavior of trapping on a fractal scale-free network
• Scaling laws for diffusion on (trans)fractal scale-free networks
• Hitting and Trapping Times on Branched Structures
• Mean trapping time for an arbitrary node on regular hyperbranched polymers