Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userImpact of degree heterogeneity on the behavior of trapping in Koch networks
518
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Previous work shows that the mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) in uncorrelated random scale-free networks is closely related to the exponent $gamma$ of power-law degree distribution $P(k)sim k^{-gamma}$, which describes the extent of heterogeneity of scale-free network structure. However, extensive empirical research indicates that real networked systems also display ubiquitous degree correlations. In this paper, we address the trapping issue on the Koch networks, which is a special random walk with one trap fixed at a hub node. The Koch networks are power-law with the characteristic exponent $gamma$ in the range between 2 and 3, they are either assortative or disassortative. We calculate exactly the MFPT that is the average of first-passage time from all other nodes to the trap. The obtained explicit solution shows that in large networks the MFPT varies lineally with node number $N$, which is obviously independent of $gamma$ and is sharp contrast to the scaling behavior of MFPT observed for uncorrelated random scale-free networks, where $gamma$ influences qualitatively the MFPT of trapping problem.
rate research
Read More
We study the extreme events taking place on complex networks. The transport on networks is modelled using random walks and we compute the probability for the occurance and recurrence of extreme events on the network. We show that the nodes with smaller number of links are more prone to extreme events than the ones with larger number of links. We obtain analytical estimates and verify them with numerical simulations. They are shown to be robust even when random walkers follow shortest path on the network. The results suggest a revision of design principles and can be used as an input for designing the nodes of a network so as to smoothly handle an extreme event.
As a fundamental structural transition in complex networks, core percolation is related to a wide range of important problems. Yet, previous theoretical studies of core percolation have been focusing on the classical ErdH{o}s-Renyi random networks with Poisson degree distribution, which are quite unlike many real-world networks with scale-free or fat-tailed degree distributions. Here we show that core percolation can be analytically studied for complex networks with arbitrary degree distributions. We derive the condition for core percolation and find that purely scale-free networks have no core for any degree exponents. We show that for undirected networks if core percolation occurs then it is always continuous while for directed networks it becomes discontinuous when the in- and out-degree distributions are different. We also apply our theory to real-world directed networks and find, surprisingly, that they often have much larger core sizes as compared to random models. These findings would help us better understand the interesting interplay between the structural and dynamical properties of complex networks.
Random walk on discrete lattice models is important to understand various types of transport processes. The extreme events, defined as exceedences of the flux of walkers above a prescribed threshold, have been studied recently in the context of complex networks. This was motivated by the occurrence of rare events such as traffic jams, floods, and power black-outs which take place on networks. In this work, we study extreme events in a generalized random walk model in which the walk is preferentially biased by the network topology. The walkers preferentially choose to hop toward the hubs or small degree nodes. In this setting, we show that extremely large fluctuations in event-sizes are possible on small degree nodes when the walkers are biased toward the hubs. In particular, we obtain the distribution of event-sizes on the network. Further, the probability for the occurrence of extreme events on any node in the network depends on its generalized strength, a measure of the ability of a node to attract walkers. The generalized strength is a function of the degree of the node and that of its nearest neighbors. We obtain analytical and simulation results for the probability of occurrence of extreme events on the nodes of a network using a generalized random walk model. The result reveals that the nodes with a larger value of generalized strength, on average, display lower probability for the occurrence of extreme events compared to the nodes with lower values of generalized strength.
Various coarse-grained models have been proposed to study the spreading dynamics in the network. A microscopic theory is needed to connect the spreading dynamics with the individual behaviors. In this letter, we unify the description of different spreading dynamics on complex networks by decomposing the microscopic dynamics into two basic processes, the aging process and the contact process. A microscopic dynamical equation is derived to describe the dynamics of individual nodes on the network. The hierarchy of a duration coarse-grained (DCG) approach is obtained to study duration-dependent processes, where the transition rates depend on the duration of an individual node on a state. Applied to the epidemic spreading, such formalism is feasible to reproduce different epidemic models, e.g., the susceptible-infected-recovered and the susceptible-infected-susceptible models, and to associate with the corresponding macroscopic spreading parameters with the microscopic transition rate. The DCG approach enables us to obtain the steady state of the general SIS model with arbitrary duration-dependent recovery and infection rates. The current hierarchical formalism can also be used to describe the spreading of information and public opinions, or to model a reliability theory in networks.
By numerical simulations, we investigate the onset of synchronization of networked phase oscillators under two different weighting schemes. In scheme-I, the link weights are correlated to the product of the degrees of the connected nodes, so this kind of networks is named as the weight-degree correlated (WDC) network. In scheme-II, the link weights are randomly assigned to each link regardless of the node degrees, so this kind of networks is named as the weight-degree uncorrelated (WDU) network. Interestingly, it is found that by increasing a parameter that governs the weight distribution, the onset of synchronization in WDC network is monotonically enhanced, while in WDU network there is a reverse in the synchronization performance. We investigate this phenomenon from the viewpoint of gradient network, and explain the contrary roles of coupling gradient on network synchronization: gradient promotes synchronization in WDC network, while deteriorates synchronization in WDU network. The findings highlight the fact that, besides the link weight, the correlation between the weight and node degree is also important to the network dynamics.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
