scholarly journals Emergence of Scale-Free Close-Knit Friendship Structure in Online Social Networks

PLoS ONE ◽  
2012 ◽  
Vol 7 (12) ◽  
pp. e50702 ◽  
Author(s):  
Ai-Xiang Cui ◽  
Zi-Ke Zhang ◽  
Ming Tang ◽  
Pak Ming Hui ◽  
Yan Fu
Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 654 ◽  
Author(s):  
Jebran Khan ◽  
Sungchang Lee

In this paper, we propose a new scale-free social networks (SNs) evolution model that is based on homophily combined with preferential attachments. Our model enables the SN researchers to generate SN synthetic data for the evaluation of multi-facet SN models that are dependent on users’ attributes and similarities. Homophily is one of the key factors for interactive relationship formation in SN. The synthetic graph generated by our model is scale-invariant and has symmetric relationships. The model is dynamic and sustainable to changes in input parameters, such as number of nodes and nodes’ attributes, by conserving its structural properties. Simulation and evaluation of models for large-scale SN applications need large datasets. One way to get SN data is to generate synthetic data by using SN evolution models. Various SN evolution models are proposed to approximate the real-life SN graphs in previous research. These models are based on SN structural properties such as preferential attachment. The data generated by these models is suitable to evaluate SN models that are structure dependent but not suitable to evaluate models which depend on the SN users’ attributes and similarities. In our proposed model, users’ attributes and similarities are utilized to synthesize SN graphs. We evaluated the resultant synthetic graph by analyzing its structural properties. In addition, we validated our model by comparing its measures with the publicly available real-life SN datasets and previous SN evolution models. Simulation results show our resultant graph to be a close representation of real-life SN graphs with users’ attributes.


Author(s):  
Santhoshkumar Srinivasan ◽  
Dhinesh Babu L D

The unprecedented scale of rumor propagation in online social networks urges the necessity of faster rumor identification and control. The identification of rumors in the inception itself is imperative to bring down the harm it could cause to the society at large. But, the available information regarding rumors in inception stages is minimal. To identify rumors with data sparsity, we have proposed a twofold convolutional neural network approach with a new activation function which generalizes faster with higher accuracy. The proposed approach utilizes prominent features such as temporal and content for the classification. This rumor detection method is compared with the state-of-the-art rumor detection approaches and results prove the proposed method identifies rumor earlier than other approaches. Using this approach, the detected rumors with 88% accuracy and 92% precision for experimental datasets is 5% to 35% better than the existing approaches. This automated approach provides better results for larger and scale-free networks.


2014 ◽  
Vol 17 (02) ◽  
pp. 1450008
Author(s):  
MELISSA FALETRA ◽  
NATHAN PALMER ◽  
JEFFREY S. MARSHALL

A mathematical model was developed for opinion propagation on online social networks using a scale-free network with an adjustable clustering coefficient. Connected nodes influence each other when the difference between their opinion values is less than a threshold value. The model is used to examine effectiveness of three different approaches for influencing public opinion. The approaches examined include (1) a "Class", defined as an approach (such as a class or book) that greatly influences a small, randomly selected portion of the population, (2) an "Advertisement", defined as an approach (such as a TV or online advertisement) that has a small influence at each viewing on a large randomly selected portion of the population, and (3) an "App", defined as an approach (such as a Facebook game or smartphone "App") that spreads via the online social network (rather than randomly) and has a small influence at each viewing on the affected population. The Class and Advertisement approaches result in similar overall influence on the population, despite the fact that these approaches are highly different. In contrast, the App approach has a much more significant effect on opinion values of users occupying clusters within the social network compared to the overall population.


2018 ◽  
Vol 29 (09) ◽  
pp. 1850078 ◽  
Author(s):  
Yongcong Luo ◽  
Jing Ma

We explore the impact of positive news on rumor spreading in this paper. It is a fact that most of the rumors related to hot events or emergencies can be propagated rapidly on the hotbed of online social networks. In Chinese words, it is better to divert rather than block. Therefore, we propose the spreading model [Formula: see text] in which positive news is a good factor to guide rumor spreading. Based on transition probability method, we have got the spreading parameters of the [Formula: see text] model by running the rumor spreading process in online social networks with scale-free characteristics. The results give a good proof that improving the activity of the positive news spreader [Formula: see text] derived from the [Formula: see text] model can guide and restrain the spreading speed of rumor smoothly.


PLoS ONE ◽  
2021 ◽  
Vol 16 (8) ◽  
pp. e0253873
Author(s):  
Hanxuan Yang ◽  
Wei Xiong ◽  
Xueliang Zhang ◽  
Kai Wang ◽  
Maozai Tian

Online social networks like Twitter and Facebook are among the most popular sites on the Internet. Most online social networks involve some specific features, including reciprocity, transitivity and degree heterogeneity. Such networks are so called scale-free networks and have drawn lots of attention in research. The aim of this paper is to develop a novel methodology for directed network embedding within the latent space model (LSM) framework. It is known, the link probability between two individuals may increase as the features of each become similar, which is referred to as homophily attributes. To this end, penalized pair-specific attributes, acting as a distance measure, are introduced to provide with more powerful interpretation and improve link prediction accuracy, named penalized homophily latent space models (PHLSM). The proposed models also involve in-degree heterogeneity of directed scale-free networks by embedding with the popularity scales. We also introduce LASSO-based PHLSM to produce an accurate and sparse model for high-dimensional covariates. We make Bayesian inference using MCMC algorithms. The finite sample performance of the proposed models is evaluated by three benchmark simulation datasets and two real data examples. Our methods are competitive and interpretable, they outperform existing approaches for fitting directed networks.


2011 ◽  
Author(s):  
Seokchan Yun ◽  
Heungseok Do ◽  
Jinuk Jung ◽  
Song Mina ◽  
Namgoong Hyun ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document