University of Patras
Μεγιστοποίηση επιρροής σε δυναμικά κοινωνικά δίκτυα και γράφους, πλήρως και μερικώς παρατηρούμενα
Abstract
dc:descriptionInfluence maximization in dynamic social networks is a critical problem in the study of socialgraphs, with applications in marketing, information diffusion, and public policy. This dissertation analyzes influence maximization in dynamic social networks, considering both fully and partially observable environments. Initially, existing approaches are presented, including Monte Carlosimulation-based and heuristic-based methods, as well as community detection techniques to improve the performance of seed node selection algorithms. This research introduces novel methodologies that combine knowledge from both static and dynamic networks, leveraging community-based information to enhance influence propagation. Additionally, approaches that rely on partially observable environments—where the full network topology is not available—are explored. The advantages and limitations of the proposed algorithms are examined, and their performance is compared against existing methods using simulations and real-world social network data. The experimental results demonstrate that utilizing community structure and targeted network probing can lead to significantly improved influence spread with lower computational costs
Degree
thesis:*- Grantor dc:publisher
- University of Patras
- Year dc:date
- 2025
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Smani, Gkolfo
- Σμάνη, Γκόλφω
Subjects
dc:subject × 38- Μεγιστοποίηση επιρροής
- Γράφοι
- Θεωρία γράφων
- Διάχυση πληροφορίας
- Δυναμικά κοινωνικά δίκτυα
- Κοινωνική επιρροή
- Αριθμός πυρήνα
- Αποσύνθεση k-core
- Αποσύνθεση K-truss
- Κοινότητες truss
- Ανίχνευση κοινοτήτων
- Αλγόριθμος greedy
- Ευρετικές μέθοδοι
- Μερικώς παρατηρoύμενα δίκτυα
- Πλήρως παρατηρούμενα δίκτυα
- Maximization influence
- Graphs
- Graph theory
- Diffusion
- Probing
- Dynamic social networks
- Social influence
- Core number
- k-core decomposition
- Trussness
- K-truss decomposition
- Truss communities
- Greedy algorithm
- Community detection
- Heuristic methods
- Partially observed networks
- Fully observed networks
- Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική
- Φυσικές Επιστήμες
- Δίκτυα ηλεκτρονικών υπολογιστών και Επικοινωνίες
- Computer and Information Sciences
- Natural Sciences
- Computer Networks and Communications
Rights
- Language dc:language
- gre
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/59913