Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers

Abstract

In this paper, we study the trapping problem in two representative polymer networks, Cayley trees and Vicsek fractals, which separately model dendrimers and regular hyperbranched polymers. Our goal is to explore the impact of trap location on the efficiency of trapping in these two important polymer systems, with the efficiency being measured by the average trapping time (ATT) that is the average of source-to-trap mean first-passage time over every staring point in the whole networks. For Cayley trees, we derive an exact analytic formula for the ATT to an arbitrary trap node, based on which we further obtain the explicit expression of ATT for the case that the trap is uniformly distributed. For Vicsek fractals, we provide the closed-form solution for ATT to a peripheral node farthest from the central node, as well as the numerical solutions for the case when the trap is placed on other nodes. Moreover, we derive the exact formula for the ATT corresponding to the trapping problem when the trap has an uniform distribution over all nodes. Our results show that the influence of trap location on the trapping efficiency is completely different for the two polymer networks. In Cayley trees, the leading scaling of ATT increases with the shortest distance between the trap and the central node, implying that trap's position has an essential impact on the trapping efficiency; while in Vicsek fractals, the effect of location of the trap is negligible, since the dominant behavior of ATT is identical, respective of the location where the trap is placed. We also present that for all cases of trapping problems being studied, the trapping process is more efficient in Cayley trees than in Vicsek fractals. We demonstrate that all differences related to trapping in the two polymer systems are rooted in their underlying topological structures.

arXiv commentDefinitive version accepted for publication in The Journal of Chemical Physics

References in corpus (35)

• Intermittent search strategies
• First-passage times in complex scale-invariant media
• Optimal search strategies for hidden targets
• Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
• Global mean first-passage times of random walks on complex networks
• First-passage times for random walks in bounded domains
• First passage time for random walks in heterogeneous networks
• Exact mean first-passage time on the T-graph
• 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
• Random Walks on deterministic Scale-Free networks: Exact results
• Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices
• Exact calculations of first-passage quantities on recursive networks
• Determining mean first-passage time on a class of treelike regular fractals
• Exact solution of mean geodesic distance for Vicsek fractals
• Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees
• Trapping in complex networks
• Trapping in dendrimers and regular hyperbranched polymers
• Effective target arrangement in a deterministic scale-free graph
• Trapping in scale-free networks with hierarchical organization of modularity
• Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence
• Mean first-passage time for random walks on the T-graph
• Close or connected? Distance and connectivity effects on transport in networks
• Random walks in modular scale-free networks with multiple traps
• Trapping time statistics and efficiency of transport of optical excitations in dendrimers
• Role of fractal dimension in random walks on scale-free networks
• Mean first-passage time for random walks in general graphs with a deep trap
• Anomalous behavior of trapping on a fractal scale-free network
• Trapping of Continuous-Time Quantum walks on Erdos-Renyi graphs
• Dynamics of end-linked star polymer structures
• Complete spectrum of stochastic master equation for random walks on treelike fractals
• Random walks in small-world exponential treelike networks
• Optimal scale-free network with a minimum scaling of transport efficiency for random walks with a perfect trap

Cited by in corpus (16)

• Random walks in weighted networks with a perfect trap: An application of Laplacian spectra
• Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications
• Laplacian spectra of recursive treelike small-world polymer networks: Analytical solutions and applications
• Exact results for the first-passage properties in a class of fractal networks
• Controlling the efficiency of trapping in treelike fractals
• Efficiency analysis of diffusion on T-fractals in the sense of random walks
• First encounters on Bethe Lattices and Cayley Trees
• Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees
• Maximal entropy random walk improves efficiency of trapping in dendrimers
• Mixed random walks with a trap in scale-free networks including nearest-neighbor and next-nearest-neighbor jumps
• Mean trapping time for an arbitrary node on regular hyperbranched polymers
• Analysis of fluctuations in the first return times of random walks on regular branched networks
• Random walks in unweighted and weighted modular scale-free networks with a perfect trap
• Effects of node position on diffusion and trapping efficiency for random walks on fractal scale-free trees
• Anomalous behavior of trapping in extended dendrimers with a perfect trap
• Temporal-varying failures of nodes in networks