Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userControlling the efficiency of trapping in treelike fractals
96
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Efficiently controlling the trapping process, especially the trapping efficiency, is central in the study of trap problem in complex systems, since it is a fundamental mechanism for diverse other dynamic processes. Thus, it is of theoretical and practical significance to study the control technique for trapping problem. In this paper, we study the trapping problem in a family of proposed directed fractals with a deep trap at a central node. The directed fractals are a generalization of previous undirected fractals by introducing the directed edge weights dominated by a parameter. We characterize all the eigenvalues and their degeneracies for an associated matrix governing the trapping process. The eigenvalues are provided through an exact recursive relation deduced from the self-similar structure of the fractals. We also obtain the expressions for the smallest eigenvalue and the mean first-passage time (MFPT) as a measure of trapping efficiency, which is the expected time for the walker to first visit the trap. The MFPT is evaluated according to the proved fact that it is approximately equal to reciprocal of the smallest eigenvalue. We show that the MFPT is controlled by the weight parameter, by modifying which, the MFPT can scale superlinealy, linearly, or sublinearly with the system size. Thus, this work paves a way to delicately controlling the trapping process in the fractals.
rate research
Read More
We use maximal entropy random walk (MERW) to study the trapping problem in dendrimers modeled by Cayley trees with a deep trap fixed at the central node. We derive an explicit expression for the mean first passage time from any node to the trap, as well as an exact formula for the average trapping time (ATT), which is the average of the source-to-trap mean first passage time over all non-trap starting nodes. Based on the obtained closed-form solution for ATT, we further deduce an upper bound for the leading behavior of ATT, which is the fourth power of $ln N$, where $N$ is the system size. This upper bound is much smaller than the ATT of trapping depicted by unbiased random walk in Cayley trees, the leading scaling of which is a linear function of $N$. These results show that MERW can substantially enhance the efficiency of trapping performed in dendrimers.
Extended Vicsek fractals (EVF) are the structures constructed by introducing linear spacers into traditional Vicsek fractals. Here we study the Laplacian spectra of the EVF. In particularly, the recurrence relations for the Laplacian spectra allow us to obtain an analytic expression for the sum of all inverse nonvanishing Laplacian eigenvalues. This quantity characterizes the large-scale properties, such as the gyration radius of the polymeric structures, or the global mean-first passage time for the random walk processes. Introduction of the linear spacers leads to local heterogeneities, which reveal themselves, for example, in the dynamics of EVF under external forces.
Using a classical master equation that describes energy transfer over a given lattice, we explore how energy transfer efficiency along with the photon capturing ability depends on network connectivity, on transfer rates, and on volume fractions - the numbers and relative ratio of fluorescence chromophore components, e.g., donor (D), acceptor (A), and bridge (B) chromophores. For a one-dimensional AD array, the exact analytical expression for efficiency shows a steep increase with a D-to-A transfer rate when a spontaneous decay is sufficiently slow. This result implies that the introduction of B chromophores can be a useful method for improving efficiency for a two-component AD system with inefficient D-to-A transfer and slow spontaneous decay. Analysis of this one-dimensional system can be extended to higher-dimensional systems with chromophores arranged in structures such as a helical or stacked-disk rod, which models the self-assembling monomers of the tobacco mosaic virus coat protein. For the stacked-disk rod, we observe the following: (1) With spacings between sites fixed, a staggered conformation is more efficient than an eclipsed conformation. (2) For a given ratio of A and D chromophores, the uniform distribution of acceptors that minimizes the mean first passage time to acceptors is a key point to designing the optimal network for a donor-acceptor system with a relatively small D-to-A transfer rate. (3) For a three-component ABD system with a large B-to-A transfer rate, a key design strategy is to increase the number of the pathways in accordance with the directional energy flow from D to B to A chromophores.
We apply the Principle of Maximum Entropy to the study of a general class of deterministic fractal sets. The scaling laws peculiar to these objects are accounted for by means of a constraint concerning the average content of information in those patterns. This constraint allows for a new statistical characterization of fractal objects and fractal dimension.
We study the problem of random search in finite networks with a tree topology, where it is expected that the distribution of the first-passage time F(t) decays exponentially. We show that the slope of the exponential tail is independent of the initial conditions of entering the tree in general, and scales exponentially or as a power law with the extent of the tree L, depending on the tendency p to jump toward the target node. It is unfeasible to uniquely determine L and p from measuring the tail slope or the mean first-passage time (MFPT) of an ordinary diffusion along the tree. To unravel the structure, we consider lazy random walkers that take steps with probability m when jumping on the nodes and return with probability q from the leaves. By deriving an exact analytical expression for the MFPT of the intermittent random walk, we verify that the structural information of the tree can be uniquely extracted by measuring the MFPT for two randomly chosen types of tracer particles with distinct experimental parameters m and q. We also address the applicability of our approach in the presence of disorder in the structure of the tree or statistical uncertainty in the experimental parameters.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
