Journal ArticleDOI
Trapping on modular scale-free and small-world networks with multiple hubs
TLDR
A new kind of scale-free and small-world networks with multiple hubs based on classic networks and the growth of MFPT with the traps located on the hub or peripheral nodes displays quite a difference from the single-hub networks.Abstract:
In this paper we introduce a new kind of scale-free and small-world networks with multiple hubs based on classic networks and present the trapping problem on them. We show that in the multiple-hub networks, the growth of MFPT with the traps located on the hub or peripheral nodes displays quite a difference from the single-hub networks. Our conclusions are directed to possible applications in rumor or epidemic spreading phenomena.read more
Citations
More filters
Journal ArticleDOI
Scaling of the average receiving time on a family of weighted hierarchical networks
TL;DR: The analytical expression of the average receiving time (ART) is deduced and it is shown that the smaller the value of θ, the more efficient the process of receiving information.
Journal ArticleDOI
A double-identity rumor spreading model
TL;DR: A double-identity rumor spreading model is established by considering the rumor spreading identities and real-world identities of the rumor creator, the rumor controller and the normal user, and the results show that both elements play important roles in the dynamics of rumor propagation.
Journal ArticleDOI
The modified box dimension and average weighted receiving time of the weighted hierarchical graph
TL;DR: In this article, the modified box dimension of a bipartite weighted hierarchical graph with n = n 1 + n 2 vertices has been derived, where the weights of edges have been assigned to different values with a certain scale.
Journal ArticleDOI
Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk
TL;DR: The average receiving time on weight-dependent walk is studied and it is shown that the ART scaling exhibits a sublinear or linear dependence on network order, which means the weighted polygon Koch networks are more efficient than expended Koch networks in receiving information.
Journal ArticleDOI
Scale-free and small-world properties of a multiple-hub network with fractal structure
TL;DR: A study is presented on some properties of this network, such as the box dimension of the adjacency matrix, degree distribution, average clustering coefficient and average path length, which show the scale-free and small-world effects of thisnetwork.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
The Strength of Weak Ties
TL;DR: In this paper, it is argued that the degree of overlap of two individuals' friendship networks varies directly with the strength of their tie to one another, and the impact of this principle on diffusion of influence and information, mobility opportunity, and community organization is explored.
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Journal ArticleDOI
Error and attack tolerance of complex networks
TL;DR: It is found that scale-free networks, which include the World-Wide Web, the Internet, social networks and cells, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates.