Identify multiple seeds for influence maximization by statistical physics approach and multi-hop coverage
Abstract Finding the influential vertexes as seeds in a real network is an important problem which relates to wide applications. However, some conventional heuristic methods do not consider the overlap phenomenon. In order to avoid the overlap of spreading, we propose a new method in combing the sta...
Main Authors: | Fuxuan Liao, Yukio Hayashi |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2022-07-01
|
Series: | Applied Network Science |
Subjects: | |
Online Access: | https://doi.org/10.1007/s41109-022-00491-x |
Similar Items
-
Efficient Processing of <i>k</i>-Hop Reachability Queries on Directed Graphs
by: Xian Tang, et al.
Published: (2023-03-01) -
Estimations of Covering Functionals of Convex Bodies Based on Relaxation Algorithm
by: Man Yu, et al.
Published: (2023-04-01) -
Solving Some Graph Problems in Composite 3D Printing Using Spreadsheet Modeling
by: Larysa Hlinenko, et al.
Published: (2023-07-01) -
Using Weighted Maximal Covering Model with Partial Coverage and Geographical Information Systems for Locating Bank Branches
by: Ali Mohaghar, et al.
Published: (2017-12-01) -
Maximum Service Coverage in Business Site Selection Using Computer Geometry Software
by: Sergiy Yakovlev, et al.
Published: (2023-05-01)