Influence Maximization (IM) in Complex Networks with Limited Visibility
Using Statistical Methods
- URL: http://arxiv.org/abs/2208.13166v1
- Date: Sun, 28 Aug 2022 07:55:54 GMT
- Title: Influence Maximization (IM) in Complex Networks with Limited Visibility
Using Statistical Methods
- Authors: aeid Ghafouri, Seyed Hossein Khasteh, Seyed Omid Azarkasb
- Abstract summary: influence literature (IM) problem is known as an NP-complete problem and does not have a solution in time.
Most of the methods proposed to improve this complexity are based on the assumption that the entire graph is visible.
This study is conducted to extend current methods with link prediction techniques to pseudo-visibility graphs.
- Score: 2.320417845168326
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: A social network (SN) is a social structure consisting of a group
representing the interaction between them. SNs have recently been widely used
and, subsequently, have become suitable and popular platforms for product
promotion and information diffusion. People in an SN directly influence each
other's interests and behavior. One of the most important problems in SNs is to
find people who can have the maximum influence on other nodes in the network in
a cascade manner if they are chosen as the seed nodes of a network diffusion
scenario. Influential diffusers are people who, if they are chosen as the seed
set in a publishing issue in the network, that network will have the most
people who have learned about that diffused entity. This is a well-known
problem in literature known as influence maximization (IM) problem. Although it
has been proven that this is an NP-complete problem and does not have a
solution in polynomial time, it has been argued that it has the properties of
sub modular functions and, therefore, can be solved using a greedy algorithm.
Most of the methods proposed to improve this complexity are based on the
assumption that the entire graph is visible. However, this assumption does not
hold for many real-world graphs. This study is conducted to extend current
maximization methods with link prediction techniques to pseudo-visibility
graphs. To this end, a graph generation method called the exponential random
graph model (ERGM) is used for link prediction. The proposed method is tested
using the data from the Snap dataset of Stanford University. According to the
experimental tests, the proposed method is efficient on real-world graphs.
Related papers
- Online Learning Of Expanding Graphs [14.952056744888916]
This paper addresses the problem of online network inference for expanding graphs from a stream of signals.
We introduce a strategy that enables different types of updates for nodes that just joined the network and for previously existing nodes.
arXiv Detail & Related papers (2024-09-13T09:20:42Z) - The Heterophilic Snowflake Hypothesis: Training and Empowering GNNs for Heterophilic Graphs [59.03660013787925]
We introduce the Heterophily Snowflake Hypothesis and provide an effective solution to guide and facilitate research on heterophilic graphs.
Our observations show that our framework acts as a versatile operator for diverse tasks.
It can be integrated into various GNN frameworks, boosting performance in-depth and offering an explainable approach to choosing the optimal network depth.
arXiv Detail & Related papers (2024-06-18T12:16:00Z) - NodeFormer: A Scalable Graph Structure Learning Transformer for Node
Classification [70.51126383984555]
We introduce a novel all-pair message passing scheme for efficiently propagating node signals between arbitrary nodes.
The efficient computation is enabled by a kernerlized Gumbel-Softmax operator.
Experiments demonstrate the promising efficacy of the method in various tasks including node classification on graphs.
arXiv Detail & Related papers (2023-06-14T09:21:15Z) - Neural Graph Revealers [2.2721854258621064]
We propose Neural Graph Revealers (NGRs) to efficiently merge sparse graph recovery methods with Probabilistic Graphical Models.
NGRs view the neural networks as a glass box' or more specifically as a multitask learning framework.
We show experimental results of doing sparse graph recovery and probabilistic inference on data from Gaussian graphical models and a multimodal infant mortality dataset by Centers for Disease Control and Prevention.
arXiv Detail & Related papers (2023-02-27T08:40:45Z) - A Robust Stacking Framework for Training Deep Graph Models with
Multifaceted Node Features [61.92791503017341]
Graph Neural Networks (GNNs) with numerical node features and graph structure as inputs have demonstrated superior performance on various supervised learning tasks with graph data.
The best models for such data types in most standard supervised learning settings with IID (non-graph) data are not easily incorporated into a GNN.
Here we propose a robust stacking framework that fuses graph-aware propagation with arbitrary models intended for IID data.
arXiv Detail & Related papers (2022-06-16T22:46:33Z) - Optimal Propagation for Graph Neural Networks [51.08426265813481]
We propose a bi-level optimization approach for learning the optimal graph structure.
We also explore a low-rank approximation model for further reducing the time complexity.
arXiv Detail & Related papers (2022-05-06T03:37:00Z) - Scaling Graph Neural Networks with Approximate PageRank [64.92311737049054]
We present the PPRGo model which utilizes an efficient approximation of information diffusion in GNNs.
In addition to being faster, PPRGo is inherently scalable, and can be trivially parallelized for large datasets like those found in industry settings.
We show that training PPRGo and predicting labels for all nodes in this graph takes under 2 minutes on a single machine, far outpacing other baselines on the same graph.
arXiv Detail & Related papers (2020-07-03T09:30:07Z) - How hard is to distinguish graphs with graph neural networks? [32.09819774228997]
This study derives hardness results for the classification variant of graph isomorphism in the message-passing model (MPNN)
MPNN encompasses the majority of graph neural networks used today and is universal when nodes are given unique features.
An empirical study involving 12 graph classification tasks and 420 networks reveals strong alignment between actual performance and theoretical predictions.
arXiv Detail & Related papers (2020-05-13T22:28:46Z) - Block-Approximated Exponential Random Graphs [77.4792558024487]
An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs.
We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions.
Our methods are scalable to sparse graphs consisting of millions of nodes.
arXiv Detail & Related papers (2020-02-14T11:42:16Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.