Related papers: Trapping in complex networks
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
We consider the coherent exciton transport, modeled by continuous-time quantum walks, on Erd\"{o}s-R\'{e}ny graphs in the presence of a random distribution of traps. The role of trap concentration and of the substrate dilution is deepened…
We studied, both analytically and numerically, complex excitable networks, in which connections are time dependent and some of the nodes remain silent at each time step. More specifically, (a) there is a heterogenous distribution of…
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…
Recent studies on the evolutionary dynamics of the Prisoner's Dilemma game in scale-free networks have demonstrated that the heterogeneity of the network interconnections enhances the evolutionary success of cooperation. In this paper we…
Designing optimal structure favorable to diffusion and effectively controlling the trapping process are crucial in the study of trapping problem---random walks with a single trap. In this paper, we study the trapping problem occurring on…
We study the distribution $P(\sigma)$ of the equivalent conductance $\sigma$ for Erd\H{o}s-R\'enyi (ER) and scale-free (SF) weighted resistor networks with $N$ nodes. Each link has conductance $g\equiv e^{-ax}$, where $x$ is a random number…
With a simple attack and repair evolution model, we investigate and compare the stability of the Erdos-Renyi random graphs (RG) and Barabasi-Albert scale-free (SF) networks. We introduce a new quantity, invulnerability I(s), to describe the…
Two stochastic models are proposed to generate a system composed of two interdependent scale-free (SF) or Erd\H{o}s-R\'{e}nyi (ER) networks where interdependent nodes are connected with exponential or power-law relation, as well as…
Complex networks are a great tool for simulating the outcomes of different strategies used within the iterated prisoners' dilemma game. However, because the strategies themselves rely on the connection between nodes, then initial network…
We present a systematic analytical approach to the trapping of a random walk by a finite density rho of diffusing traps in arbitrary dimension d. We confirm the phenomenologically predicted e^{-c_d rho t^{d/2}} time decay of the survival…
We analyzed agent behavior in complex networks: Barab\'asi-Albert (BA), Erdos-R\'enyi (ER), and Watts-Strogatz (WS) models under the following rules: agents (a) randomly select a destination among adjacent nodes; (b) exclude the most…
It is known that the heterogeneity of scale-free networks helps enhancing the efficiency of trapping processes performed on them. In this paper, we show that transport efficiency is much lower in a fractal scale-free network than in…
The robustness of complex networks with dependencies has been studied in recent years. However, previous studies focused on the robustness of networks composed of dependency links without network topology. In this study, we will analyze the…
We study the problem of a particle/message that travels as a biased random walk towards a target node in a network in the presence of traps. The bias is represented as the probability $p$ of the particle to travel along the shortest path to…
Understanding the subgraph distribution in random networks is important for modelling complex systems. In classic Erdos networks, which exhibit a Poissonian degree distribution, the number of appearances of a subgraph G with n nodes and g…
We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution…
Barab\'asi-Albert's `Scale Free' model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however,…
We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…
In this paper, we propose a general framework for the trapping problem on a weighted network with a perfect trap fixed at an arbitrary node. By utilizing the spectral graph theory, we provide an exact formula for mean first-passage time…