Trapping in dendrimers and regular hyperbranched polymers

Abstract

Dendrimers and regular hyperbranched polymers are two classic families of macromolecules, which can be modeled by Cayley trees and Vicsek fractals, respectively. In this paper, we study the trapping problem in Cayley trees and Vicsek fractals with different underlying geometries, focusing on a particular case with a perfect trap located at the central node. For both networks, we derive the exact analytic formulas in terms of the network size for the average trapping time (ATT)---the average of node-to-trap mean first-passage time over the whole networks. The obtained closed-form solutions show that for both Cayley trees and Vicsek fractals, the ATT display quite different scalings with various system sizes, which implies that the underlying structure plays a key role on the efficiency of trapping in polymer networks. Moreover, the dissimilar scalings of ATT may allow to differentiate readily between dendrimers and hyperbranched polymers.

Definitive version accepted for publication in The Journal of Chemical Physics

References in corpus (9)

• Exact mean first-passage time on the T-graph
• Laplacian spectra of complex networks and random walks on them: Are scale-free architectures really important?
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• Occupation times of random walks in confined geometries: From random trap model to diffusion limited reactions
• Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
• Coherent exciton transport in dendrimers and continuous-time quantum walks
• Determining mean first-passage time on a class of treelike regular fractals
• Exact solution of mean geodesic distance for Vicsek fractals
• Trapping in complex networks

Cited by in corpus (8)

• Random walks on weighted networks
• Laplacian spectra of recursive treelike small-world polymer networks: Analytical solutions and applications
• Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
• Mean first-passage time for random walks in general graphs with a deep trap
• Extended Vicsek fractals: Laplacian spectra and their applications
• Maximal entropy random walk improves efficiency of trapping in dendrimers
• Mean trapping time for an arbitrary node on regular hyperbranched polymers
• Optimal scale-free network with a minimum scaling of transport efficiency for random walks with a perfect trap