scholarly journals Strengthening ties towards a highly-connected world

2022 ◽  
Author(s):  
Antonis Matakos ◽  
Aristides Gionis
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
Constant Factor ◽  
Algorithmic Problem ◽  
Full Potential ◽  
User Engagement ◽  
Scalable Algorithms ◽  
Special Cases ◽  
Access Information ◽  
Flow Of Information

AbstractOnline social networks provide a forum where people make new connections, learn more about the world, get exposed to different points of view, and access information that were previously inaccessible. It is natural to assume that content-delivery algorithms in social networks should not only aim to maximize user engagement but also to offer opportunities for increasing connectivity and enabling social networks to achieve their full potential. Our motivation and aim is to develop methods that foster the creation of new connections, and subsequently, improve the flow of information in the network. To achieve our goal, we propose to leverage the strong triadic closure principle, and consider violations to this principle as opportunities for creating more social links. We formalize this idea as an algorithmic problem related to the densest k-subgraph problem. For this new problem, we establish hardness results and propose approximation algorithms. We identify two special cases of the problem that admit a constant-factor approximation. Finally, we experimentally evaluate our proposed algorithm on real-world social networks, and we additionally evaluate some simpler but more scalable algorithms.

A distributional semantics-based information retrieval framework for online social networks

2021 ◽  
pp. 1-11
Author(s):  
V.S. Anoop ◽  
P. Deepak ◽  
S. Asharaf
Keyword(s):  
Social Networks ◽  
Information Retrieval ◽  
Online Social Networks ◽  
Latent Dirichlet Allocation ◽  
Relevant Information ◽  
Distributional Semantics ◽  
Scalable Algorithms ◽  
Mobile Platforms ◽  
Cancer Support ◽  
Efficient Extraction

Online social networks are considered to be one of the most disruptive platforms where people communicate with each other on any topic ranging from funny cat videos to cancer support. The widespread diffusion of mobile platforms such as smart-phones causes the number of messages shared in such platforms to grow heavily, thus more intelligent and scalable algorithms are needed for efficient extraction of useful information. This paper proposes a method for retrieving relevant information from social network messages using a distributional semantics-based framework powered by topic modeling. The proposed framework combines the Latent Dirichlet Allocation and distributional representation of phrases (Phrase2Vec) for effective information retrieval from online social networks. Extensive and systematic experiments on messages collected from Twitter (tweets) show this approach outperforms some state-of-the-art approaches in terms of precision and accuracy and better information retrieval is possible using the proposed method.

Influence and Information Flow in Online Social Networks

2017 ◽  
Vol 9 (4) ◽  
pp. 1-17
Author(s):  
Afrand Agah ◽  
Mehran Asadi
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
Large Data ◽  
Marketing Strategies ◽  
Large Data Sets ◽  
Divide And Conquer ◽  
Data Sets ◽  
Divide And Conquer Algorithm ◽  
Flow Of Information

This article introduces a new method to discover the role of influential people in online social networks and presents an algorithm that recognizes influential users to reach a target in the network, in order to provide a strategic advantage for organizations to direct the scope of their digital marketing strategies. Social links among friends play an important role in dictating their behavior in online social networks, these social links determine the flow of information in form of wall posts via shares, likes, re-tweets, mentions, etc., which determines the influence of a node. This article initially identities the correlated nodes in large data sets using customized divide-and-conquer algorithm and then measures the influence of each of these nodes using a linear function. Furthermore, the empirical results show that users who have the highest influence are those whose total number of friends are closer to the total number of friends of each node divided by the total number of nodes in the network.

Influence and Information Flow in Online Social Networks

2021 ◽  
pp. 502-520
Author(s):  
Afrand Agah ◽  
Mehran Asadi
Keyword(s):  
Social Networks ◽  
Information Flow ◽  
Online Social Networks ◽  
Large Data ◽  
Marketing Strategies ◽  
Divide And Conquer ◽  
Data Sets ◽  
Divide And Conquer Algorithm ◽  
Flow Of Information

This article introduces a new method to discover the role of influential people in online social networks and presents an algorithm that recognizes influential users to reach a target in the network, in order to provide a strategic advantage for organizations to direct the scope of their digital marketing strategies. Social links among friends play an important role in dictating their behavior in online social networks, these social links determine the flow of information in form of wall posts via shares, likes, re-tweets, mentions, etc., which determines the influence of a node. This article initially identities the correlated nodes in large data sets using customized divide-and-conquer algorithm and then measures the influence of each of these nodes using a linear function. Furthermore, the empirical results show that users who have the highest influence are those whose total number of friends are closer to the total number of friends of each node divided by the total number of nodes in the network.

scholarly journals Social influence and unfollowing accelerate the emergence of echo chambers

2020 ◽  
Author(s):  
Kazutoshi Sasahara ◽  
Wen Chen ◽  
Hao Peng ◽  
Giovanni Luca Ciampaglia ◽  
Alessandro Flammini ◽  
...  
Keyword(s):  
Social Networks ◽  
Social Media ◽  
Online Social Networks ◽  
Mitigation Strategies ◽  
Social Connections ◽  
Online Social Media ◽  
The Social ◽  
Model Dynamics ◽  
Echo Chambers ◽  
Access Information

Abstract While social media make it easy to connect with and access information from anyone, they also facilitate basic influence and unfriending mechanisms that may lead to segregated and polarized clusters known as “echo chambers.” Here we study the conditions in which such echo chambers emerge by introducing a simple model of information sharing in online social networks with the two ingredients of influence and unfriending. Users can change both their opinions and social connections based on the information to which they are exposed through sharing. The model dynamics show that even with minimal amounts of influence and unfriending, the social network rapidly devolves into segregated, homogeneous communities. These predictions are consistent with empirical data from Twitter. Although our findings suggest that echo chambers are somewhat inevitable given the mechanisms at play in online social media, they also provide insights into possible mitigation strategies.

Analysis of User Interactions in Online Social Networks

2011 ◽  
Author(s):  
Seokchan Yun ◽  
Heungseok Do ◽  
Jinuk Jung ◽  
Song Mina ◽  
Namgoong Hyun ◽  
...  
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
User Interactions
Sign in / Sign up

Export Citation Format

Share Document