Influence of Influence on Social Networks: Information Propagation Causes Dynamic Networks

2021 ◽  
Author(s):  
Qiang Li ◽  
Haohua Du ◽  
Xiang-Yang Li
Keyword(s):  
Social Networks ◽  
Dynamic Networks ◽  
Information Propagation

Community detection in social networks based on information propagation and user engagement

2021 ◽  
pp. 2150119
Author(s):  
Fuzhong Nian ◽  
Li Luo ◽  
Xuelong Yu ◽  
Xin Guo
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Detection Method ◽  
User Engagement ◽  
Connection Strength ◽  
Information Propagation ◽  
Edge Strength ◽  
Strength Based ◽  
Network Propagation ◽  
Overlapping Community

The iterative propagation of information between nodes will strengthen the connection strength between nodes, and the network can evolve into different groups according to difference edge strength. Based on this observation, we present the user engagement to quantify the influences of users different propagation modes to network propagation, and construct weight network to simulate real social network, and proposed the community detection method in social networks based on information propagation and user engagement. Our method can produce different scale communities and overlapping community. We also applied our method to real-world social networks. The experiment proved that the network spread and the community division interact with each other. The community structure is significantly different in the network propagation of different scales.

scholarly journals A Bio-Inspired Defensive Rumor Confinement Strategy in Online Social Networks

2021 ◽  
Vol 33 (1) ◽  
pp. 47-70
Author(s):  
Santhoshkumar Srinivasan ◽  
Dhinesh Babu L. D.
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
Propagation Model ◽  
Information Propagation ◽  
Control Approach ◽  
Rumor Propagation ◽  
Immunization Strategies ◽  
New Information ◽  
The Individual ◽  
Rumor Control

Online social networks (OSNs) are used to connect people and propagate information around the globe. Along with information propagation, rumors also penetrate across the OSNs in a massive order. Controlling the rumor propagation is utmost important to reduce the damage it causes to society. Educating the individual participants of OSNs is one of the effective ways to control the rumor faster. To educate people in OSNs, this paper proposes a defensive rumor control approach that spreads anti-rumors by the inspiration from the immunization strategies of social insects. In this approach, a new information propagation model is defined to study the defensive nature of true information against rumors. Then, an anti-rumor propagation method with a set of influential spreaders is employed to defend against the rumor. The proposed approach is compared with the existing rumor containment approaches and the results indicate that the proposed approach works well in controlling the rumors.

Coupling entropy of co-processing model on social networks

2015 ◽  
Vol 29 (25) ◽  
pp. 1550149
Author(s):  
Zhanli Zhang
Keyword(s):  
Social Networks ◽  
Information Flow ◽  
Structural Characteristics ◽  
Time Lag ◽  
Optimal Routing ◽  
Information Propagation ◽  
Time Processing ◽  
Scale Free ◽  
Routing Strategy ◽  
Processing Ability

Coupling entropy of co-processing model on social networks is investigated in this paper. As one crucial factor to determine the processing ability of nodes, the information flow with potential time lag is modeled by co-processing diffusion which couples the continuous time processing and the discrete diffusing dynamics. Exact results on master equation and stationary state are achieved to disclose the formation. In order to understand the evolution of the co-processing and design the optimal routing strategy according to the maximal entropic diffusion on networks, we propose the coupling entropy comprehending the structural characteristics and information propagation on social network. Based on the analysis of the co-processing model, we analyze the coupling impact of the structural factor and information propagating factor on the coupling entropy, where the analytical results fit well with the numerical ones on scale-free social networks.

Density-based Approach with Dual Optimization for Tracking Community Structure of Increasing Social Networks

2020 ◽  
Vol 29 (01) ◽  
pp. 2050002
Author(s):  
Fariza Bouhatem ◽  
Ali Ait El Hadj ◽  
Fatiha Souam
Keyword(s):  
Social Networks ◽  
Community Structure ◽  
Rapid Detection ◽  
Dynamic Networks ◽  
Rapid Evolution ◽  
Limit Problem ◽  
Resolution Limit ◽  
Normalized Mutual Information ◽  
Information Number ◽  
Modularity Density

The rapid evolution of social networks in recent years has focused the attention of researchers to find adequate solutions for the management of these networks. For this purpose, several efficient algorithms dedicated to the tracking and the rapid detection of the community structure have been proposed. In this paper, we propose a novel density-based approach with dual optimization for tracking community structure of increasing social networks. These networks are part of dynamic networks evolving by adding nodes with their links. The local optimization of the density makes it possible to reduce the resolution limit problem generated by the optimization of the modularity. The presented algorithm is incremental with a relatively low algorithmic complexity, making it efficient and faster. To demonstrate the effectiveness of our method, we test it on social networks of the real world. The experimental results show the performance and efficiency of our algorithm measured in terms of modularity density, modularity, normalized mutual information, number of communities discovered, running time and stability of communities.

Identifying influential nodes in dynamic social networks based on degree-corrected stochastic block model

2016 ◽  
Vol 30 (16) ◽  
pp. 1650092 ◽  
Author(s):  
Tingting Wang ◽  
Weidi Dai ◽  
Pengfei Jiao ◽  
Wenjun Wang
Keyword(s):  
Social Networks ◽  
Real World ◽  
Dynamic Networks ◽  
Dynamic Network ◽  
Community Structures ◽  
Block Model ◽  
Real World Data ◽  
Stochastic Block Model ◽  
Dynamic Social Networks ◽  
Influential Nodes

Many real-world data can be represented as dynamic networks which are the evolutionary networks with timestamps. Analyzing dynamic attributes is important to understanding the structures and functions of these complex networks. Especially, studying the influential nodes is significant to exploring and analyzing networks. In this paper, we propose a method to identify influential nodes in dynamic social networks based on identifying such nodes in the temporal communities which make up the dynamic networks. Firstly, we detect the community structures of all the snapshot networks based on the degree-corrected stochastic block model (DCBM). After getting the community structures, we capture the evolution of every community in the dynamic network by the extended Jaccard’s coefficient which is defined to map communities among all the snapshot networks. Then we obtain the initial influential nodes of the dynamic network and aggregate them based on three widely used centrality metrics. Experiments on real-world and synthetic datasets demonstrate that our method can identify influential nodes in dynamic networks accurately, at the same time, we also find some interesting phenomena and conclusions for those that have been validated in complex network or social science.

Who Knows Your HIV Status II?: Information Propagation Within Social Networks of Seropositive People

2006 ◽  
Vol 65 (4) ◽  
pp. 430-444 ◽  
Author(s):  
Gene A. Shelley ◽  
Peter D. Killworth ◽  
H. Russell Bernard ◽  
Christopher McCarty ◽  
Eugene C. Johnsen ◽  
...  
Keyword(s):  
Social Networks ◽  
Information Propagation ◽  
Hiv Status
Sign in / Sign up

Export Citation Format

Share Document