scholarly journals A Two-Tier Partition Algorithm for the Optimization of the Large-Scale Simulation of Information Diffusion in Social Networks

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 843 ◽  
Author(s):  
Bin Chen ◽  
Hailiang Chen ◽  
Dandan Ning ◽  
Mengna Zhu ◽  
Chuan Ai ◽  
...  
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Online Social Networks ◽  
Load Balance ◽  
Information Diffusion ◽  
Large Scale ◽  
Graph Cut ◽  
Distributed Data ◽  
Large Scale Simulation ◽  
Computational Sociology

As online social networks play a more and more important role in public opinion, the large-scale simulation of social networks has been focused on by many scientists from sociology, communication, informatics, and so on. It is a good way to study real information diffusion in a symmetrical simulation world by agent-based modeling and simulation (ABMS), which is considered an effective solution by scholars from computational sociology. However, on the one hand, classical ABMS tools such as NetLogo cannot support the simulation of more than thousands of agents. On the other hand, big data platforms such as Hadoop and Spark used to study big datasets do not provide optimization for the simulation of large-scale social networks. A two-tier partition algorithm for the optimization of large-scale simulation of social networks is proposed in this paper. First, the simulation kernel of ABMS for information diffusion is implemented based on the Spark platform. Both the data structure and the scheduling mechanism are implemented by Resilient Distributed Data (RDD) to simulate the millions of agents. Second, a two-tier partition algorithm is implemented by community detection and graph cut. Community detection is used to find the partition of high interactions in the social network. A graph cut is used to achieve the goal of load balance. Finally, with the support of the dataset recorded from Twitter, a series of experiments are used to testify the performance of the two-tier partition algorithm in both the communication cost and load balance.

Community Detection and Profiling in Location-Based Social Networks

2014 ◽  
pp. 158-175
Author(s):  
Zhu Wang ◽  
Xingshe Zhou ◽  
Daqing Zhang ◽  
Bin Guo ◽  
Zhiwen Yu
Keyword(s):  
Social Networks ◽  
Social Networking ◽  
Community Detection ◽  
Online Social Networks ◽  
Large Scale ◽  
Recent Progress ◽  
Significant Feature ◽  
Data Set ◽  
Community Profiling ◽  
Location Based Social Networks

Due to the proliferation of GPS-enabled smartphones, Location-Based Social Networking (LBSNs) services have been experiencing a remarkable growth over the last few years. Compared with traditional online social networks, a significant feature of LBSNs is the coexistence of both online and offline social interactions, providing a large-scale heterogeneous social network that is able to facilitate lots of academic studies. One possible study is to leverage both online and offline social ties for the recognition and profiling of community structures. In this chapter, the authors attempt to summarize some recent progress in the community detection problem based on LBSNs. In particular, starting with an empirical analysis on the characters of the LBSN data set, the authors present three different community detection approaches, namely, link-based community detection, content-based community detection, and hybrid community detection based on both links and contents. Meanwhile, they also address the community profiling problem, which is very useful in real-world applications.

Identification of Active Valuable Nodes in Temporal Online Social Network with Attributes

2014 ◽  
Vol 13 (04) ◽  
pp. 839-864 ◽  
Author(s):  
Dehong Qiu ◽  
Hao Li ◽  
Yuan Li
Keyword(s):  
Social Networks ◽  
Structural Properties ◽  
Online Social Networks ◽  
Information Diffusion ◽  
Large Scale ◽  
Online Social Network ◽  
Large Fraction ◽  
Great Expectations ◽  
Spatio Temporal ◽  
Behavioral Attributes

The rapidly growing online social networks have generated great expectations connected with their potential business values. The aim of this paper is to identify the active valuable nodes that can spread business information to a large fraction of the individuals in large-scale temporal online social networks as quickly as possible. Most studies focus on static social networks, the study on the identification of active valuable nodes in temporal online social networks with quantitative attributes is still young. In this paper, we propose a method to identify active valuable nodes based on their static structural properties and temporal behavioral attributes. The method first chooses the candidates of the active valuable nodes by the static analysis of their structural properties. Then, the candidate's behavioral trend is extracted from its activity records. Through analyzing the spatio-temporal characteristics of the behavioral trend, the method distinguishes active valuable nodes from inactive ones and reveals typical evolutionary processes. We perform experiments on two practical online social networks with thousands of nodes. The experimental results demonstrate that the method can identify the active valuable nodes for information diffusion in large-scale temporal online social networks accurately and efficiently. It would be useful for business applications.

scholarly journals Hashkat: large-scale simulations of online social networks

2017 ◽  
Vol 7 (1) ◽  
Author(s):  
Kevin Ryczko ◽  
Adam Domurad ◽  
Nicholas Buhagiar ◽  
Isaac Tamblyn
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
Large Scale ◽  
Large Scale Simulations

Community Detection in Large-Scale Social Networks

2018 ◽  
pp. 189-206 ◽  
Author(s):  
S Rao Chintalapudi ◽  
M. H. M. Krishna Prasad
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Large Scale ◽  
The Other ◽  
Edge Density ◽  
Challenging Problem ◽  
Overlapping Community Detection ◽  
Clustering Problem ◽  
Detection Algorithms ◽  
Overlapping Community

Community Structure is one of the most important properties of social networks. Detecting such structures is a challenging problem in the area of social network analysis. Community is a collection of nodes with dense connections than with the rest of the network. It is similar to clustering problem in which intra cluster edge density is more than the inter cluster edge density. Community detection algorithms are of two categories, one is disjoint community detection, in which a node can be a member of only one community at most, and the other is overlapping community detection, in which a node can be a member of more than one community. This chapter reviews the state-of-the-art disjoint and overlapping community detection algorithms. Also, the measures needed to evaluate a disjoint and overlapping community detection algorithms are discussed in detail.

Information Diffusion in Social Networks

2011 ◽  
pp. 146-163 ◽  
Author(s):  
Dmitry Zinoviev
Keyword(s):  
Social Networks ◽  
Information Flow ◽  
Online Social Networks ◽  
Information Diffusion ◽  
Diffusion Processes ◽  
Small World ◽  
The Social ◽  
Strength Of Weak Ties ◽  
Strategic Position

The issue of information diffusion in small-world social networks was first systematically brought to light by Mark Granovetter in his seminal paper “The Strength of Weak Ties” in 1973 and has been an area of active academic studies in the past three decades. This chapter discusses information proliferation mechanisms in massive online social networks (MOSN). In particular, the following aspects of information diffusion processes are addressed: the role and the strategic position of influential spreaders of information; the pathways in the social networks that serve as conduits for communication and information flow; mathematical models describing proliferation processes; short-term and long-term dynamics of information diffusion, and secrecy of information diffusion.

Sign in / Sign up

Export Citation Format

Share Document