اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMaximal entropy random walk improves efficiency of trapping in dendrimers
408
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
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 prac
tical 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.
Compact and extended dendrimers are two important classes of dendritic polymers. The impact of the underlying structure of compact dendrimers on dynamical processes has been much studied, yet the relation between the dynamical and structural properti
es of extended dendrimers remains not well understood. In this paper, we study the trapping problem in extended dendrimers with generation-dependent segment lengths, which is different from that of compact dendrimers where the length of the linear segments is fixed. We first consider a particular case that the deep trap is located at the central node, and derive an exact formula for the average trapping time (ATT) defined as the average of the source-to-trap mean first passage time over all starting points. Then, using the obtained result we deduce a closed-form expression for the ATT to an arbitrary trap node, based on which we further obtain an explicit solution to the ATT corresponding to the trapping issue with the trap uniformly distributed in the polymer systems. We show that the trap location has a substantial influence on the trapping efficiency measured by the ATT, which increases with the shortest distance from the trap to the central node, a phenomenon similar to that for compact dendrimers. In contrast to this resemblance, the leading terms of ATTs for the three trapping problems differ drastically between extended and compact dendrimers, with the trapping processes in the extended dendrimers being less efficient than in compact dendrimers.
We perform an in-depth study for mean first-passage time (MFPT)---a primary quantity for random walks with numerous applications---of maximal-entropy random walks (MERW) performed in complex networks. For MERW in a general network, we derive an expli
cit expression of MFPT in terms of the eigenvalues and eigenvectors of the adjacency matrix associated with the network. For MERW in uncorrelated networks, we also provide a theoretical formula of MFPT at the mean-field level, based on which we further evaluate the dominant scalings of MFPT to different targets for MERW in uncorrelated scale-free networks, and compare the results with those corresponding to traditional unbiased random walks (TURW). We show that the MFPT to a hub node is much lower for MERW than for TURW. However, when the destination is a node with the least degree or a uniformly chosen node, the MFPT is higher for MERW than for TURW. Since MFPT to a uniformly chosen node measures real efficiency of search in networks, our work provides insight into general searching process in complex networks.
The random walk with hyperbolic probabilities that we are introducing is an example of stochastic diffusion in a one-dimensional heterogeneous media. Although driven by site-dependent one-step transition probabilities, the process retains some of the
features of a simple random walk, shows other traits that one would associate with a biased random walk and, at the same time, presents new properties not related with either of them. In particular, we show how the system is not fully ergodic, as not every statistic can be estimated from a single realization of the process. We further give a geometric interpretation for the origin of these irregular transition probabilities.
The technique of detecting multiple dim and small targets with low signal-to-clutter ratios (SCR) is very important for infrared search and tracking systems. In this paper, we establish a detection method derived from maximal entropy random walk (MER
W) to robustly detect multiple small targets. Initially, we introduce the primal MERW and analyze the feasibility of applying it to small target detection. However, the original weight matrix of the MERW is sensitive to interferences. Therefore, a specific weight matrix is designed for the MERW in principle of enhancing characteristics of small targets and suppressing strong clutters. Moreover, the primal MERW has a critical limitation of strong bias to the most salient small target. To achieve multiple small targets detection, we develop a hierarchical version of the MERW method. Based on the hierarchical MERW (HMERW), we propose a small target detection method as follows. First, filtering technique is used to smooth the infrared image. Second, an output map is obtained by importing the filtered image into the HMERW. Then, a coefficient map is constructed to fuse the stationary dirtribution map of the HMERW. Finally, an adaptive threshold is used to segment multiple small targets from the fusion map. Extensive experiments on practical data sets demonstrate that the proposed method is superior to the state-of-the-art methods in terms of target enhancement, background suppression and multiple small targets detection.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
