Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCrossover phenomena of percolation transition in evolution networks with hybrid attachment
72
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A first-order percolation transition, called explosive percolation, was recently discovered in evolution networks with random edge selection under a certain restriction. However, the network percolation with more realistic evolution mechanisms such as preferential attachment has not yet been concerned. We propose a tunable network percolation model by introducing a hybrid mechanism of edge selection into the Bohman-Frieze-Wormald model, in which a parameter adjusts the relative weights between random and preferential selections. A large number of simulations indicate that there exist crossover phenomena of percolation transition by adjusting the parameter in the evolution processes. When the strategy of selecting a candidate edge is dominated by random selection, a single discontinuous percolation transition occurs. When a candidate edge is selected more preferentially based on nodes degree, the size of the largest component undergoes multiple discontinuous jumps, which exhibits a peculiar difference from the network percolation of random selection with a certain restriction. Besides, the percolation transition becomes continuous when the candidate edge is selected completely preferentially.
rate research
Read More
Heterogeneous adoption thresholds exist widely in social contagions, but were always neglected in previous studies. We first propose a non-Markovian spreading threshold model with general adoption threshold distribution. In order to understand the effects of heterogeneous adoption thresholds quantitatively, an edge-based compartmental theory is developed for the proposed model. We use a binary spreading threshold model as a specific example, in which some individuals have a low adoption threshold (i.e., activists) while the remaining ones hold a relatively high adoption threshold (i.e., bigots), to demonstrate that heterogeneous adoption thresholds markedly affect the final adoption size and phase transition. Interestingly, the first-order, second-order and hybrid phase transitions can be found in the system. More importantly, there are two different kinds of crossover phenomena in phase transition for distinct values of bigots adoption threshold: a change from first-order or hybrid phase transition to the second-order phase transition. The theoretical predictions based on the suggested theory agree very well with the results of numerical simulations.
In this article we presented a brief study of the main network models with growth and preferential attachment. Such models are interesting because they present several characteristics of real systems. We started with the classical model proposed by Barabasi and Albert: nodes are added to the network connecting preferably to other nodes that are more connected. We also presented models that consider more representative elements from social perspectives, such as the homophily between the vertices or the fitness that each node has to build connections. Furthermore, we showed a version of these models including the Euclidean distance between the nodes as a preferential attachment rule. Our objective is to investigate the basic properties of these networks as distribution of connectivity, degree correlation, shortest path, cluster coefficient and how these characteristics are affected by the preferential attachment rules. Finally, we also provided a comparison of these synthetic networks with real ones. We found that characteristics as homophily, fitness and geographic distance are significant preferential attachment rules to modeling real networks. These rules can change the degree distribution form of these synthetic network models and make them more suitable to model real networks.
In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under attacks. In this model, nodes belonging to the same group survive or fail together. We develop a theoretical framework for this novel group percolation and find that the formation of groups can improve the resilience of interdependent networks significantly. However, the percolation transition is always of first order, regardless of the distribution of group sizes. As an application, we map the interdependent networks with inter-similarity structures, which attract many attentions very recently, onto the group percolation and confirm the non-existence of continuous phase transitions.
Social network is a main tunnel of rumor spreading. Previous studies are concentrated on a static rumor spreading. The content of the rumor is invariable during the whole spreading process. Indeed, the rumor evolves constantly in its spreading process, which grows shorter, more concise, more easily grasped and told. In an early psychological experiment, researchers found about 70% of details in a rumor were lost in the first 6 mouth-to-mouth transmissions cite{TPR}. Based on the facts, we investigate rumor spreading on social networks, where the content of the rumor is modified by the individuals with a certain probability. In the scenario, they have two choices, to forward or to modify. As a forwarder, an individual disseminates the rumor directly to its neighbors. As a modifier, conversely, an individual revises the rumor before spreading it out. When the rumor spreads on the social networks, for instance, scale-free networks and small-world networks, the majority of individuals actually are infected by the multi-revised version of the rumor, if the modifiers dominate the networks. Our observation indicates that the original rumor may lose its influence in the spreading process. Similarly, a true information may turn to be a rumor as well. Our result suggests the rumor evolution should not be a negligible question, which may provide a better understanding of the generation and destruction of a rumor.
Social networks constitute a new platform for information propagation, but its success is crucially dependent on the choice of spreaders who initiate the spreading of information. In this paper, we remove edges in a network at random and the network segments into isolated clusters. The most important nodes in each cluster then form a group of influential spreaders, such that news propagating from them would lead to an extensive coverage and minimal redundancy. The method well utilizes the similarities between the pre-percolated state and the coverage of information propagation in each social cluster to obtain a set of distributed and coordinated spreaders. Our tests on the Facebook networks show that this method outperforms conventional methods based on centrality. The suggested way of identifying influential spreaders thus sheds light on a new paradigm of information propagation on social networks.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
