Strategy for maximizing information influence in social networks

The article presents a model of information dissemination in social networks. The model takes into account the influence of individuals on the community. The proposed algorithm divides the community into groups of related participants. An appropriate algorithm for finding the most influential agents...

Full description

Saved in:
Bibliographic Details
Main Authors: Lezhnina, E. A., Kalinina, E. A., Karpenko, V. A., Kononov, I. A.
Format: Conference Proceeding
Language:English
Subjects:
Algorithms
Graph theory
Graphical representations
Social networks
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The article presents a model of information dissemination in social networks. The model takes into account the influence of individuals on the community. The proposed algorithm divides the community into groups of related participants. An appropriate algorithm for finding the most influential agents in connected groups is also proposed. Social network participants are modeled as a directed graph with edges representing the relationships between them. The division into groups was carried out using an algorithm for reducing the adjacency matrix of a directed graph.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0210620